Compact lattice gadget and its applications to hash-and-sign signatures
From MaRDI portal
Publication:6190144
DOI10.1007/978-3-031-38554-4_13arXiv2305.12481OpenAlexW4385654443MaRDI QIDQ6190144
Yang Yu, Xiaoyun Wang, Huiwen Jia
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2305.12481
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Lovász' lattice reduction and the nearest lattice point problem
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Stronger security for reusable garbled circuits, general definitions and attacks
- Integral matrix Gram root and lattice Gaussian sampling without floats
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Homomorphic encryption for finite automata
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Obfuscating Conjunctions under Entropic Ring LWE
- Lattice Signatures and Bimodal Gaussians
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Efficient Identity-Based Encryption over NTRU Lattices
- Choosing Parameters for NTRUEncrypt
- Fast Fourier Orthogonalization
- A Group Signature Scheme from Lattice Assumptions
- Predicate Encryption for Circuits from LWE
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- An Efficient and Parallel Gaussian Sampler for Lattices
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography
- Towards a Simpler Lattice Gadget Toolkit
- Fully homomorphic encryption using ideal lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Attribute-based encryption for circuits
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Learning strikes again: the case of the DRS signature scheme
- NTRU Fatigue: How Stretched is Overstretched?
- Shorter hash-and-sign lattice-based signatures
This page was built for publication: Compact lattice gadget and its applications to hash-and-sign signatures
