default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNgoc Khanh Nguyen 0001
Person information
- affiliation: King's College London, UK
- affiliation (former): EPFL, Lausanne, Switzerland
- affiliation (former): IBM Research Zurich, Switzerland
- affiliation (former): ETH Zurich, Switzerland
- affiliation (former): University of Bristol, UK
Other persons with the same name
- Ngoc Khanh Nguyen 0002 — Fernuniversität Hagen, Germany
- Ngoc Khanh Nguyen 0003 — University of Illinois at Urbana-Champaign, Department of Electrical and Computer Engineering, IL, USA
- Ngoc Khanh Nguyen 0004 — University of Information Technology, Ho Chi Minh City, Vietnam (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Giacomo Fenzi
, Hossein Moghaddas, Ngoc Khanh Nguyen:
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency. J. Cryptol. 37(3): 31 (2024)- [c22]Valerio Cini, Giulio Malavolta, Ngoc Khanh Nguyen, Hoeteck Wee:
Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setup. CRYPTO (10) 2024: 207-242 - [c21]Ngoc Khanh Nguyen, Gregor Seiler:
Greyhound: Fast Polynomial Commitments from Lattices. CRYPTO (10) 2024: 243-275 - [c20]Martin R. Albrecht, Giacomo Fenzi, Oleksandra Lapiha, Ngoc Khanh Nguyen:
SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions. EUROCRYPT (6) 2024: 90-119 - [c19]Daniel Collins, Loïs Huguenin-Dumittan, Ngoc Khanh Nguyen, Nicolas Rolin, Serge Vaudenay:
K-Waay: Fast and Deniable Post-Quantum X3DH without Ring Signatures. USENIX Security Symposium 2024 - [i22]Daniel Collins, Loïs Huguenin-Dumittan, Ngoc Khanh Nguyen, Nicolas Rolin, Serge Vaudenay:
K-Waay: Fast and Deniable Post-Quantum X3DH without Ring Signatures. IACR Cryptol. ePrint Arch. 2024: 120 (2024) - [i21]Valerio Cini, Giulio Malavolta, Ngoc Khanh Nguyen, Hoeteck Wee:
Polynomial Commitments from Lattices: Post-Quantum Security, Fast Verification and Transparent Setup. IACR Cryptol. ePrint Arch. 2024: 281 (2024) - [i20]Ngoc Khanh Nguyen, Gregor Seiler:
Greyhound: Fast Polynomial Commitments from Lattices. IACR Cryptol. ePrint Arch. 2024: 1293 (2024) - 2023
- [c18]Ward Beullens, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal. CCS 2023: 16-29 - [c17]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti:
A Framework for Practical Anonymous Credentials from Lattices. CRYPTO (2) 2023: 384-417 - [i19]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) - [i18]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti:
A Framework for Practical Anonymous Credentials from Lattices. IACR Cryptol. ePrint Arch. 2023: 560 (2023) - [i17]Giacomo Fenzi, Ngoc Khanh Nguyen:
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency. IACR Cryptol. ePrint Arch. 2023: 846 (2023) - [i16]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) - 2022
- [b1]Ngoc Khanh Nguyen:
Lattice-Based Zero-Knowledge Proofs Under a Few Dozen Kilobytes. ETH Zurich, Zürich, Switzerland, 2022 - [c16]Vadim Lyubashevsky, Ngoc Khanh Nguyen:
BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications. ASIACRYPT (4) 2022: 95-125 - [c15]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 - [c14]Ngoc Khanh Nguyen, Gregor Seiler:
Practical Sublinear Proofs for R1CS from Lattices. CRYPTO (2) 2022: 133-162 - [c13]Ngoc Khanh Nguyen, Eftychios Theodorakis, Bogdan Warinschi:
Lifting Standard Model Reductions to Common Setup Assumptions. Public Key Cryptography (2) 2022: 130-160 - [c12]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 - [i15]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) - [i14]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) - [i13]Ngoc Khanh Nguyen, Gregor Seiler:
Practical Sublinear Proofs for R1CS from Lattices. IACR Cryptol. ePrint Arch. 2022: 1048 (2022) - [i12]Vadim Lyubashevsky, Ngoc Khanh Nguyen:
BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications. IACR Cryptol. ePrint Arch. 2022: 1307 (2022) - 2021
- [c11]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 - [c10]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 - [c9]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. ESORICS (2) 2021: 608-627 - [c8]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. Public Key Cryptography (1) 2021: 215-241 - [i11]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: 564 (2021) - [i10]Ngoc Khanh Nguyen, Eftychios Theodorakis, Bogdan Warinschi:
Lifting Standard Model Reductions to Common Setup Assumptions. IACR Cryptol. ePrint Arch. 2021: 888 (2021) - [i9]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: 1575 (2021) - 2020
- [c7]Muhammed F. Esgin, Ngoc Khanh Nguyen, Gregor Seiler:
Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings. ASIACRYPT (2) 2020: 259-288 - [c6]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. CCS 2020: 1051-1070 - [c5]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. CRYPTO (2) 2020: 441-469 - [c4]Eduard Hauck, Eike Kiltz, Julian Loss, Ngoc Khanh Nguyen:
Lattice-Based Blind Signatures, Revisited. CRYPTO (2) 2020: 500-529 - [i8]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: 518 (2020) - [i7]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. IACR Cryptol. ePrint Arch. 2020: 737 (2020) - [i6]Eduard Hauck, Eike Kiltz, Julian Loss, Ngoc Khanh Nguyen:
Lattice-Based Blind Signatures, Revisited. IACR Cryptol. ePrint Arch. 2020: 769 (2020) - [i5]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. IACR Cryptol. ePrint Arch. 2020: 1183 (2020) - [i4]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. IACR Cryptol. ePrint Arch. 2020: 1448 (2020) - [i3]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. IACR Cryptol. ePrint Arch. 2020: 1449 (2020)
2010 – 2019
- 2019
- [c3]Ngoc Khanh Nguyen:
On the Non-existence of Short Vectors in Random Module Lattices. ASIACRYPT (2) 2019: 121-150 - [c2]Dennis Hofheinz, Ngoc Khanh Nguyen:
On Tightly Secure Primitives in the Multi-instance Setting. Public Key Cryptography (1) 2019: 581-611 - [i2]Ngoc Khanh Nguyen:
On the Non-Existence of Short Vectors in Random Module Lattices. IACR Cryptol. ePrint Arch. 2019: 973 (2019) - 2018
- [i1]Dennis Hofheinz, Ngoc Khanh Nguyen:
On Tightly Secure Primitives in the Multi-Instance Setting. IACR Cryptol. ePrint Arch. 2018: 958 (2018) - 2017
- [c1]David Bernhard, Ngoc Khanh Nguyen, Bogdan Warinschi:
Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model). ACNS 2017: 336-353
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
