Separations in Circular Security for Arbitrary Length Key Cycles

DOI10.1007/978-3-662-46497-7_15zbMATH Open1319.94074OpenAlexW118973911MaRDI QIDQ5261684FDOQ5261684

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

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (16)

• 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
• Bounded KDM Security from iO and OWF
• Standard Security Does Not Imply Indistinguishability Under Selective Opening
• Counterexamples to new circular security assumptions underlying iO
• 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
• SoK: learning with errors, circular security, and fully homomorphic 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
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
• Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption
• 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)