Leftover Hash Lemma, Revisited

DOI10.1007/978-3-642-22792-9_1zbMath1287.94047OpenAlexW2144336066WikidataQ58765146 ScholiaQ58765146MaRDI QIDQ5199181

Yu Yu, Hugo Krawczyk, Krzysztof Pietrzak, Yevgeniy Dodis, Boaz Barak, Olivier Pereira, François-Xavier Standaert

Publication date: 12 August 2011

Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22792-9_1

Mathematics Subject Classification ID

Cryptography (94A60) Measures of information, entropy (94A17) Information theory (general) (94A15)

Related Items (19)

Witness authenticating NIZKs and applications ⋮ Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint ⋮ On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ Metric Pseudoentropy: Characterizations, Transformations and Applications ⋮ Selective-Opening Security in the Presence of Randomness Failures ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Efficient and Provable White-Box Primitives ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Bounded-Retrieval Model with Keys Derived from Private Data ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Computational fuzzy extractors ⋮ Immunization against complete subversion without random oracles ⋮ Traceable ring signatures: general framework and post-quantum security ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ Cryptographic pseudorandom generators can make cryptosystems problematic ⋮ Security analysis of NIST CTR-DRBG ⋮ Leakage-resilient key exchange and two-seed extractors

This page was built for publication: Leftover Hash Lemma, Revisited