Leftover hash lemma

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

Given a secret key X that has n uniform random bits, of which an adversary was able to learn the values of some t < n bits of that key, the leftover hash lemma states that it is possible to produce a key of about n − t bits, over which the adversary has almost no knowledge, without knowing which t are known to the adversary. Since the adversary knows all but n − t bits, this is almost optimal.

More precisely, the leftover hash lemma states that it is possible to extract a length asymptotic to $H_{\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. This is also known as privacy amplification (see privacy amplification section in the article Quantum key distribution).

In quantum cryptographic settings, privacy amplification must also bound information held in a quantum system. Hayashi analyzed the exponential decreasing rate of leaked information for universal random privacy amplification, giving exponent bounds for universal hashing against quantum side information.

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

Let X be a random variable over ${\mathcal {X}}$ and let $m>0$. Let ${\textstyle h\colon {\mathcal {S}}\times {\mathcal {X}}\rightarrow \{0,\,1\}^{m}}$ be a 2-universal hash function. If

${\textstyle m\leq H_{\infty }(X)-2\log \left({\frac {1}{\varepsilon }}\right)}$

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

${\textstyle \delta \left[(h(S,X),S),(U,S)\right]\leq \varepsilon .}$

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

${\textstyle H_{\infty }(X)=-\log \max _{x}\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 ${\textstyle \max _{x}\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.

${\textstyle 0\leq \delta (X,Y)={\frac {1}{2}}\sum _{v}\left|\Pr[X=v]-\Pr[Y=v]\right|\leq 1}$ 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.
• 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.