Building an efficient lattice gadget toolkit: Subgaussian sampling and more

DOI10.1007/978-3-030-17656-3_23MaRDI QIDQ2292888zbMATH OpenOpenAlexFDO

Authors Nicholas Genise, Daniele Micciancio, Yuriy Polyakov

Publication date 6 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17656-3_23

zbMATH Keywords

gadget inversion problemslattice cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• An efficient and parallel Gaussian sampler for lattices
• Faster Gaussian lattice sampling using lazy floating-point arithmetic
• Exact lattice sampling from non-Gaussian distributions
• Lattice-Reduction-Aided Gibbs Algorithm for Lattice Gaussian Sampling: Convergence Enhancement and Decoding Optimization
• Optimal Lattices for Sampling
• Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
• Gaussian sampling of lattices for cryptographic applications
• Lattice invariant subspaces and sampling
• Algorithmic Number Theory
• Gaussian Sampling in Lattice Based Cryptography

Cited in

(18)

• Exact lattice sampling from non-Gaussian distributions
• Rounding in the rings
• Towards a simpler lattice gadget toolkit
• Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
• FINAL: faster FHE instantiated with NTRU and LWE
• Compact lattice gadget and its applications to hash-and-sign signatures
• Error correction and ciphertext quantization in lattice cryptography
• Shorter and faster identity-based signatures with tight security in the (Q)ROM from lattices
• Practical randomized lattice gadget decomposition with application to FHE
• SoK: learning with errors, circular security, and fully homomorphic encryption
• Hintless single-server private information retrieval
• Resolving the efficiency-utility dilemma of threshold linearly homomorphic encryption via message-space adapter
• Optimal sub-Gaussian variance proxy for truncated Gaussian and exponential random variables
• Fully homomorphic encryption for cyclotomic prime moduli
• Full domain functional bootstrapping using the prime cyclotomic ring
• Revisiting the robustness of (R/M)LWR under polynomial moduli with its applications
• Circuit privacy for FHEW/TFHE-style fully homomorphic encryption in practice
• HRA-secure homomorphic lattice-based proxy re-encryption with tight security

Describes a project that uses

Uses Software

• NFLlib
• PALISADE

This page was built for publication: Building an efficient lattice gadget toolkit: Subgaussian sampling and more

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