On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
From MaRDI portal
Publication:3600228
DOI10.1007/978-3-540-85174-5_19zbMath1183.94024OpenAlexW2138669153MaRDI QIDQ3600228
Alexandra Boldyreva, Adam O'Neill, Serge Fehr
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_19
Related Items (36)
Targeted lossy functions and applications ⋮ Compact Lossy and All-but-One Trapdoor Functions from Lattice ⋮ Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ A Punctured Programming Approach to Adaptively Secure Functional Encryption ⋮ Regular lossy functions and their applications in leakage-resilient cryptography ⋮ Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Instantiability of RSA-OAEP under chosen-plaintext attack ⋮ Updatable Lossy Trapdoor Functions and Its Application in Continuous Leakage ⋮ Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ How to build a trapdoor function from an encryption scheme ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Lossy trapdoor functions from homomorphic reproducible encryption ⋮ 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 ⋮ Obfuscating conjunctions ⋮ Deterministic public-key encryption for adaptively-chosen plaintext distributions ⋮ 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 ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ 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 ⋮ General Construction of Chameleon All-But-One Trapdoor Functions ⋮ Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli ⋮ Leakage resilience from program obfuscation ⋮ Ciphertext-Policy Delegatable Hidden Vector Encryption and Its Application to Searchable Encryption in Multi-user Setting
Cites Work
- Entropic security in quantum cryptography
- New hash functions and their use in authentication and set equality
- Universal classes of hash functions
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Lossy trapdoor functions and their applications
- Correcting errors without leaking partial information
- 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
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A Pseudorandom Generator from any One-way Function
- Generalized privacy amplification
- Quantum Entropic Security and Approximate Quantum Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
