A Gaussian leftover hash lemma for modules over number fields
From MaRDI portal
Cites work
- A note on discrete Gaussian combinations of lattice vectors
- Adaptive estimation of a quadratic functional by model selection.
- Discrete Gaussian leftover hash lemma over infinite domains
- Discrete Gaussians modulo sub-lattices: new leftover hash lemmas for discrete Gaussians
- FHE circuit privacy almost for free
- GGHLite: more efficient multilinear maps from ideal lattices
- Hardness of \(k\)-LWE and applications in traitor tracing
- Hardness of SIS and LWE with small parameters
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
- Making NTRU as secure as worst-case problems over ideal lattices
- New bounds in some transference theorems in the geometry of numbers
- On module unique-SVP and NTRU
- On the hardness of the NTRU problem
- On the smoothing parameter and last minimum of random orthogonal lattices
- Partial lattice trapdoors: how to split lattice trapdoors, literally
- Recovering short generators of principal ideals in cyclotomic rings
- Surjectivity of near-square random matrices
- The smallest eigenvalue of a large dimensional Wishart matrix
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
This page was built for publication: A Gaussian leftover hash lemma for modules over number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304107)
