On removing rejection conditions in practical lattice-based signatures
From MaRDI portal
Publication:2118558
DOI10.1007/978-3-030-81293-5_20zbMath1485.94129OpenAlexW3181972566MaRDI QIDQ2118558
Rouzbeh Behnia, Yilei Chen, Daniel Masny
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81293-5_20
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
- Complete attack on RLWE key exchange with reused keys, without signal leakage
- Estimate all the {LWE, NTRU} schemes!
- The lattice-based digital signature scheme qTESLA
- Masking Dilithium. Efficient implementation and side-channel evaluation
- Post-quantum security of Fiat-Shamir
- Lattice Signatures and Bimodal Gaussians
- Lattice Signatures without Trapdoors
- Lattice Cryptography for the Internet
- Trapdoors for hard lattices and new cryptographic constructions
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange
- An Improved Compression Technique for Signatures Based on Learning with Errors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: On removing rejection conditions in practical lattice-based signatures
