Spherical Gaussian leftover hash lemma via the Rényi divergence
From MaRDI portal
Publication:6535100
Recommendations
- Discrete Gaussian leftover hash lemma over infinite domains
- Towards a ring analogue of the leftover hash lemma
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Hardness of LWE on general entropic distributions
Cites work
- scientific article; zbMATH DE number 3173999 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 3035395 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A Pseudorandom Generator from any One-way Function
- A note on discrete Gaussian combinations of lattice vectors
- Advances in Cryptology - EUROCRYPT 2004
- An efficient and parallel Gaussian sampler for lattices
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Candidate Multilinear Maps from Ideal Lattices
- Discrete Gaussian leftover hash lemma over infinite domains
- Extremal Eigenvalues of Real Symmetric Matrices with Entries in an Interval
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Functional encryption for inner product predicates from learning with errors
- GGHLite: more efficient multilinear maps from ideal lattices
- Gaussian sampling over the integers: efficient, generic, constant-time
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Integral matrix Gram root and lattice Gaussian sampling without floats
- Matrix Analysis
- Note on best possible bounds for determinants of matrices close to the identity matrix
- On lattices, learning with errors, random linear codes, and cryptography
- On the asymptotic complexity of solving LWE
- On the hardness of learning with rounding over small modulus
- On the hardness of module learning with errors with short distributions
- On the hardness of the NTRU problem
- On the smoothing parameter and last minimum of random orthogonal lattices
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Round-optimal lattice-based threshold signatures, revisited
- Rényi Divergence and Kullback-Leibler Divergence
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- TFHE: fast fully homomorphic encryption over the torus
- 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
This page was built for publication: Spherical Gaussian leftover hash lemma via the Rényi divergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535100)
