On the circular security of bit-encryption

DOI10.1007/978-3-642-36594-2_32MaRDI QIDQ4910299zbMATH OpenOpenAlexFDO

Authors Ron D. Rothblum

Publication date 18 March 2013

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36594-2_32

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Toward fine-grained blackbox separations between semantic and circular-security notions
• Separations in circular security for arbitrary length key cycles
• Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
• Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
• Reproducible circularly-secure bit encryption: applications and realizations

Cited in

(21)

• On the bit security of cryptographic primitives
• Reproducible circularly secure bit encryption: applications and realizations
• Counterexamples to new circular security assumptions underlying iO
• Circular security is complete for KDM security
• New circular security counterexamples from decision linear and learning with errors
• Impossibility of VBB obfuscation with ideal constant-degree graded encodings
• Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
• Circular Security Separations for Arbitrary Length Cycles from LWE
• Spooky interaction and its discontents: compilers for succinct two-message argument systems
• Reproducible circularly-secure bit encryption: applications and realizations
• Circular-Secure Encryption from Decision Diffie-Hellman
• On the Bit Security of NTRUEncrypt
• Obfuscating conjunctions
• Bit Encryption Is Complete
• 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
• Circular insecure encryption: from long cycles to short cycles

This page was built for publication: On the circular security of bit-encryption

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