Separations in circular security for arbitrary length key cycles
From MaRDI portal
Publication:5261684
DOI10.1007/978-3-662-46497-7_15zbMATH Open1319.94074OpenAlexW118973911MaRDI QIDQ5261684FDOQ5261684
Authors: Venkata Koppula, Kim Ramchen, Brent Waters
Publication date: 6 July 2015
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_15
Recommendations
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- Obfuscation \(\Rightarrow\) (IND-CPA security \(\nRightarrow\) circular security)
- New definitions and separations for circular security
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Toward fine-grained blackbox separations between semantic and circular-security notions
Cited In (21)
- KDM security for identity-based encryption: constructions and separations
- Post-quantum insecurity from LWE
- Universal amplification of KDM security: from 1-key circular to multi-key KDM
- On the circular security of bit-encryption
- Toward fine-grained blackbox separations between semantic and circular-security notions
- Counterexamples to new circular security assumptions underlying iO
- Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
- Lockable obfuscation from circularly insecure fully homomorphic encryption
- Cycle Structure of the DES for Keys Having Palindromic (or Antipalindromic) Sequences of Round Keys
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Obfuscation \(\Rightarrow\) (IND-CPA security \(\nRightarrow\) circular security)
- New definitions and separations for circular security
- SoK: learning with errors, circular security, and fully homomorphic encryption
- Cryptographic agility and its relation to circular encryption
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Circular security is complete for KDM security
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
- Standard security does not imply indistinguishability under selective opening
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- Bounded KDM security from iO and OWF
- Circular-Secure Encryption from Decision Diffie-Hellman
This page was built for publication: Separations in circular security for arbitrary length key cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261684)