Circular Security Separations for Arbitrary Length Cycles from LWE
From MaRDI portal
Publication:2829235
Recommendations
- Separations in circular security for arbitrary length key cycles
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
- Circular-Secure Encryption from Decision Diffie-Hellman
- On the circular security of bit-encryption
- On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes
- Circular chosen-ciphertext security with compact ciphertexts
- Reproducible circularly secure bit encryption: applications and realizations
- Reproducible circularly-secure bit encryption: applications and realizations
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?)
- Black-box circular-secure encryption beyond affine functions
- Bounded key-dependent message security
- Candidate Multilinear Maps from Ideal Lattices
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- 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
- Cryptanalysis of the multilinear map over the integers
- Cryptographic agility and its relation to circular encryption
- 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 lattices, learning with errors, random linear codes, and cryptography
- 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
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
Cited in
(15)- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular-Secure Encryption from Decision Diffie-Hellman
- KDM security for identity-based encryption: constructions and separations
- Universal amplification of KDM security: from 1-key circular to multi-key KDM
- New circular security counterexamples from decision linear and learning with errors
- Toward fine-grained blackbox separations between semantic and circular-security notions
- Counterexamples to new circular security assumptions underlying iO
- Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
- Lockable obfuscation from circularly insecure fully homomorphic encryption
- Obfuscation \(\Rightarrow\) (IND-CPA security \(\nRightarrow\) circular security)
- SoK: learning with errors, circular security, and fully homomorphic encryption
- Separations in circular security for arbitrary length key cycles
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
- Bounded KDM security from iO and OWF
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
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)
