On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles

2008/08/20 by Alexandra Boldyreva, Serge Fehr, Adam O’Neill · 2 citations
Computer Science · #Complexity and Algorithms in Graphs #Cryptographic Implementations and Security #Cryptography and Data Security

paper · pdf · doi:10.1007/978-3-540-85174-5_19

openalex publication_date 2008/08/20 · crossref created 2008/08/20 · crossref deposited 2020/11/24 · openalex created_date 2025/10/10 · crossref indexed 2026/03/11 · openalex updated_date 2026/08/04

Citations

• New hash functions and their use in authentication and set equality
• A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

Cited by

• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• Deterministic encryption [wikipedia]