# Leftover hash lemma

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- IEEE International Symposium on Informationâ€¦
- 2017

Universal hashing found a lot of applications in computer science. In cryptography the most important fact about universalâ€¦Â (More)

Is this relevant?

2016

2016

- 2016

Â

Is this relevant?

2015

2015

- 2015

We recall some definitions and a claim proved in our previous lecture. These will be required to finish the proof for theâ€¦Â (More)

Is this relevant?

2014

2014

- ICCSW
- 2014

Barak et al. showed how to significantly reduce the entropy loss, which is necessary in general, in the use of the Leftover Hashâ€¦Â (More)

Is this relevant?

2013

2013

- ASIACRYPT
- 2013

The classic Leftover Hash Lemma (LHL) is often used to argue that certain distributions arising from modular subset-sums areâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- CRYPTO
- 2011

The famous Leftover Hash Lemma (LHL) states that (almost) universal hash functions are good randomness extractors. Despite itsâ€¦Â (More)

Is this relevant?

2011

2011

- 2011

Property (ii) is particularly useful: Suppose that T is the set of random inputs that cause an algorithm to fail and the failureâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- IEEE Transactions on Information Theory
- 2011

The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently highâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- IEEE Transactions on Information Theory
- 2008

This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulationâ€¦Â (More)

Is this relevant?

2001

2001

- 2001

This paper is an expository treatment of the leftover hash lemma and some of its applications in cryptography and complexityâ€¦Â (More)

Is this relevant?