Separations in circular security for arbitrary length key cycles

DOI10.1007/978-3-662-46497-7_15MaRDI QIDQ5261684zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
• Obfuscation (IND-CPA security 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

(24)

• Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
• Counterexamples to new circular security assumptions underlying iO
• KDM security for identity-based encryption: constructions and separations
• Circular security is complete for KDM security
• 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
• New definitions and separations for circular security
• Obfuscation (IND-CPA security circular security)
• Standard security does not imply indistinguishability under selective opening
• Cryptographic agility and its relation to circular encryption
• Circular-Secure Encryption from Decision Diffie-Hellman
• Cycle Structure of the DES for Keys Having Palindromic (or Antipalindromic) Sequences of Round Keys
• On the circular security of bit-encryption
• Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
• Toward fine-grained blackbox separations between semantic and circular-security notions
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
• 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
• SoK: learning with errors, circular security, and fully homomorphic encryption
• Fully composable homomorphic encryption
• Incompressible encryption beyond CPA/CCA security
• Circular insecure encryption: from long cycles to short cycles

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)