Good–Turing frequency estimation

The leftover hash lemma is a lemma in cryptography first stated by Russell Impagliazzo, Leonid Levin, and Michael Luby.

Imagine that you have a secret key $X$ that has $n$ uniform random bits, and you would like to use this secret key to encrypt a message. Unfortunately, you were a bit careless with the key, and know that an adversary was able to learn about $t<n$ bits of that key, but you do not know which. Can you still use your key, or do you have to throw it away and choose a new key? The leftover hash lemma tells us that we can produce a key of almost $n-t$ bits, over which the adversary has almost no knowledge. Since the adversary knows all but $n-t$ bits, this is almost optimal.

More precisely, the leftover hash lemma tells us that we can extract about $H_{\mathrm{\infty }}(X)$ (the min-entropy of $X$) bits from a random variable $X$ that are almost uniformly distributed. In other words, an adversary who has some partial knowledge about $X$, will have almost no knowledge about the extracted value. That is why this is also called privacy amplification (see privacy amplification section in the article Quantum key distribution).

Randomness extractors achieve the same result, but use (normally) less randomness.

Leftover hash lemma

Let $X$ be a random variable over $\mathcal{𝒳}$ and let $m>0$. Let $h:\mathcal{𝒮}\times \mathcal{𝒳}\to \{0,1{\}}^m$ be a 2-universal hash function. If

$m\le H_{\mathrm{\infty }}(X)-2\log \left(\frac{1}{\epsilon }\right)$

then for $S$ uniform over $\mathcal{𝒮}$ and independent of $X$, we have

$\delta [(h(S,X),S),(U,S)]\le \epsilon$

where $U$ is uniform over $\{0,1{\}}^m$ and independent of $S$.

$H_{\mathrm{\infty }}(X)=-\log {\max }_x\mathrm{Pr}[X=x]$ is the Min-entropy of $X$, which measures the amount of randomness $X$ has. The min-entropy is always less than or equal to the Shannon entropy. Note that ${\max }_x\mathrm{Pr}[X=x]$ is the probability of correctly guessing $X$. (The best guess is to guess the most probable value.) Therefore, the min-entropy measures how difficult it is to guess $X$.

$\delta (X,Y)=\frac{1}{2}\sum _v|\mathrm{Pr}[X=v]-\mathrm{Pr}[Y=v]|$ is a statistical distance between $X$ and $Y$.

See also

• Universal hashing
• Min-entropy
• Rényi entropy
• Information theoretic security

References

• C. H. Bennett, G. Brassard, and J. M. Robert. Privacy amplification by public discussion. SIAM Journal on Computing, 17(2):210-229, 1988.
• R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from one-way functions. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC '89), pages 12-24. ACM Press, 1989.
• C. Bennett, G. Brassard, C. Crepeau, and U. Maurer. Generalized privacy amplification. IEEE Transactions on Information Theory, 41, 1995.
• J. Håstad, R. Impagliazzo, L. A. Levin and M. Luby. A Pseudorandom Generator from any One-way Function. SIAM Journal on Computing, v28 n4, pp. 1364-1396, 1999.