Incremental deterministic public-key encryption

DOI10.1007/S00145-017-9252-1zbMATH Open1421.94064OpenAlexW2606514712WikidataQ121243165 ScholiaQ121243165MaRDI QIDQ1747660FDOQ1747660

Authors: Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev 

Publication date: 26 April 2018

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

Full work available at URL: https://doi.org/10.1007/s00145-017-9252-1

Recommendations

• Incremental Deterministic Public-Key Encryption
• Deterministic public-key encryption for adaptively chosen plaintext distributions
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• Better security for deterministic public-key encryption: the auxiliary-input setting

zbMATH Keywords

public-key encryptiondeterministic encryptionincremental cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Probabilistic encryption
• A Pseudorandom Generator from any One-way Function
• Public-key cryptosystems resilient to key leakage
• Constructing locally computable extractors and cryptosystems in the bounded-storage model
• Circular-Secure Encryption from Decision Diffie-Hellman
• Better security for deterministic public-key encryption: the auxiliary-input setting
• Randomness is linear in space
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Cryptography in $NC^0$
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• Title not available (Why is that?)
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Deterministic and Efficiently Searchable Encryption
• Message-locked encryption and secure deduplication
• Dual projective hashing and its applications -- lossy trapdoor functions and more
• Lossy Trapdoor Functions and Their Applications
• How to fool an unbounded adversary with a short key
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• Hedged public-key encryption: how to protect against bad randomness
• Theory of Cryptography
• Title not available (Why is that?)
• Deterministic public-key encryption for adaptively chosen plaintext distributions
• More constructions of lossy and correlation-secure trapdoor functions
• Incremental Unforgeable Encryption
• Title not available (Why is that?)
• Message-Locked Encryption for Lock-Dependent Messages

Cited In (10)

• Efficient constructions of deterministic encryption from hybrid encryption and code-based PKE
• Title not available (Why is that?)
• A New Mode of Operation for Incremental Authenticated Encryption with Associated Data
• Deterministic public-key encryption for adaptively chosen plaintext distributions
• Public-Key Encryption with Efficient Amortized Updates
• CCA-security from adaptive all-but-one lossy trapdoor functions
• Updatable all-but-one dual projective hashing and its applications
• Incremental cryptography revisited: PRFs, nonces and modular design
• Approximate-deterministic public key encryption from hard learning problems
• Incremental Deterministic Public-Key Encryption

This page was built for publication: Incremental deterministic public-key encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747660)