How to sample a discrete Gaussian (and more) from a random oracle
From MaRDI portal
Publication:6169425
DOI10.1007/978-3-031-22365-5_23zbMath1519.94167OpenAlexW4312306572MaRDI QIDQ6169425
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22365-5_23
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Gaussian sampling over the integers: efficient, generic, constant-time
- Optimal broadcast encryption from LWE and pairings in the standard model
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- Sampling Exactly from the Normal Distribution
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- Discrete Ziggurat: A Time-Memory Trade-Off for Sampling from a Gaussian Distribution over the Integers
- How to Generate and Use Universal Samplers
- Careful with Composition: Limitations of the Indifferentiability Framework
- Decentralizing Attribute-Based Encryption
- Targeted Homomorphic Attribute-Based Encryption
- How to Hash into Elliptic Curves
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Constant-Time Discrete Gaussian Sampling
- Isochronous Gaussian Sampling: From Inception to Implementation
- COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
- Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography
- FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
- Enhanced Lattice-Based Signatures on Reconfigurable Hardware
- Classical hardness of learning with errors
- Theory of Cryptography
- How to sample a discrete Gaussian (and more) from a random oracle
