| Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. | 0 | 0.34 | 2022 |
| BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications. | 0 | 0.34 | 2022 |
| Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. | 0 | 0.34 | 2022 |
| More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE | 0 | 0.34 | 2021 |
| Smile: Set Membership From Ideal Lattices With Applications To Ring Signatures And Confidential Transactions | 0 | 0.34 | 2021 |
| Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing | 0 | 0.34 | 2021 |
| Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations. | 0 | 0.34 | 2021 |
| Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing. | 0 | 0.34 | 2021 |
| A Thorough Treatment of Highly-Efficient NTRU Instantiations. | 0 | 0.34 | 2021 |
| Non-applicability of the Gaborit&Aguilar-Melchor patent to Kyber and Saber. | 0 | 0.34 | 2021 |
| Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions. | 0 | 0.34 | 2020 |
| A Framework for Efficient Lattice-Based DAA | 0 | 0.34 | 2019 |
| Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts. | 0 | 0.34 | 2019 |
| Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. | 1 | 0.34 | 2019 |
| NTTRU: Truly Fast NTRU Using NTT. | 0 | 0.34 | 2019 |
| CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM | 22 | 1.08 | 2018 |
| CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme. | 4 | 0.42 | 2018 |
| Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. | 2 | 0.36 | 2018 |
| A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model. | 11 | 0.55 | 2018 |
| Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. | 0 | 0.34 | 2018 |
| More Efficient Commitments from Structured Lattice Assumptions. | 1 | 0.36 | 2018 |
| Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs. | 4 | 0.41 | 2018 |
| Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability. | 3 | 0.36 | 2018 |
| Amortization with Fewer Equations for Proving Knowledge of Small Secrets. | 6 | 0.44 | 2017 |
| Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings. | 2 | 0.37 | 2017 |
| CRYSTALS - Dilithium: Digital Signatures from Module Lattices. | 10 | 0.61 | 2017 |
| One-Shot Verifiable Encryption from Lattices. | 9 | 0.50 | 2017 |
| Practical Quantum-Safe Voting from Lattices. | 3 | 0.39 | 2017 |
| Partially Splitting Rings for Faster Lattice-Based Zero-Knowledge Proofs. | 0 | 0.34 | 2017 |
| Digital Signatures Based on the Hardness of Ideal Lattice Problems in all Rings. | 8 | 0.61 | 2016 |
| The Whole is Less than the Sum of its Parts: Constructing More Efficient Lattice-Based AKEs. | 3 | 0.40 | 2016 |
| Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware | 10 | 0.58 | 2015 |
| Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings. | 11 | 0.50 | 2015 |
| Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices. | 7 | 0.77 | 2015 |
| Efficient Identity-Based Encryption over NTRU Lattices. | 41 | 1.21 | 2014 |
| E fficient Identity-Based Encryption over NTRU Lattices. | 0 | 0.34 | 2014 |
| Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures. | 21 | 0.70 | 2014 |
| Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs. | 16 | 0.67 | 2013 |
| A Toolkit for Ring-LWE Cryptography. | 94 | 2.89 | 2013 |
| Lattice Signatures and Bimodal Gaussians. | 48 | 1.66 | 2013 |
| Asymptotically Effi cient Lattice-Based Digital Signatures. | 0 | 0.34 | 2013 |
| Lapin: an efficient authentication protocol based on Ring-LPN | 8 | 0.50 | 2012 |
| Lattice signatures without trapdoors | 79 | 2.89 | 2012 |
| From selective to full security: semi-generic transformations in the standard model | 2 | 0.39 | 2012 |
| Practical lattice-based cryptography: a signature scheme for embedded systems | 77 | 2.27 | 2012 |
| Tightly-Secure signatures from lossy identification schemes | 8 | 0.47 | 2012 |
| On Ideal Lattices and Learning with Errors over Rings | 250 | 9.79 | 2012 |
| Search To Decision Reduction For The Learning With Errors Over Rings Problem | 1 | 0.42 | 2011 |
| Public-key cryptographic primitives provably as secure as subset sum | 29 | 1.25 | 2010 |
| A Note on the Distribution of the Distance from a Lattice | 3 | 0.41 | 2009 |
