Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
From MaRDI portal
Publication:2829234
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
Cites work
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 1951605 (Why is no real title available?)
- A toolkit for ring-LWE cryptography
- Black-box circular-secure encryption beyond affine functions
- Bounded key-dependent message security
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Circular and KDM security for identity-based encryption
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular-Secure Encryption from Decision Diffie-Hellman
- Classical hardness of learning with errors
- Cryptographic agility and its relation to circular encryption
- Efficient circuit-size independent public key encryption with KDM security
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fully homomorphic encryption using ideal lattices
- Key-dependent message security: generic amplification and completeness
- New circular security counterexamples from decision linear and learning with errors
- New definitions and separations for circular security
- Obfuscation \(\Rightarrow\) (IND-CPA security \(\nRightarrow\) circular security)
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Probabilistic encryption
- Public-key cryptosystems from the worst-case shortest vector problem
- Separations in circular security for arbitrary length key cycles
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
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
- Bounded KDM security from iO and OWF
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
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)
