Hedged Public-Key Encryption: How to Protect against Bad Randomness
From MaRDI portal
Publication:3650695
DOI10.1007/978-3-642-10366-7_14zbMath1267.94036OpenAlexW2101022010MaRDI QIDQ3650695
Moni Naor, Hovav Shacham, Zvika Brakerski, Scott Yilek, Gil Segev, Mihir Bellare, Thomas Ristenpart
Publication date: 15 December 2009
Published in: Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10366-7_14
Related Items (19)
Targeted lossy functions and applications ⋮ Security Against Related Randomness Attacks via Reconstructive Extractors ⋮ Security of public key encryption against resetting attacks ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Strengthening the security of authenticated key exchange against bad randomness ⋮ Selective-Opening Security in the Presence of Randomness Failures ⋮ On secret sharing, randomness, and random-less reductions for secret sharing ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ How to build a trapdoor function from an encryption scheme ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ Incremental deterministic public-key encryption ⋮ Deterministic public-key encryption for adaptively-chosen plaintext distributions ⋮ A generic construction of CCA-secure deterministic encryption ⋮ Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Better security for deterministic public-key encryption: the auxiliary-input setting ⋮ Security of hedged Fiat-Shamir signatures under fault attacks ⋮ Randomness Leakage in the KEM/DEM Framework
This page was built for publication: Hedged Public-Key Encryption: How to Protect against Bad Randomness