Fiat-Shamir signatures based on module-NTRU

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Generating shorter bases for hard random lattices
A hierarchy of polynomial time lattice basis reduction algorithms
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
Revisiting TESLA in the quantum random oracle model
Homomorphic encryption for finite automata
Approximate trapdoors for lattices and smaller hash-and-sign signatures
The lattice-based digital signature scheme qTESLA
A Decade of Lattice Cryptography
A Subfield Lattice Attack on Overstretched NTRU Assumptions
Lattice Signatures and Bimodal Gaussians
Tightly-Secure Signatures from Lossy Identification Schemes
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Lattice Signatures without Trapdoors
Efficient Identity-Based Encryption over NTRU Lattices
Trapdoors for hard lattices and new cryptographic constructions
On Ideal Lattices and Learning with Errors over Rings
Generalized Compact Knapsacks Are Collision Resistant
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Efficient Public Key Encryption Based on Ideal Lattices
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
An Improved Compression Technique for Signatures Based on Learning with Errors
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Classical hardness of learning with errors
Revisiting Lattice Attacks on Overstretched NTRU Parameters
Lattice-Based Cryptography
On lattices, learning with errors, random linear codes, and cryptography
On the hardness of the NTRU problem

This page was built for publication: Fiat-Shamir signatures based on module-NTRU