Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
From MaRDI portal
Publication:2953777
DOI10.1007/978-3-662-53890-6_7zbMath1407.94141OpenAlexW2555933408MaRDI QIDQ2953777
Publication date: 6 January 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_7
Related Items (11)
On the ring-LWE and polynomial-LWE problems ⋮ Duplication free public keys based on SIS-type problems ⋮ Algebraically structured LWE. Revisited ⋮ Lattice trapdoors and IBE from middle-product LWE ⋮ Asymptotically efficient lattice-based digital signatures ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ On rejection sampling in Lyubashevsky's signature scheme ⋮ A detailed analysis of Fiat-Shamir with aborts ⋮ NTRU prime: reducing attack surface at low cost ⋮ MPSign: a signature from small-secret middle-product learning with errors ⋮ Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Lattice Signatures and Bimodal Gaussians
- Lattice Signatures without Trapdoors
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Generalized Compact Knapsacks Are Collision Resistant
- Lattice-based Cryptography
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Efficient Public Key Encryption Based on Ideal Lattices
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- On Ideal Lattices and Learning with Errors over Rings
- Predicting Lattice Reduction
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Theory of Cryptography
This page was built for publication: Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
