Circular insecure encryption: from long cycles to short cycles

DOI10.62056/AE0ZO-3YMaRDI QIDQ7346675zbMATH OpenFDO

Authors Zehou Wu

Publication date 11 September 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AE0ZO-3Y

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Black-box circular-secure encryption beyond affine functions
• Bounded key-dependent message security
• Circular security is complete for KDM security
• Circular-Secure Encryption from Decision Diffie-Hellman
• Computational soundness of coinductive symbolic security under active attacks
• Computational soundness, co-induction, and encryption cycles
• Cryptographic agility and its relation to circular encryption
• Deciding Key Cycles for Security Protocols
• Efficient fully homomorphic encryption from (standard) LWE
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• scientific article; zbMATH DE number 1951605 (Why is no real title available?)
• scientific article; zbMATH DE number 1759457 (Why is no real title available?)
• Indistinguishability obfuscation from circular security
• Key-dependent message security: generic amplification and completeness
• Lockable obfuscation
• Lockable obfuscation from circularly insecure fully homomorphic encryption
• New circular security counterexamples from decision linear and learning with errors
• New definitions and separations for circular security
• Obfuscation (IND-CPA security circular security)
• On the circular security of bit-encryption
• On the security of public key protocols
• Probabilistic encryption
• 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
• Separations in circular security for arbitrary length key cycles
• Symbolic encryption with pseudorandom keys
• Theory of Cryptography
• Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
• Toward fine-grained blackbox separations between semantic and circular-security notions
• Universal amplification of KDM security: from 1-key circular to multi-key KDM

This page was built for publication: Circular insecure encryption: from long cycles to short cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346675)