Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model). - David Bernhard; Ngoc Khanh Nguyen 001; Bogdan Warinschi (ACNS, 2017)

On Tightly Secure Primitives in the Multi-Instance Setting. - Dennis Hofheinz; Ngoc Khanh Nguyen 001 (IACR Cryptol. ePrint Arch., 2018)

On the Non-Existence of Short Vectors in Random Module Lattices. - Ngoc Khanh Nguyen 001 (IACR Cryptol. ePrint Arch., 2019)

A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. - Jonathan Bootle; Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2020)

More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. - Jonathan Bootle; Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2020)

Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings. - Muhammed F. Esgin; Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2020)

Lattice-Based Blind Signatures, Revisited. - Eduard Hauck; Eike Kiltz; Julian Loss; Ngoc Khanh Nguyen 001 (IACR Cryptol. ePrint Arch., 2020)

Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2020)

Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2020)

Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Maxime Plançon; Gregor Seiler (IACR Cryptol. ePrint Arch., 2021)

SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2021)

Lifting Standard Model Reductions to Common Setup Assumptions. - Ngoc Khanh Nguyen 001; Eftychios Theodorakis; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2021)

Practical Sublinear Proofs for R1CS from Lattices. - Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2022)

BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001 (IACR Cryptol. ePrint Arch., 2022)

Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Maxime Plançon (IACR Cryptol. ePrint Arch., 2022)

Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Maxime Plançon (IACR Cryptol. ePrint Arch., 2022)

Lattice-Based Zero-Knowledge Proofs Under a Few Dozen Kilobytes. - Ngoc Khanh Nguyen 001 (2022)

SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions. - Martin R. Albrecht; Giacomo Fenzi; Oleksandra Lapiha; Ngoc Khanh Nguyen 001 (IACR Cryptol. ePrint Arch., 2023)

Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal. - Ward Beullens; Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2023)

A Framework for Practical Anonymous Credentials from Lattices. - Jonathan Bootle; Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Alessandro Sorniotti (IACR Cryptol. ePrint Arch., 2023)

Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency. - Giacomo Fenzi; Ngoc Khanh Nguyen 001 (IACR Cryptol. ePrint Arch., 2023)

RoK, Paper, SISsors Toolkit for Lattice-Based Succinct Arguments - (Extended Abstract). - Michael Klooß; Russell W. F. Lai; Ngoc Khanh Nguyen 001; Michal Osadnik (ASIACRYPT (5), 2024)

Polynomial Commitments from Lattices: Post-Quantum Security, Fast Verification and Transparent Setup. - Valerio Cini; Giulio Malavolta; Ngoc Khanh Nguyen 001; Hoeteck Wee (IACR Cryptol. ePrint Arch., 2024)

K-Waay: Fast and Deniable Post-Quantum X3DH without Ring Signatures. - Daniel Collins 001; Loïs Huguenin-Dumittan; Ngoc Khanh Nguyen 001; Nicolas Rolin; Serge Vaudenay (IACR Cryptol. ePrint Arch., 2024)

Lova: Lattice-Based Folding Scheme from Unstructured Lattices. - Giacomo Fenzi; Christian Knabenhans; Ngoc Khanh Nguyen 001; Duc Tu Pham (IACR Cryptol. ePrint Arch., 2024)

RoK, Paper, SISsors - Toolkit for Lattice-based Succinct Arguments. - Michael Klooß; Russell W. F. Lai; Ngoc Khanh Nguyen 001; Michal Osadnik (IACR Cryptol. ePrint Arch., 2024)

Greyhound: Fast Polynomial Commitments from Lattices. - Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2024)

Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency. - Giacomo Fenzi; Hossein Moghaddas; Ngoc Khanh Nguyen 001 (J. Cryptol., 2024)

More Efficient Lattice-Based Zero-Knowledge Proofs with Straight-Line Extractability. - Ngoc Khanh Nguyen 001; George O'Rourke (APKC@AsiaCCS, 2025)

Lattice-Based Accumulator and Application to Anonymous Credential Revocation. - Victor Youdom Kemmoe; Anna Lysyanskaya; Ngoc Khanh Nguyen 001 (IACR Cryptol. ePrint Arch., 2025)

RoK and Roll - Verifier-Efficient Random Projection for Õ(λ)-size Lattice Arguments. - Michael Klooß; Russell W. F. Lai; Ngoc Khanh Nguyen 001; Michal Osadnik (IACR Cryptol. ePrint Arch., 2025)