Separations in Circular Security for Arbitrary Length Key Cycles

DOI10.1007/978-3-662-46497-7_15zbMath1319.94074OpenAlexW118973911MaRDI QIDQ5261684

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

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

Related Items (13)

Counterexamples to new circular security assumptions underlying iO ⋮ Standard Security Does Not Imply Indistinguishability Under Selective Opening ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Universal amplification of KDM security: from 1-key circular to multi-key KDM ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Post-quantum insecurity from LWE ⋮ Circular security is complete for KDM security ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ Bounded KDM Security from iO and OWF ⋮ Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE ⋮ Circular Security Separations for Arbitrary Length Cycles from LWE ⋮ Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption

This page was built for publication: Separations in Circular Security for Arbitrary Length Key Cycles