Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption

Recommendations

Circular Security Separations for Arbitrary Length Cycles from LWE
On the circular security of bit-encryption
Toward fine-grained blackbox separations between semantic and circular-security notions
Separations in circular security for arbitrary length key cycles
New circular security counterexamples from decision linear and learning with errors

Cites work

scientific article; zbMATH DE number 1722673 (Why is no real title available?)
A decade of lattice cryptography
Advances in Cryptology - EUROCRYPT 2004
Black-box circular-secure encryption beyond affine functions
Bounded KDM security from iO and OWF
Bounded key-dependent message security
Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
Bounds for Width Two Branching Programs
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
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
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Graph-induced multilinear maps from 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
On the circular security of bit-encryption
Pseudorandom functions and lattices
Public-key cryptosystems from the worst-case shortest vector problem
Separations in circular security for arbitrary length key cycles
Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
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

(13)

Collusion resistant traitor tracing from learning with errors
On the circular security of bit-encryption
Return of GGH15: provable security against zeroizing attacks
Universal amplification of KDM security: from 1-key circular to multi-key KDM
New circular security counterexamples from decision linear and learning with errors
On the security of the multivariate ring learning with errors problem
SoK: learning with errors, circular security, and fully homomorphic encryption
Toward fine-grained blackbox separations between semantic and circular-security notions
Counterexamples to new circular security assumptions underlying iO
Lockable obfuscation from circularly insecure fully homomorphic encryption
KDM security for identity-based encryption: constructions and separations
Improved attacks against key reuse in learning with errors key exchange
Circular security is complete for KDM security

This page was built for publication: Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption

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