On rejection sampling in Lyubashevsky's signature scheme
From MaRDI portal
Publication:6133962
DOI10.1007/978-3-031-22972-5_2zbMath1519.94218OpenAlexW4312128418MaRDI QIDQ6133962
Omar Fawzi, Julien Devevey, Damien Stehlé, Alain Passelègue
Publication date: 21 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22972-5_2
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Sampling theory in information and communication theory (94A20)
Related Items (2)
Finding short integer solutions when the modulus is small ⋮ A detailed analysis of Fiat-Shamir with aborts
Cites Work
- Unnamed Item
- Efficient signature generation by smart cards
- Revisiting TESLA in the quantum random oracle model
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Lattice Signatures and Bimodal Gaussians
- Tightly-Secure Signatures from Lossy Identification Schemes
- Lattice Signatures without Trapdoors
- Multiparty Computation from Somewhat Homomorphic Encryption
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Min- and Max-Relative Entropies and a New Entanglement Monotone
- The Communication Complexity of Correlation
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Shorter hash-and-sign lattice-based signatures
This page was built for publication: On rejection sampling in Lyubashevsky's signature scheme
