A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
From MaRDI portal
Publication:2891507
DOI10.1007/978-3-642-28914-9_33zbMath1296.94111OpenAlexW2119718174MaRDI QIDQ2891507
Adam O'Neill, Leonid Reyzin, Benjamin Fuller
Publication date: 15 June 2012
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_33
Related Items (20)
Toward RSA-OAEP Without Random Oracles ⋮ Pseudoentropy: Lower-Bounds for Chain Rules and Transformations ⋮ Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ Reproducible Circularly-Secure Bit Encryption: Applications and Realizations ⋮ A counterexample to the chain rule for conditional HILL entropy ⋮ Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model ⋮ The Chain Rule for HILL Pseudoentropy, Revisited ⋮ Metric Pseudoentropy: Characterizations, Transformations and Applications ⋮ Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy ⋮ A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage ⋮ Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ Incremental deterministic public-key encryption ⋮ Deterministic public-key encryption for adaptively-chosen plaintext distributions ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ A generic construction of CCA-secure deterministic encryption ⋮ 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 ⋮ Deterministic Public-Key Encryption Under Continual Leakage ⋮ On selective-opening security of deterministic primitives
This page was built for publication: A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy