Leftover Hash Lemma, Revisited
From MaRDI portal
Recommendations
- Towards a ring analogue of the leftover hash lemma
- scientific article; zbMATH DE number 1874366
- Discrete Gaussian leftover hash lemma over infinite domains
- scientific article; zbMATH DE number 7121810
- The circulant hash revisited
- A new interactive hashing theorem
- Recursive bounds for perfect hashing
- A combinatorial characterization of certain universal classes of hash functions
- Hash proof systems over lattices revisited
- The complexity of hashing with lazy deletion
Cited in
(38)- Towards a ring analogue of the leftover hash lemma
- Traceable ring signatures: general framework and post-quantum security
- Cryptographic pseudorandom generators can make cryptosystems problematic
- Security analysis of NIST CTR-DRBG
- Leakage-resilient key exchange and two-seed extractors
- Witness authenticating NIZKs and applications
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Computational fuzzy extractors
- Immunization against complete subversion without random oracles
- Discrete Gaussian leftover hash lemma over infinite domains
- Metric pseudoentropy: characterizations, transformations and applications
- Selective-Opening Security in the Presence of Randomness Failures
- Efficient and Provable White-Box Primitives
- Bounded-retrieval model with keys derived from private data
- Shannon entropy versus Renyi entropy from a cryptographic viewpoint
- scientific article; zbMATH DE number 1874366 (Why is no real title available?)
- Overcoming weak expectations
- Renyi entropy estimation revisited
- Collusion resistant traitor tracing from learning with errors
- scientific article; zbMATH DE number 7121810 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Key derivation without entropy waste
- scientific article; zbMATH DE number 7650126 (Why is no real title available?)
- (Nondeterministic) hardness vs. non-malleability
- Replacing Probability Distributions in Security Games via Hellinger Distance
- Non-interactive zero-knowledge from non-interactive batch arguments
- Almost Chor-Goldreich sources and adversarial random walks
- A forkcipher-based pseudo-random number generator
- Linear hashing with \(\ell_\infty\) guarantees and two-sided Kakeya bounds
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
- Unified view for notions of bit security
- Security analysis of the ISO standard \textsf{OFB}-\textsf{DRBG}
- \(k\)-SUM in the sparse regime: complexity and applications
- Re-randomize and extract: a novel commitment construction framework based on group actions
- Evasive LWE assumptions: definitions, classes, and counterexamples
- QuietOT: lightweight oblivious transfer with a public-key setup
- Sharp lower bounds on the extractable randomness from non-uniform sources
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
This page was built for publication: Leftover Hash Lemma, Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199181)
