Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption

DOI10.1007/978-3-319-56614-6_18zbMath1415.94432OpenAlexW2592059199MaRDI QIDQ5267417

Rishab Goyal, Brent Waters, Venkata Koppula

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_18

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Counterexamples to new circular security assumptions underlying iO ⋮ Return of GGH15: provable security against zeroizing attacks ⋮ Universal amplification of KDM security: from 1-key circular to multi-key KDM ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Circular security is complete for KDM security ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Collusion Resistant Traitor Tracing from Learning with Errors

Cites Work

• Unnamed Item
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• New Circular Security Counterexamples from Decision Linear and Learning with Errors
• A Decade of Lattice Cryptography
• 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
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Pseudorandom Functions and Lattices
• 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
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Bounds for Width Two Branching Programs
• On the Circular Security of Bit-Encryption
• 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
• Graph-Induced Multilinear Maps from Lattices
• Advances in Cryptology - EUROCRYPT 2004
• 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: Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption