Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
From MaRDI portal
Recommendations
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- An efficient and parallel Gaussian sampler for lattices
- Gaussian sampling of lattices for cryptographic applications
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
Cites work
- scientific article; zbMATH DE number 1405637 (Why is no real title available?)
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- A Group Signature Scheme from Lattice Assumptions
- A decade of lattice cryptography
- A toolkit for ring-LWE cryptography
- Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15--19, 2010. Proceedings
- Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part I
- Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings
- An efficient and parallel Gaussian sampler for lattices
- Attribute-based encryption for circuits
- Attribute-based encryption for finite automata from LWE
- Attribute-based functional encryption on lattices
- Bonsai trees, or how to delegate a lattice basis
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Circular and KDM security for identity-based encryption
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Efficient lattice (H)IBE in the standard model
- Fast Fourier orthogonalization
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- Fully Anonymous Attribute Tokens from Lattices
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Functional encryption for threshold functions (or fuzzy IBE) from lattices
- Gaussian sampling over the integers: efficient, generic, constant-time
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Generating shorter bases for hard random 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 security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- 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 DAPS and Generalizations: Self-enforcement in Signature Schemes
- 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
- Obfuscating conjunctions under entropic ring LWE
- On ideal lattices and learning with errors over rings
- Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices
- Predicate encryption for circuits from LWE
- Public Key Encryption against Related Key Attacks
- Public key cryptography -- PKC 2012. 15th international conference on practice and theory in public key cryptography, Darmstadt, Germany, May 21--23, 2012. Proceedings
- SWIFFT: A Modest Proposal for FFT Hashing
- Sampling exactly from the normal distribution
- Simpler efficient group signatures from lattices
- Stronger security for reusable garbled circuits, general definitions and attacks
- 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
(32)- Rounding in the rings
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Implementation of lattice trapdoors on modules and applications
- Scalable CCA-secure public-key authenticated encryption with keyword search from ideal lattices in cloud computing
- Isochronous Gaussian sampling: from inception to implementation
- Practical randomized lattice gadget decomposition with application to FHE
- Chainable functional commitments for unbounded-depth circuits
- Gadget-based iNTRU lattice trapdoors
- Lattice-based public-key encryption with equality test supporting flexible authorization in standard model
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Identity-based encryption from lattices using approximate trapdoors
- Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- Batch signatures, revisited
- SoK: learning with errors, circular security, and fully homomorphic encryption
- Towards compact identity-based encryption on ideal lattices
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model
- Towards a simpler lattice gadget toolkit
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
- How to sample a discrete Gaussian (and more) from a random oracle
- Wildcarded identity-based encryption from lattices
- Integral matrix Gram root and lattice Gaussian sampling without floats
- Spherical Gaussian leftover hash lemma via the Rényi divergence
- Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
- Compact lattice gadget and its applications to hash-and-sign signatures
- Gaussian Sampling in Lattice Based Cryptography
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
This page was built for publication: Faster 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 Q1648788)
