How secure is deterministic encryption?

DOI10.1007/978-3-662-46447-2_3MaRDI QIDQ2941186zbMATH OpenOpenAlexFDO

Authors M. Bellare, Rafael Dowsley, Sriram Keelveedhi

Publication date 27 August 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46447-2_3

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• Better security for deterministic public-key encryption: the auxiliary-input setting
• A generic construction of CCA-secure deterministic encryption
• Deterministic public-key encryption for adaptively chosen plaintext distributions

Cited in

(8)

• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Selective-Opening Security in the Presence of Randomness Failures
• A generic construction of CCA-secure deterministic encryption
• Towards tightly secure deterministic public key encryption
• On selective-opening security of deterministic primitives
• The local forking lemma and its application to deterministic encryption
• Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation

This page was built for publication: How secure is deterministic encryption?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941186)