Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

DOI10.1007/978-3-540-85174-5_20zbMath1183.94020OpenAlexW2153145614MaRDI QIDQ3600229

Thomas Ristenpart, Adam O'Neill, Mihir Bellare, Marc Fischlin

Publication date: 10 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85174-5_20

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Plaintext-Checkable Encryption ⋮ Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ A Punctured Programming Approach to Adaptively Secure Functional Encryption ⋮ Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model ⋮ Selective-Opening Security in the Presence of Randomness Failures ⋮ Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Lossy Key Encapsulation Mechanism and Its Applications ⋮ Towards Tightly Secure Deterministic Public Key Encryption ⋮ Efficient public-key encryption with equality test from lattices ⋮ Incremental deterministic public-key encryption ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Deterministic public-key encryption for adaptively-chosen plaintext distributions ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ A generic construction of CCA-secure deterministic encryption ⋮ On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles ⋮ Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles ⋮ Point-Function Obfuscation: A Framework and Generic Constructions ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Order-Preserving Symmetric Encryption ⋮ Better security for deterministic public-key encryption: the auxiliary-input setting ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions ⋮ Deterministic Public-Key Encryption Under Continual Leakage ⋮ Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli ⋮ Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Entropic security in quantum cryptography
• Probabilistic encryption
• A uniform-complexity treatment of encryption and zero-knowledge
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Lossy trapdoor functions and their applications
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• Deterministic and Efficiently Searchable Encryption
• A Simple Unpredictable Pseudo-Random Number Generator
• An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
• The Notion of Security for Probabilistic Cryptosystems
• Quantum Entropic Security and Approximate Quantum Encryption
• Advances in Cryptology - EUROCRYPT 2004
• Public-Key Encryption with Non-interactive Opening
• Theory of Cryptography

This page was built for publication: Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles