A new Gaussian sampling for trapdoor lattices with arbitrary modulus
From MaRDI portal
Publication:2329396
DOI10.1007/S10623-019-00635-8zbMATH Open1423.94076OpenAlexW2943459438WikidataQ127954242 ScholiaQ127954242MaRDI QIDQ2329396FDOQ2329396
Authors: Huiwen Jia, Yupu Hu 
Publication date: 17 October 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00635-8
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
Gaussian processes (60G15) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- SWIFFT: A Modest Proposal for FFT Hashing
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient lattice (H)IBE in the standard model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Classical hardness of learning with errors
- Leveled fully homomorphic signatures from standard lattices
- Homomorphic signatures for polynomial functions
- Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
- Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles
- A Framework for Efficient and Composable Oblivious Transfer
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
- Lattice-based group signatures with logarithmic signature size
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Simpler efficient group signatures from lattices
- A Group Signature Scheme from Lattice Assumptions
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Lattice-based group signature scheme with verifier-local revocation
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Bonsai trees, or how to delegate a lattice basis
- An efficient and parallel Gaussian sampler for lattices
- A toolkit for ring-LWE cryptography
- Identity-based (lossy) trapdoor functions and applications
- Towards tightly secure lattice short signature and id-based encryption
- Obfuscating conjunctions under entropic ring LWE
- Functional encryption for threshold functions (or fuzzy IBE) from lattices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stronger security for reusable garbled circuits, general definitions and attacks
- How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
- Multi-identity and multi-key leveled FHE from learning with errors
- Adaptively secure identity-based identification from lattices without random oracles
- Watermarking cryptographic functionalities from standard lattice assumptions
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Improvement and efficient implementation of a lattice-based signature scheme
- Predicate encryption for circuits from LWE
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Bi-deniable public-key encryption
- Attribute-based encryption for circuits
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
Uses Software
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)
