SMILE: Set Membership from Ideal Lattices with Applications to Ring...
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler: SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. CRYPTO (2) 2021: 611-640
View ArticleShorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other...
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon, Gregor Seiler: Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations. ASIACRYPT (4) 2021: 218-248
View ArticleBLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications.
Vadim Lyubashevsky, Ngoc Khanh Nguyen: BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications. IACR Cryptol. ePrint Arch. 2022: 1307 (2022)
View ArticlePractical Sublinear Proofs for R1CS from Lattices.
Ngoc Khanh Nguyen, Gregor Seiler: Practical Sublinear Proofs for R1CS from Lattices. IACR Cryptol. ePrint Arch. 2022: 1048 (2022)
View ArticleLattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and...
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon: Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. IACR Cryptol. ePrint Arch. 2022: 284 (2022)
View ArticleEfficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures.
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon: Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. IACR Cryptol. ePrint Arch. 2022: 6 (2022)
View ArticleEfficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures.
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon: Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. Public Key Cryptography (2) 2022: 498-527
View ArticleLifting Standard Model Reductions to Common Setup Assumptions.
Ngoc Khanh Nguyen, Eftychios Theodorakis, Bogdan Warinschi: Lifting Standard Model Reductions to Common Setup Assumptions. Public Key Cryptography (2) 2022: 130-160
View ArticlePractical Sublinear Proofs for R1CS from Lattices.
Ngoc Khanh Nguyen, Gregor Seiler: Practical Sublinear Proofs for R1CS from Lattices. CRYPTO (2) 2022: 133-162
View ArticleClik here to view.
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and...
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon: Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. CRYPTO (2) 2022: 71-101
View ArticleClik here to view.
BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications.
Vadim Lyubashevsky, Ngoc Khanh Nguyen: BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications. ASIACRYPT (4) 2022: 95-125
View ArticleLattice-Based Zero-Knowledge Proofs Under a Few Dozen Kilobytes.
Ngoc Khanh Nguyen: Lattice-Based Zero-Knowledge Proofs Under a Few Dozen Kilobytes. ETH Zurich, Zürich, Switzerland, 2022
View ArticleSLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions.
Martin R. Albrecht, Giacomo Fenzi, Oleksandra Lapiha, Ngoc Khanh Nguyen: SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions. IACR Cryptol. ePrint Arch. 2023: 1469 (2023)
View ArticleLattice-Based Polynomial Commitments: Towards Asymptotic and Concrete...
Giacomo Fenzi, Ngoc Khanh Nguyen: Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency. IACR Cryptol. ePrint Arch. 2023: 846 (2023)
View ArticleA Framework for Practical Anonymous Credentials from Lattices.
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti: A Framework for Practical Anonymous Credentials from Lattices. IACR Cryptol. ePrint Arch. 2023: 560 (2023)
View ArticleLattice-Based Blind Signatures: Short, Efficient, and Round-Optimal.
Ward Beullens, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler: Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal. IACR Cryptol. ePrint Arch. 2023: 77 (2023)
View ArticleA Framework for Practical Anonymous Credentials from Lattices.
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti: A Framework for Practical Anonymous Credentials from Lattices. CRYPTO (2) 2023: 384-417
View ArticleClik here to view.
Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal.
Ward Beullens, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler: Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal. CCS 2023: 16-29
View ArticleSLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions.
Martin R. Albrecht, Giacomo Fenzi, Oleksandra Lapiha, Ngoc Khanh Nguyen: SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions. EUROCRYPT (6) 2024: 90-119
View ArticleGreyhound: Fast Polynomial Commitments from Lattices.
Ngoc Khanh Nguyen, Gregor Seiler: Greyhound: Fast Polynomial Commitments from Lattices. IACR Cryptol. ePrint Arch. 2024: 1293 (2024)
View Article