Ngoc Khanh Nguyen

According to our database, Ngoc Khanh Nguyen authored at least 31 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2025

RoK and Roll - Verifier-Efficient Random Projection for Õ(λ)-size Lattice Arguments.

Michael Klooß, Russell W. F. Lai, Ngoc Khanh Nguyen, Michal Osadnik

IACR Cryptol. ePrint Arch., 2025

Lattice-Based Accumulator and Application to Anonymous Credential Revocation.

Victor Youdom Kemmoe, Anna Lysyanskaya, Ngoc Khanh Nguyen

IACR Cryptol. ePrint Arch., 2025

More Efficient Lattice-Based Zero-Knowledge Proofs with Straight-Line Extractability.

Ngoc Khanh Nguyen, George O'Rourke

Proceedings of the 12th ACM ASIA Public-Key Cryptography Workshop, 2025

2024

Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency.

Giacomo Fenzi, Hossein Moghaddas, Ngoc Khanh Nguyen

J. Cryptol., September, 2024

RoK, Paper, SISsors - Toolkit for Lattice-based Succinct Arguments.

Michael Klooß, Russell W. F. Lai, Ngoc Khanh Nguyen, Michal Osadnik

IACR Cryptol. ePrint Arch., 2024

K-Waay: Fast and Deniable Post-Quantum X3DH without Ring Signatures.

Daniel Collins, Loïs Huguenin-Dumittan, Ngoc Khanh Nguyen, Nicolas Rolin, Serge Vaudenay

Proceedings of the 33rd USENIX Security Symposium, 2024

SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions.

Martin R. Albrecht, Giacomo Fenzi, Oleksandra Lapiha, Ngoc Khanh Nguyen

Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Greyhound: Fast Polynomial Commitments from Lattices.

Ngoc Khanh Nguyen, Gregor Seiler

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setup.

Valerio Cini, Giulio Malavolta, Ngoc Khanh Nguyen, Hoeteck Wee

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

RoK, Paper, SISsors Toolkit for Lattice-Based Succinct Arguments - (Extended Abstract).

Michael Klooß, Russell W. F. Lai, Ngoc Khanh Nguyen, Michal Osadnik

Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

Lova: Lattice-Based Folding Scheme from Unstructured Lattices.

Giacomo Fenzi, Christian Knabenhans, Ngoc Khanh Nguyen, Duc Tu Pham

Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023

Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency.

Giacomo Fenzi, Ngoc Khanh Nguyen

IACR Cryptol. ePrint Arch., 2023

A Framework for Practical Anonymous Credentials from Lattices.

Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal.

Ward Beullens, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022

Lattice-Based Zero-Knowledge Proofs Under a Few Dozen Kilobytes.

Ngoc Khanh Nguyen

PhD thesis, 2022

Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures.

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon

Proceedings of the Public-Key Cryptography - PKC 2022, 2022

Lifting Standard Model Reductions to Common Setup Assumptions.

Ngoc Khanh Nguyen, Eftychios Theodorakis, Bogdan Warinschi

Proceedings of the Public-Key Cryptography - PKC 2022, 2022

Practical Sublinear Proofs for R1CS from Lattices.

Ngoc Khanh Nguyen, Gregor Seiler

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General.

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications.

Vadim Lyubashevsky, Ngoc Khanh Nguyen

Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021

Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments.

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler

Proceedings of the Public-Key Cryptography - PKC 2021, 2021

More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE.

Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler

Proceedings of the Computer Security - ESORICS 2021, 2021

SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions.

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations.

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon, Gregor Seiler

Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020

Lattice-Based Blind Signatures, Revisited.

Eduard Hauck, Eike Kiltz, Julian Loss, Ngoc Khanh Nguyen

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge.

Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations.

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings.

Muhammed F. Esgin, Ngoc Khanh Nguyen, Gregor Seiler

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019

On Tightly Secure Primitives in the Multi-instance Setting.

Dennis Hofheinz, Ngoc Khanh Nguyen

Proceedings of the Public-Key Cryptography - PKC 2019, 2019

On the Non-existence of Short Vectors in Random Module Lattices.

Ngoc Khanh Nguyen

Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2017

Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model).

David Bernhard, Ngoc Khanh Nguyen, Bogdan Warinschi

Proceedings of the Applied Cryptography and Network Security, 2017