On rejection sampling in Lyubashevsky's signature scheme
DOI10.1007/978-3-031-22972-5_2zbMATH Open1519.94218OpenAlexW4312128418MaRDI QIDQ6133962FDOQ6133962
Authors: Julien Devevey, Omar Fawzi, Alain Passelègue, Damien Stehlé 
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
Recommendations
- Rejection sampling revisit: how to choose parameters in lattice-based signature
- On removing rejection conditions in practical lattice-based signatures
- From identification using rejection sampling to signatures via the Fiat-Shamir transform: application to the BLISS signature
- Reassessing security of randomizable signatures
- Theory of Cryptography
- Rerandomizable signatures under standard assumption
- A randomized analog of Chaum - van Antwerpen undeniable signature
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- Signatures on randomizable ciphertexts
- A code-based signature scheme from the Lyubashevsky framework
Cryptography (94A60) Sampling theory in information and communication theory (94A20) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Efficient signature generation by smart cards
- Multiparty Computation from Somewhat Homomorphic Encryption
- Lattice signatures without trapdoors
- Min- and Max-Relative Entropies and a New Entanglement Monotone
- SECURITY OF QUANTUM KEY DISTRIBUTION
- An improved compression technique for signatures based on learning with errors
- Lattice signatures and bimodal Gaussians
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Tightly-secure signatures from lossy identification schemes
- The Communication Complexity of Correlation
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Shorter hash-and-sign lattice-based signatures
- 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
- Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware
Cited In (9)
- Rejection sampling revisit: how to choose parameters in lattice-based signature
- Analysis of error terms of signatures based on learning with errors
- Finding short integer solutions when the modulus is small
- On removing rejection conditions in practical lattice-based signatures
- G+G: a Fiat-Shamir lattice signature based on convolved Gaussians
- A detailed analysis of Fiat-Shamir with aborts
- From identification using rejection sampling to signatures via the Fiat-Shamir transform: application to the BLISS signature
- Polytopes in the Fiat-Shamir with aborts paradigm
- Raccoon: a masking-friendly signature proven in the probing model
This page was built for publication: On rejection sampling in Lyubashevsky's signature scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133962)
