Circular Security Separations for Arbitrary Length Cycles from LWE

DOI10.1007/978-3-662-53008-5_24zbMATH Open1391.94770OpenAlexW2501358932MaRDI QIDQ2829235FDOQ2829235

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)

Cites Work

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

Cited In (12)

• KDM security for identity-based encryption: constructions and separations
• Universal amplification of KDM security: from 1-key circular to multi-key KDM
• Bounded KDM Security from iO and OWF
• Counterexamples to new circular security assumptions underlying iO
• Lockable obfuscation from circularly insecure fully homomorphic encryption
• SoK: learning with errors, circular security, and fully homomorphic encryption
• Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
• Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions
• 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
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Circular-Secure Encryption from Decision Diffie-Hellman

Recommendations

• Circular-Secure Encryption from Decision Diffie-Hellman 👍 👎
• On the Circular Security of Bit-Encryption 👍 👎
• Circular Chosen-Ciphertext Security with Compact Ciphertexts 👍 👎
• Separations in Circular Security for Arbitrary Length Key Cycles 👍 👎
• Reproducible circularly secure bit encryption: applications and realizations 👍 👎
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles 👍 👎
• Reproducible Circularly-Secure Bit Encryption: Applications and Realizations 👍 👎
• On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes 👍 👎
• Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE 👍 👎

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

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