Follow
Ngoc Khanh Nguyen
Title
Cited by
Cited by
Year
Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
V Lyubashevsky, NK Nguyen, M Plançon
Annual International Cryptology Conference, 71-101, 2022
1022022
Practical exact proofs from lattices: New techniques to exploit fully-splitting rings
MF Esgin, NK Nguyen, G Seiler
Advances in Cryptology–ASIACRYPT 2020: 26th International Conference on the …, 2020
952020
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments.
V Lyubashevsky, NK Nguyen, G Seiler
IACR International Workshop on Public Key Cryptography, 2020
792020
A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge
J Bootle, V Lyubashevsky, NK Nguyen, G Seiler
Annual International Cryptology Conference, 2020
672020
Lattice-based blind signatures, revisited
E Hauck, E Kiltz, J Loss, NK Nguyen
Annual International Cryptology Conference, 500-529, 2020
612020
Practical lattice-based zero-knowledge proofs for integer relations
V Lyubashevsky, NK Nguyen, G Seiler
Proceedings of the 2020 ACM SIGSAC conference on computer and communications …, 2020
572020
SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions
V Lyubashevsky, NK Nguyen, G Seiler
522021
Shorter lattice-based group signatures via “almost free” encryption and other optimizations
V Lyubashevsky, NK Nguyen, M Plançon, G Seiler
International Conference on the Theory and Application of Cryptology and …, 2021
422021
Efficient lattice-based blind signatures via gaussian one-time signatures
V Lyubashevsky, NK Nguyen, M Plancon
IACR International Conference on Public-Key Cryptography, 498-527, 2022
242022
Lattice-based blind signatures: Short, efficient, and round-optimal
W Beullens, V Lyubashevsky, NK Nguyen, G Seiler
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications …, 2023
202023
A framework for practical anonymous credentials from lattices
J Bootle, V Lyubashevsky, NK Nguyen, A Sorniotti
Annual International Cryptology Conference, 384-417, 2023
182023
BLOOM: bimodal lattice one-out-of-many proofs and applications
V Lyubashevsky, NK Nguyen
International Conference on the Theory and Application of Cryptology and …, 2022
162022
Practical sublinear proofs for R1CS from lattices
NK Nguyen, G Seiler
Annual International Cryptology Conference, 133-162, 2022
162022
More efficient amortization of exact zero-knowledge proofs for LWE
J Bootle, V Lyubashevsky, NK Nguyen, G Seiler
European Symposium on Research in Computer Security, 608-627, 2021
132021
SLAP: succinct lattice-based polynomial commitments from standard assumptions
MR Albrecht, G Fenzi, O Lapiha, NK Nguyen
Annual International Conference on the Theory and Applications of …, 2024
102024
Adaptive proofs have straightline extractors (in the random oracle model)
D Bernhard, NK Nguyen, B Warinschi
International Conference on Applied Cryptography and Network Security, 336-353, 2017
92017
Lattice-based polynomial commitments: Towards asymptotic and concrete efficiency
G Fenzi, H Moghaddas, NK Nguyen
Journal of Cryptology 37 (3), 31, 2024
72024
On tightly secure primitives in the multi-instance setting
D Hofheinz, NK Nguyen
Public-Key Cryptography–PKC 2019: 22nd IACR International Conference on …, 2019
62019
On the non-existence of short vectors in random module lattices
NK Nguyen
International Conference on the Theory and Application of Cryptology and …, 2019
52019
Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
V Cini, G Malavolta, NK Nguyen, H Wee
Annual International Cryptology Conference, 207-242, 2024
42024
The system can't perform the operation now. Try again later.
Articles 1–20