MPSign: a signature from small-secret middle-product learning with errors
From MaRDI portal
Publication:2055685
DOI10.1007/978-3-030-45388-6_3zbMath1481.94132OpenAlexW3023561148MaRDI QIDQ2055685
Dipayan Das, Shi Bai, Ron Steinfeld, Zhenfei Zhang, Ryo Hiromasa, Amin Sakzad, Miruna Rosca, Damien Stehlé
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45388-6_3
Related Items (1)
Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\)
- Digital signatures from the middle-product LWE
- On the ring-LWE and polynomial-LWE problems
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
- Middle-product Learning with Errors
- Lattice trapdoors and IBE from middle-product LWE
- Middle-product learning with rounding problem and its applications
- On the complexity of the BKW algorithm on LWE
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
- Worst-case to average-case reductions for module lattices
- Lattice Signatures and Bimodal Gaussians
- Hardness of k-LWE and Applications in Traitor Tracing
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- On the Security of the Winternitz One-Time Signature Scheme
- New Algorithms for Learning in Presence of Errors
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Generalized Compact Knapsacks Are Collision Resistant
- Digital Signatures
- Efficient Public Key Encryption Based on Ideal Lattices
- Pseudorandomness of ring-LWE for any ring and modulus
- On Ideal Lattices and Learning with Errors over Rings
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Theory of Cryptography
This page was built for publication: MPSign: a signature from small-secret middle-product learning with errors
