Towards a Simpler Lattice Gadget Toolkit
From MaRDI portal
Publication:5087269
DOI10.1007/978-3-030-97121-2_18zbMath1492.94176OpenAlexW4214517292MaRDI QIDQ5087269
Publication date: 8 July 2022
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_18
Related Items
Uses Software
Cites Work
- On Lovász' lattice reduction and the nearest lattice point problem
- Practical implementation of Ring-SIS/LWE based signature and IBE
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Large FHE gates from tensored homomorphic accumulator
- Gaussian sampling over the integers: efficient, generic, constant-time
- Eigenvalues of tridiagonal pseudo-Toeplitz matrices
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Implementation of lattice trapdoors on modules and applications
- Integral matrix Gram root and lattice Gaussian sampling without floats
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- TFHE: fast fully homomorphic encryption over the torus
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Lattice-Based Group Signatures with Logarithmic Signature Size
- Faster Bootstrapping with Polynomial Error
- Identity-Based (Lossy) Trapdoor Functions and Applications
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices
- Efficient Identity-Based Encryption over NTRU Lattices
- Fast Fourier Orthogonalization
- A Group Signature Scheme from Lattice Assumptions
- Functional Encryption for Inner Product Predicates from Learning with Errors
- Predicate Encryption for Circuits from LWE
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- An Efficient and Parallel Gaussian Sampler for Lattices
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography
- Fully homomorphic encryption using ideal lattices
- Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Attribute-based encryption for circuits
- Classical hardness of learning with errors
