6 search results - page 1 / 2 » Leftover Hash Lemma, Revisited |
CRYPTO
2011
Springer
12 years 4 months ago
2011
Springer
PROVSEC
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempt...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract. Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately...
CCS
2008
ACM
13 years 6 months ago
2008
ACM
In this paper, we study the security of a practical randomness extractor and its application in the tls standard. Randomness extraction is the first stage of key derivation functi...