The following pages link to Leftover Hash Lemma, Revisited (Q5199181):
Displaying 17 items.
- Verifiable random functions: relations to identity-based key encapsulation and new constructions (Q744351) (← links)
- Traceable ring signatures: general framework and post-quantum security (Q2034982) (← links)
- Cryptographic pseudorandom generators can make cryptosystems problematic (Q2061967) (← links)
- Security analysis of NIST CTR-DRBG (Q2096485) (← links)
- Leakage-resilient key exchange and two-seed extractors (Q2096493) (← links)
- Witness authenticating NIZKs and applications (Q2139626) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Computational fuzzy extractors (Q2216116) (← links)
- Immunization against complete subversion without random oracles (Q2227487) (← links)
- Metric Pseudoentropy: Characterizations, Transformations and Applications (Q2947525) (← links)
- Selective-Opening Security in the Presence of Randomness Failures (Q2953780) (← links)
- Efficient and Provable White-Box Primitives (Q2958118) (← links)
- Bounded-Retrieval Model with Keys Derived from Private Data (Q2980861) (← links)
- Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint (Q3460111) (← links)
- (Q5002623) (← links)
- Collusion Resistant Traitor Tracing from Learning with Errors (Q5130846) (← links)
- (Q5875519) (← links)
