Deterministic public-key encryption for adaptively-chosen plaintext distributions

DOI10.1007/s00145-018-9287-yzbMath1442.94045OpenAlexW2146919330WikidataQ123022375 ScholiaQ123022375MaRDI QIDQ1994638

Ananth Raghunathan, Gil Segev, Salil P. Vadhan

Publication date: 1 November 2018

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-018-9287-y

zbMATH Keywords

public-key encryptionrandomness extractiondeterministic encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Probabilistic encryption
• More constructions of lossy and correlation-secure trapdoor functions
• Derandomized constructions of \(k\)-wise (almost) independent permutations
• 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
• Barriers in cryptography with weak, correlated and leaky sources
• Fully Leakage-Resilient Signatures
• Lossy Trapdoor Functions and Their Applications
• How to fool an unbounded adversary with a short key
• Bonsai Trees, or How to Delegate a Lattice Basis
• Correcting errors without leaking partial information
• Instantiability of RSA-OAEP under Chosen-Plaintext Attack
• 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
• Hedged Public-Key Encryption: How to Protect against Bad Randomness
• Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Theory of Cryptography

This page was built for publication: Deterministic public-key encryption for adaptively-chosen plaintext distributions