Better security for deterministic public-key encryption: the auxiliary-input setting
From MaRDI portal
Publication:744600
DOI10.1007/S00145-012-9143-4zbMath1297.94056OpenAlexW2087591603WikidataQ121811155 ScholiaQ121811155MaRDI QIDQ744600
Publication date: 25 September 2014
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-012-9143-4
Related Items (1)
Cites Work
- Unnamed Item
- Probabilistic encryption
- Building Lossy Trapdoor Functions from Lossy Encryption
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
- Incremental Deterministic Public-Key Encryption
- Lossy Trapdoor Functions and Their Applications
- Public-Key Encryption Schemes with Auxiliary Inputs
- How to fool an unbounded adversary with a short key
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions
- A Simple BGN-Type Cryptosystem from LWE
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular-Secure Encryption from Decision Diffie-Hellman
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Deterministic and Efficiently Searchable Encryption
- Hedged Public-Key Encryption: How to Protect against Bad Randomness
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Foundations of Cryptography
- On cryptography with auxiliary input
- Theory of Cryptography
- Theory of Cryptography
- Public-Key Cryptosystems Resilient to Key Leakage
This page was built for publication: Better security for deterministic public-key encryption: the auxiliary-input setting
