Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
From MaRDI portal
Recommendations
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- How secure is deterministic encryption?
- Deterministic public-key encryption for adaptively chosen plaintext distributions
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Deterministic and Efficiently Searchable Encryption
Cites work
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- scientific article; zbMATH DE number 1088253 (Why is no real title available?)
- scientific article; zbMATH DE number 1775397 (Why is no real title available?)
- scientific article; zbMATH DE number 2086703 (Why is no real title available?)
- scientific article; zbMATH DE number 1418315 (Why is no real title available?)
- A Simple Unpredictable Pseudo-Random Number Generator
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A uniform-complexity treatment of encryption and zero-knowledge
- Advances in Cryptology - EUROCRYPT 2004
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Deterministic and Efficiently Searchable Encryption
- Entropic security in quantum cryptography
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Lossy trapdoor functions and their applications
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Probabilistic encryption
- Public-Key Encryption with Non-interactive Opening
- Quantum Entropic Security and Approximate Quantum Encryption
- The Notion of Security for Probabilistic Cryptosystems
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Theory of Cryptography
Cited in
(34)- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Subversion-resilient signatures: definitions, constructions and applications
- Deterministic public-key encryption for adaptively-chosen plaintext distributions
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- Lossy key encapsulation mechanism and its applications
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- 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
- Point-function obfuscation: a framework and generic constructions
- Selective-Opening Security in the Presence of Randomness Failures
- How secure is deterministic encryption?
- Incremental deterministic public-key encryption
- A generic construction of CCA-secure deterministic encryption
- Deterministic Public-Key Encryption Under Continual Leakage
- Two is a crowd? A black-box separation of one-wayness and security under correlated inputs
- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
- Deterministic public-key encryption for adaptively chosen plaintext distributions
- Deterministic and Efficiently Searchable Encryption
- Adversary-dependent lossy trapdoor function from hardness of factoring semi-smooth RSA subgroup moduli
- Better security for deterministic public-key encryption: the auxiliary-input setting
- CCA-security from adaptive all-but-one lossy trapdoor functions
- Towards tightly secure deterministic public key encryption
- Functional encryption: deterministic to randomized functions from simple assumptions
- A punctured programming approach to adaptively secure functional encryption
- Order-Preserving Symmetric Encryption
- The local forking lemma and its application to deterministic encryption
- On ELFs, deterministic encryption, and correlated-input security
- Reproducible circularly secure bit encryption: applications and realizations
- Efficient public-key encryption with equality test from lattices
- Approximate-deterministic public key encryption from hard learning problems
- On the impossibility of structure-preserving deterministic primitives
- Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation
- Plaintext-checkable encryption
This page was built for publication: Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600229)
