A new Gaussian sampling for trapdoor lattices with arbitrary modulus
From MaRDI portal
Publication:2329396
Recommendations
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
- Gaussian Sampling in Lattice Based Cryptography
- An efficient and parallel Gaussian sampler for lattices
Cites work
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- scientific article; zbMATH DE number 2196508 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- A Group Signature Scheme from Lattice Assumptions
- A toolkit for ring-LWE cryptography
- Adaptively secure identity-based identification from lattices without random oracles
- An efficient and parallel Gaussian sampler for lattices
- Attribute-based encryption for circuits
- Bi-deniable public-key encryption
- Bonsai trees, or how to delegate a lattice basis
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Classical hardness of learning with errors
- Efficient lattice (H)IBE in the standard model
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Functional encryption for threshold functions (or fuzzy IBE) from lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic signatures for polynomial functions
- How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
- Identity-based (lossy) trapdoor functions and applications
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Improvement and efficient implementation of a lattice-based signature scheme
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Lattice-based group signature scheme with verifier-local revocation
- Lattice-based group signatures with logarithmic signature size
- Leveled fully homomorphic signatures from standard lattices
- Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
- Multi-identity and multi-key leveled FHE from learning with errors
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Obfuscating conjunctions under entropic ring LWE
- On lattices, learning with errors, random linear codes, and cryptography
- Predicate encryption for circuits from LWE
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- SWIFFT: A Modest Proposal for FFT Hashing
- Simpler efficient group signatures from lattices
- Stronger security for reusable garbled circuits, general definitions and attacks
- Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles
- Towards tightly secure lattice short signature and id-based encryption
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Watermarking cryptographic functionalities from standard lattice assumptions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(6)- Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices
- Towards a simpler lattice gadget toolkit
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Towards compact identity-based encryption on ideal lattices
- Gaussian Sampling in Lattice Based Cryptography
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
This page was built for publication: A new Gaussian sampling for trapdoor lattices with arbitrary modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329396)
