Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE

DOI10.1007/978-3-662-53008-5_23zbMATH Open1391.94721OpenAlexW2493056435MaRDI QIDQ2829234FDOQ2829234

Authors: Navid Alamati, Chris Peikert 

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_23

Recommendations

• Circular Security Separations for Arbitrary Length Cycles from LWE
• (In)security of ring-LWE under partial key exposure
• On secure two-party computation in three rounds
• Separations in circular security for arbitrary length key cycles
• Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff
• A note on Ring-LWE security in the case of fully homomorphic encryption
• Security estimates of a ring-LWE symmetric cryptosystem against chosen plaintext attack
• On the circular security of bit-encryption
• On the exact round complexity of secure three-party computation

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Probabilistic encryption
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• On ideal lattices and learning with errors over rings
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Trapdoors for hard lattices and new cryptographic constructions
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Circular-Secure Encryption from Decision Diffie-Hellman
• Title not available (Why is that?)
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Title not available (Why is that?)
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Black-box circular-secure encryption beyond affine functions
• Cryptographic agility and its relation to circular encryption
• Bounded key-dependent message security
• A toolkit for ring-LWE cryptography
• 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
• Efficient circuit-size independent public key encryption with KDM security
• Obfuscation \(\Rightarrow\) (IND-CPA security \(\nRightarrow\) circular security)
• New definitions and separations for circular security
• New circular security counterexamples from decision linear and learning with errors
• Circular Security Separations for Arbitrary Length Cycles from LWE

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
• On the circular security of bit-encryption
• New circular security counterexamples from decision linear and learning with errors
• Toward fine-grained blackbox separations between semantic and circular-security notions
• Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
• Lockable obfuscation from circularly insecure fully homomorphic encryption
• Circular Security Separations for Arbitrary Length Cycles from LWE
• New definitions and separations for circular security
• Cryptographic agility and its relation to circular encryption
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
• Bounded KDM security from iO and OWF

Uses Software

• ring-LWE

This page was built for publication: Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE

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