Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Faster Gaussian sampling for trapdoor lattices with arbitrary modulus	scientific article

Statements

scholarly article

0 references

Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (English)

0 references

Nicholas Genise

0 references

Daniele Micciancio

0 references

publication date

9 July 2018

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-78381-9_7

0 references

Stronger security for reusable garbled circuits, general definitions and attacks

0 references

Efficient Lattice (H)IBE in the Standard Model

0 references

Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE

0 references

Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices

0 references

0 references

Circular and KDM Security for Identity-Based Encryption

0 references

Generating shorter bases for hard random lattices

0 references

Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance

0 references

Improvement and Efficient Implementation of a Lattice-Based Signature Scheme

0 references

Identity-Based (Lossy) Trapdoor Functions and Applications

0 references

How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE

0 references

Homomorphic Signatures for Polynomial Functions

0 references

Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures

0 references

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

0 references

Attribute-Based Functional Encryption on Lattices

0 references

Attribute-Based Encryption for Finite Automata from LWE

0 references

Towards Tightly Secure Lattice Short Signature and Id-Based Encryption

0 references

Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security

0 references

Obfuscating Conjunctions under Entropic Ring LWE

0 references

Fully Anonymous Attribute Tokens from Lattices

0 references

Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE

0 references

Bonsai trees, or how to delegate a lattice basis

0 references

Multi-identity and Multi-key Leveled FHE from Learning with Errors

0 references

Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic

0 references

Fast Fourier Orthogonalization

0 references

Public key cryptography -- PKC 2012. 15th international conference on practice and theory in public key cryptography, Darmstadt, Germany, May 21--23, 2012. Proceedings

0 references

Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part I

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

0 references

Attribute-based encryption for circuits

0 references

Predicate Encryption for Circuits from LWE

0 references

Leveled Fully Homomorphic Signatures from Standard Lattices

0 references

A Group Signature Scheme from Lattice Assumptions

0 references

Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices

0 references

Sampling Exactly from the Normal Distribution

0 references

Watermarking cryptographic functionalities from standard lattice assumptions

0 references

0 references

Lattice-Based Group Signatures with Logarithmic Signature Size

0 references

Lattice-Based Group Signature Scheme with Verifier-Local Revocation

0 references

Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications

0 references

SWIFFT: A Modest Proposal for FFT Hashing

0 references

On Ideal Lattices and Learning with Errors over Rings

0 references

A Toolkit for Ring-LWE Cryptography

0 references

Generalized compact knapsacks, cyclic lattices, and efficient one-way functions

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

0 references

Gaussian sampling over the integers: efficient, generic, constant-time

0 references

Simpler Efficient Group Signatures from Lattices

0 references

An Efficient and Parallel Gaussian Sampler for Lattices

0 references

A Decade of Lattice Cryptography

0 references

A Framework for Efficient and Composable Oblivious Transfer

0 references

Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings

0 references

Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15--19, 2010. Proceedings

0 references

Public Key Encryption against Related Key Attacks

0 references

Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-78381-9_7

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1648788

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1648788&oldid=38019143"