Circular Security Separations for Arbitrary Length Cycles from LWE

DOI10.1007/978-3-662-53008-5_24zbMath1391.94770OpenAlexW2501358932MaRDI QIDQ2829235

Brent Waters, Venkata Koppula

Publication date: 27 October 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_24

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Counterexamples to new circular security assumptions underlying iO ⋮ Universal amplification of KDM security: from 1-key circular to multi-key KDM ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ 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 ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• New Circular Security Counterexamples from Decision Linear and Learning with Errors
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Circular and KDM Security for Identity-Based Encryption
• New Definitions and Separations for Circular Security
• Obfuscation ⇒ (IND-CPA Security $\not\Rightarrow$ Circular Security)
• Cryptanalysis of the Multilinear Map over the Integers
• Black-Box Circular-Secure Encryption beyond Affine Functions
• Key-Dependent Message Security: Generic Amplification and Completeness
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
• Trapdoors for hard lattices and new cryptographic constructions
• Cryptographic Agility and Its Relation to Circular Encryption
• Bounded Key-Dependent Message Security
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Circular-Secure Encryption from Decision Diffie-Hellman
• Candidate Multilinear Maps from Ideal Lattices
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Separations in Circular Security for Arbitrary Length Key Cycles
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Circular Security Separations for Arbitrary Length Cycles from LWE