Ngoc Khanh Nguyen

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

Collaborative distances:

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

2024

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

Giacomo Fenzi, Hossein Moghaddas, Ngoc Khanh Nguyen

J. Cryptol., September, 2024

Greyhound: Fast Polynomial Commitments from Lattices.

Ngoc Khanh Nguyen, Gregor Seiler

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

IACR Cryptol. ePrint Arch., 2024

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

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

IACR Cryptol. ePrint Arch., 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

IACR Cryptol. ePrint Arch., 2023

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

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

IACR Cryptol. ePrint Arch., 2023

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

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

IACR Cryptol. ePrint Arch., 2023

2022

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

Ngoc Khanh Nguyen

PhD thesis, 2022

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

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon

IACR Cryptol. ePrint Arch., 2022

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

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon

IACR Cryptol. ePrint Arch., 2022

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

Vadim Lyubashevsky, Ngoc Khanh Nguyen

IACR Cryptol. ePrint Arch., 2022

Practical Sublinear Proofs for R1CS from Lattices.

Ngoc Khanh Nguyen, Gregor Seiler

IACR Cryptol. ePrint Arch., 2022

2021

Lifting Standard Model Reductions to Common Setup Assumptions.

Ngoc Khanh Nguyen, Eftychios Theodorakis, Bogdan Warinschi

IACR Cryptol. ePrint Arch., 2021

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

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler

IACR Cryptol. ePrint Arch., 2021

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

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

IACR Cryptol. ePrint Arch., 2021

2020

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

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler

IACR Cryptol. ePrint Arch., 2020

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

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler

IACR Cryptol. ePrint Arch., 2020

Lattice-Based Blind Signatures, Revisited.

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

IACR Cryptol. ePrint Arch., 2020

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

Muhammed F. Esgin, Ngoc Khanh Nguyen, Gregor Seiler

IACR Cryptol. ePrint Arch., 2020

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

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

IACR Cryptol. ePrint Arch., 2020

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

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

IACR Cryptol. ePrint Arch., 2020

2019

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

Ngoc Khanh Nguyen

IACR Cryptol. ePrint Arch., 2019

2018

On Tightly Secure Primitives in the Multi-Instance Setting.

Dennis Hofheinz, Ngoc Khanh Nguyen

IACR Cryptol. ePrint Arch., 2018

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