A generic construction of CCA-secure deterministic encryption
From MaRDI portal
Publication:2011031
DOI10.1016/J.IPL.2019.105865zbMATH Open1468.94401OpenAlexW2982218185WikidataQ122178315 ScholiaQ122178315MaRDI QIDQ2011031FDOQ2011031
Authors: Yanyan Li 
Publication date: 28 November 2019
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2019.105865
Recommendations
- A simpler construction of CCA2-secure public-key encryption under general assumptions
- scientific article; zbMATH DE number 2009959
- Cryptography and Coding
- On CCA-Secure Somewhat Homomorphic Encryption
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption
- Efficient CCA-Secure Public-Key Encryption Schemes from RSA-Related Assumptions
- Towards tightly secure deterministic public key encryption
- Construction of fully CCA-secure predicate encryptions from pair encoding schemes
cryptographychosen ciphertext securitydeterministic public-key encryptiondeterministic identity-based encryption(hierarchical) identity-based lossy trapdoor functions
Cites Work
- Title not available (Why is that?)
- Better security for deterministic public-key encryption: the auxiliary-input setting
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- Lossy trapdoor functions and their applications
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Deterministic and Efficiently Searchable Encryption
- Dual projective hashing and its applications -- lossy trapdoor functions and more
- Incremental Deterministic Public-Key Encryption
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Hedged public-key encryption: how to protect against bad randomness
- Identity-based (lossy) trapdoor functions and applications
- Identity-based lossy trapdoor functions: new definitions, hierarchical extensions, and implications
- Deterministic public-key encryption for adaptively chosen plaintext distributions
- Hedging public-key encryption in the real world
- Hedged nonce-based public-key encryption: adaptive security under randomness failures
- Resisting randomness subversion: fast deterministic and hedged public-key encryption in the standard model
- Deterministic identity-based encryption from lattices with more compact public parameters
- Deterministic Public-Key Encryption Under Continual Leakage
- Deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting
- How secure is deterministic encryption?
- Efficient constructions of deterministic encryption from hybrid encryption and code-based PKE
- All-but-one dual projective hashing and its applications
Cited In (15)
- On CCA-Secure Somewhat Homomorphic Encryption
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
- Efficient constructions of deterministic encryption from hybrid encryption and code-based PKE
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- Deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting
- All-but-one dual projective hashing and its applications
- How secure is deterministic encryption?
- Title not available (Why is that?)
- CCA-security from adaptive all-but-one lossy trapdoor functions
- Towards tightly secure deterministic public key encryption
- CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
- Direct CCA-secure KEM and deterministic PKE from plain LWE
- Updatable all-but-one dual projective hashing and its applications
- Approximate-deterministic public key encryption from hard learning problems
This page was built for publication: A generic construction of CCA-secure deterministic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011031)
