A systematic study of sparse LWE
From MaRDI portal
Publication:6652897
Recommendations
Cites work
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A hierarchy of polynomial time lattice basis reduction algorithms
- Algebraic attacks against random local functions and their countermeasures
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Attribute-based encryption for circuits
- Block Reduced Lattice Bases and Successive Minima
- Candidate one-way functions based on expander graphs
- Classical hardness of learning with errors
- Collusion resistant traitor tracing from learning with errors
- Cryptography with constant computational overhead
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Factoring polynomials with rational coefficients
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fully homomorphic SIMD operations
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Hardness of SIS and LWE with small parameters
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Indistinguishability obfuscation from well-founded assumptions
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Middle-product Learning with Errors
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- New Algorithms for Learning in Presence of Errors
- New bounds in some transference theorems in the geometry of numbers
- Noise-tolerant learning, the parity problem, and the statistical query model
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- On Pseudorandom Generators with Linear Stretch in NC0
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the complexity of the BKW algorithm on LWE
- On the concrete hardness of learning with errors
- On the hardness of learning with errors with binary secrets
- Pseudorandom functions and lattices
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Public-key cryptography from different assumptions
- Public-key cryptosystems from the worst-case shortest vector problem
- Quantum FHE (almost) as secure as classical
- Relations between average case complexity and approximation complexity
- Secure arithmetic computation with constant computational overhead
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Solving the shortest vector problem in \(2^n\) time using discrete Gaussian sampling (extended abstract)
- Sum of squares lower bounds for refuting any CSP
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
This page was built for publication: A systematic study of sparse LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652897)
