Incremental deterministic public-key encryption

DOI10.1007/S00145-017-9252-1MaRDI QIDQ1747660zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

public-key encryptiondeterministic encryptionincremental cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

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

Cited in

(10)

• Incremental Deterministic Public-Key Encryption
• Efficient constructions of deterministic encryption from hybrid encryption and code-based PKE
• scientific article; zbMATH DE number 1406782 (Why is no real title available?)
• 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

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)