Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
type: Item
instance of: scholarly article
title: Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
zbMATH Open document ID: 1423.94073
DOI: 10.1007/978-3-319-78381-9_7
author: Nicholas Genise
author: Daniele Micciancio
publication date: 2018-07-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6900677
MaRDI profile type: Publication
full work available at URL: 978-3-319-78381-9 7
OpenAlex ID: W2605284921
cites work: Stronger security for reusable garbled circuits, general definitions and attacks
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
cites work: Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices
cites work: Q4938616
cites work: Circular and KDM Security for Identity-Based Encryption
cites work: Generating shorter bases for hard random lattices
cites work: Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
cites work: Improvement and Efficient Implementation of a Lattice-Based Signature Scheme
cites work: Identity-Based (Lossy) Trapdoor Functions and Applications
cites work: How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
cites work: Homomorphic Signatures for Polynomial Functions
cites work: Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
cites work: Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
cites work: Attribute-Based Functional Encryption on Lattices
cites work: Attribute-Based Encryption for Finite Automata from LWE
cites work: Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
cites work: Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
cites work: Obfuscating conjunctions under entropic ring LWE
cites work: Fully Anonymous Attribute Tokens from Lattices
cites work: Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
cites work: Bonsai trees, or how to delegate a lattice basis
cites work: Multi-identity and Multi-key Leveled FHE from Learning with Errors
cites work: Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
cites work: Fast Fourier Orthogonalization
cites work: Public key cryptography -- PKC 2012. 15th international conference on practice and theory in public key cryptography, Darmstadt, Germany, May 21--23, 2012. Proceedings
cites work: Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part I
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
cites work: Attribute-based encryption for circuits
cites work: Predicate Encryption for Circuits from LWE
cites work: Leveled Fully Homomorphic Signatures from Standard Lattices
cites work: A Group Signature Scheme from Lattice Assumptions
cites work: Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices
cites work: Sampling exactly from the normal distribution
cites work: Watermarking cryptographic functionalities from standard lattice assumptions
cites work: Q4952720
cites work: Lattice-Based Group Signatures with Logarithmic Signature Size
cites work: Lattice-Based Group Signature Scheme with Verifier-Local Revocation
cites work: Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
cites work: SWIFFT: A Modest Proposal for FFT Hashing
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: A Toolkit for Ring-LWE Cryptography
cites work: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Gaussian sampling over the integers: efficient, generic, constant-time
cites work: Simpler Efficient Group Signatures from Lattices
cites work: An Efficient and Parallel Gaussian Sampler for Lattices
cites work: A decade of lattice cryptography
cites work: A Framework for Efficient and Composable Oblivious Transfer
cites work: Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings
cites work: Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15--19, 2010. Proceedings
cites work: Public Key Encryption against Related Key Attacks
cites work: Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
description: scientific article; zbMATH DE number 6900677