Leftover Hash Lemma, Revisited

From MaRDI portal
Revision as of 16:54, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5199181

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






Related Items (26)

Witness authenticating NIZKs and applicationsShannon Entropy Versus Renyi Entropy from a Cryptographic ViewpointOn the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptographyMetric Pseudoentropy: Characterizations, Transformations and ApplicationsSelective-Opening Security in the Presence of Randomness Failures(Nondeterministic) hardness vs. non-malleabilityEfficient and Provable White-Box PrimitivesUnnamed ItemUnnamed ItemNon-interactive zero-knowledge from non-interactive batch argumentsBounded-Retrieval Model with Keys Derived from Private DataCollusion Resistant Traitor Tracing from Learning with ErrorsComputational fuzzy extractorsImmunization against complete subversion without random oraclesAlmost Chor-Goldreich sources and adversarial random walksTraceable ring signatures: general framework and post-quantum securityA forkcipher-based pseudo-random number generatorLinear hashing with \(\ell_\infty\) guarantees and two-sided Kakeya boundsPseudorandomness of decoding, revisited: adapting OHCP to code-based cryptographyUnified view for notions of bit securitySecurity analysis of the ISO standard \textsf{OFB}-\textsf{DRBG}\(k\)-SUM in the sparse regime: complexity and applicationsVerifiable random functions: relations to identity-based key encapsulation and new constructionsCryptographic pseudorandom generators can make cryptosystems problematicSecurity analysis of NIST CTR-DRBGLeakage-resilient key exchange and two-seed extractors







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