Separating IND-CPA and Circular Security for Unbounded Length Key Cycles

DOI10.1007/978-3-662-54365-8_10zbMath1404.94076OpenAlexW2589872072MaRDI QIDQ5738789

Brent Waters, Rishab Goyal, 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-662-54365-8_10

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

PFLM: privacy-preserving federated learning with membership proof ⋮ Universal amplification of KDM security: from 1-key circular to multi-key KDM ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• New Circular Security Counterexamples from Decision Linear and Learning with Errors
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
• Circular Security Separations for Arbitrary Length Cycles from LWE
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Practical Multilinear Maps over the Integers
• Circular and KDM Security for Identity-Based Encryption
• New Definitions and Separations for Circular Security
• Obfuscation ⇒ (IND-CPA Security $\not\Rightarrow$ Circular Security)
• How to Obfuscate Programs Directly
• Black-Box Circular-Secure Encryption beyond Affine Functions
• Efficient Circuit-Size Independent Public Key Encryption with KDM Security
• Key-Dependent Message Security: Generic Amplification and Completeness
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• 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
• On the (Im)Possibility of Key Dependent Encryption
• Candidate Multilinear Maps from Ideal Lattices
• Fully homomorphic encryption using ideal lattices
• How to use indistinguishability obfuscation
• Separations in Circular Security for Arbitrary Length Key Cycles
• Obfuscation of Probabilistic Circuits and Applications
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Separating IND-CPA and Circular Security for Unbounded Length Key Cycles