Hardness of LWE on general entropic distributions
From MaRDI portal
Publication:2119024
DOI10.1007/978-3-030-45724-2_19zbMath1492.94068OpenAlexW3013760718MaRDI QIDQ2119024
Zvika Brakerski, Nico Döttling
Publication date: 23 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-45724-2_19
Related Items
On the hardness of module-LWE with binary secret ⋮ On the hardness of module learning with errors with short distributions ⋮ Efficient laconic cryptography from learning with errors ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Entropic hardness of Module-LWE from module-NTRU ⋮ Almost tight multi-user security under adaptive corruptions from LWE in the standard model ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Strong converse of the coding theorem for semicontinuous channels
- Lossiness and entropic hardness for ring-LWE
- Order-LWE and the hardness of ring-LWE with entropic secrets
- On the Hardness of Learning with Rounding over Small Modulus
- (Leveled) fully homomorphic encryption without bootstrapping
- Learning with Rounding, Revisited
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- Barriers in cryptography with weak, correlated and leaky sources
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- An Efficient and Parallel Gaussian Sampler for Lattices
- On the (Im)Possibility of Key Dependent Encryption
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Lossy Codes and a New Variant of the Learning-With-Errors Problem
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Advances in Cryptology - CRYPTO 2003
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Attribute-based encryption for circuits
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
