Ngoc Khanh Nguyen

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 42

Top Topics

Signature Verification

Knowledge Sources

Top Venues

IACR Cryptol. ePrint Arch.

Public Key Cryptography (1)

Publications

Valerio Cini, Giulio Malavolta, Ngoc Khanh Nguyen, Hoeteck Wee
Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setup. CRYPTO (10) (2024)
Ngoc Khanh Nguyen, Gregor Seiler
Greyhound: Fast Polynomial Commitments from Lattices. IACR Cryptol. ePrint Arch. 2024 (2024)
Ngoc Khanh Nguyen, Gregor Seiler
Greyhound: Fast Polynomial Commitments from Lattices. CRYPTO (10) (2024)
Martin R. Albrecht, Giacomo Fenzi, Oleksandra Lapiha, Ngoc Khanh Nguyen
SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions. EUROCRYPT (6) (2024)
Giacomo Fenzi, Hossein Moghaddas, Ngoc Khanh Nguyen
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency. J. Cryptol. 37 (3) (2024)
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti
A Framework for Practical Anonymous Credentials from Lattices. IACR Cryptol. ePrint Arch. 2023 (2023)
Ward Beullens, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal. IACR Cryptol. ePrint Arch. 2023 (2023)
Ward Beullens, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal. CCS (2023)
Giacomo Fenzi, Ngoc Khanh Nguyen
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency. IACR Cryptol. ePrint Arch. 2023 (2023)
Martin R. Albrecht, Giacomo Fenzi, Oleksandra Lapiha, Ngoc Khanh Nguyen
SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions. IACR Cryptol. ePrint Arch. 2023 (2023)
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti
A Framework for Practical Anonymous Credentials from Lattices. CRYPTO (2) (2023)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. CRYPTO (2) (2022)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon
Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. Public Key Cryptography (2) (2022)
Ngoc Khanh Nguyen, Gregor Seiler
Practical Sublinear Proofs for R1CS from Lattices. CRYPTO (2) (2022)
Ngoc Khanh Nguyen, Gregor Seiler
Practical Sublinear Proofs for R1CS from Lattices. IACR Cryptol. ePrint Arch. 2022 (2022)
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 (2022)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon
Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. IACR Cryptol. ePrint Arch. 2022 (2022)
Vadim Lyubashevsky, Ngoc Khanh Nguyen
BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications. ASIACRYPT (4) (2022)
Ngoc Khanh Nguyen, Eftychios Theodorakis, Bogdan Warinschi
Lifting Standard Model Reductions to Common Setup Assumptions. Public Key Cryptography (2) (2022)
Vadim Lyubashevsky, Ngoc Khanh Nguyen
BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications. IACR Cryptol. ePrint Arch. 2022 (2022)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. CRYPTO (2) (2021)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. IACR Cryptol. ePrint Arch. 2021 (2021)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon, Gregor Seiler
Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations. IACR Cryptol. ePrint Arch. 2021 (2021)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. Public Key Cryptography (1) (2021)
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. ESORICS (2) (2021)
Ngoc Khanh Nguyen, Eftychios Theodorakis, Bogdan Warinschi
Lifting Standard Model Reductions to Common Setup Assumptions. IACR Cryptol. ePrint Arch. 2021 (2021)
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)
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. IACR Cryptol. ePrint Arch. 2020 (2020)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. IACR Cryptol. ePrint Arch. 2020 (2020)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. IACR Cryptol. ePrint Arch. 2020 (2020)
Muhammed F. Esgin, Ngoc Khanh Nguyen, Gregor Seiler
Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings. IACR Cryptol. ePrint Arch. 2020 (2020)
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. IACR Cryptol. ePrint Arch. 2020 (2020)
Eduard Hauck, Eike Kiltz, Julian Loss, Ngoc Khanh Nguyen
Lattice-Based Blind Signatures, Revisited. IACR Cryptol. ePrint Arch. 2020 (2020)
Muhammed F. Esgin, Ngoc Khanh Nguyen, Gregor Seiler
Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings. ASIACRYPT (2) (2020)
Eduard Hauck, Eike Kiltz, Julian Loss, Ngoc Khanh Nguyen
Lattice-Based Blind Signatures, Revisited. CRYPTO (2) (2020)
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. CRYPTO (2) (2020)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. CCS (2020)
Dennis Hofheinz, Ngoc Khanh Nguyen
On Tightly Secure Primitives in the Multi-instance Setting. Public Key Cryptography (1) (2019)
Ngoc Khanh Nguyen
On the Non-Existence of Short Vectors in Random Module Lattices. IACR Cryptol. ePrint Arch. 2019 (2019)
Ngoc Khanh Nguyen
On the Non-existence of Short Vectors in Random Module Lattices. ASIACRYPT (2) (2019)
Dennis Hofheinz, Ngoc Khanh Nguyen
On Tightly Secure Primitives in the Multi-Instance Setting. IACR Cryptol. ePrint Arch. 2018 (2018)
David Bernhard, Ngoc Khanh Nguyen, Bogdan Warinschi
Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model). ACNS (2017)