Efficient Circuit-Size Independent Public Key Encryption with KDM Security
From MaRDI portal
Publication:3003400
DOI10.1007/978-3-642-20465-4_28zbMath1290.94108OpenAlexW1543879005MaRDI QIDQ3003400
Isamu Teranishi, Tal Malkin, Mordechai M. Yung
Publication date: 27 May 2011
Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_28
Related Items (13)
Reproducible Circularly-Secure Bit Encryption: Applications and Realizations ⋮ Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Updatable public key encryption in the standard model ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ Completeness of Single-Bit Projection-KDM Security for Public Key Encryption ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ Key-Dependent Message Security for Division Function: Discouraging Anonymous Credential Sharing ⋮ Bounded KDM Security from iO and OWF ⋮ Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE ⋮ Optimally Sound Sigma Protocols Under DCRA ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions
This page was built for publication: Efficient Circuit-Size Independent Public Key Encryption with KDM Security
