Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
From MaRDI portal
Publication:4924405
DOI10.1007/978-3-642-38348-9_6zbMath1306.94088OpenAlexW3021199033MaRDI QIDQ4924405
Gil Segev, Ananth Raghunathan, Salil P. Vadhan
Publication date: 31 May 2013
Published in: Advances in Cryptology – EUROCRYPT 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_6
Related Items (15)
Adaptively secure distributed PRFs from LWE ⋮ Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ Security Against Related Randomness Attacks via Reconstructive Extractors ⋮ Towards Forward Security Properties for PEKS and IBE ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ Lossy Key Encapsulation Mechanism and Its Applications ⋮ Towards Tightly Secure Deterministic Public Key Encryption ⋮ Incremental deterministic public-key encryption ⋮ A generic construction of CCA-secure deterministic encryption ⋮ Point-Function Obfuscation: A Framework and Generic Constructions ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions ⋮ Deterministic Public-Key Encryption Under Continual Leakage ⋮ Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli
This page was built for publication: Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
