Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Discrete Gaussian Leftover Hash Lemma over Infinite Domains

Shweta Agrawal, Craig Gentry, Shai Halevi, Amit Sahai

Published Jan 1, 2013• 58 citations
Publisher
DOI
10.1007/978-3-642-42033-7_6

Related papers

Discrete Gaussians Modulo Sub-Lattices: New Leftover Hash Lemmas for Discrete Gaussians

Haoxiang Jin, Feng-Hao Liu, Zhedong Wang +1 more

Lecture notes in computer science•Jan 1, 2025•4 citations

Spherical Gaussian Leftover Hash Lemma via the Rényi Divergence

Hiroki Okada, Kazuhide Fukushima, Shinsaku Kiyomoto +1 more

Lecture notes in computer science•Jan 1, 2023•0 citations

Simple hash function using discrete-time quantum walks

Yu‐Guang Yang, Jing-Lin Bi, Xiu‐Bo Chen +3 more

Quantum Information Processing•Jun 20, 2018•26 citations

Trapdoor Hash Functions and Their Applications

Nico Döttling, Sanjam Garg, Yuval Ishai +3 more

Lecture notes in computer science•Jan 1, 2019•106 citations

Leftover Hashing Against Quantum Side Information

Marco Tomamichel, Christian Schaffner, Adam Smith +1 more

The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random. In its standard formulation, the lemma refers to a notion of randomness that is (usually implicitly) defined with respect to classical side information. Here, a strictly more general version of the Leftover Hash Lemma that is valid even if side information is represented by the state of a quantum system is shown. Our result applies to almost two-universal families of hash functions. The generalized Leftover Hash Lemma has applications in cryptography, e.g., for key agreement in the presence of an adversary who is not restricted to classical information processing.

arXiv:1002.2436•IEEE Transactions on Information Theory•Aug 1, 2011•303 citations

Leftover Hashing against quantum side information

Marco Tomamichel, Renato Renner, Christian Schaffner +1 more

The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random. In its standard formulation, the lemma refers to a notion of randomness that is (usually implicitly) defined with respect to classical side information. Here, we prove a (strictly) more general version of the Leftover Hash Lemma that is valid even if side information is represented by the state of a quantum system. Furthermore, our result applies to arbitrary δ-almost two-universal families of hash functions. The generalized Leftover Hash Lemma has applications in cryptography, e.g., for key agreement in the presence of an adversary who is not restricted to classical information processing.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•38 citations
The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random. In its standard formulation, the lemma refers to a notion of randomness that is (usually implicitly) defined with respect to classical side information. Here, a strictly more general version of the Leftover Hash Lemma that is valid even if side information is represented by the state of a quantum system is shown. Our result applies to almost two-universal families of hash functions. The generalized Leftover Hash Lemma has applications in cryptography, e.g., for key agreement in the presence of an adversary who is not restricted to classical information processing.
The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random. In its standard formulation, the lemma refers to a notion of randomness that is (usually implicitly) defined with respect to classical side information. Here, we prove a (strictly) more general version of the Leftover Hash Lemma that is valid even if side information is represented by the state of a quantum system. Furthermore, our result applies to arbitrary δ-almost two-universal families of hash functions. The generalized Leftover Hash Lemma has applications in cryptography, e.g., for key agreement in the presence of an adversary who is not restricted to classical information processing.