| 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 | 132 | 2022 |
| 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 | 102 | 2020 |
| Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. V Lyubashevsky, NK Nguyen, G Seiler IACR International Workshop on Public Key Cryptography, 2020 | 86 | 2020 |
| A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge J Bootle, V Lyubashevsky, NK Nguyen, G Seiler Annual International Cryptology Conference, 2020 | 78 | 2020 |
| Lattice-based blind signatures, revisited E Hauck, E Kiltz, J Loss, NK Nguyen Annual International Cryptology Conference, 500-529, 2020 | 68 | 2020 |
| 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 | 59 | 2020 |
| SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions V Lyubashevsky, NK Nguyen, G Seiler | 56 | 2021 |
| 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 | 49 | 2021 |
| 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 | 28 | 2022 |
| A framework for practical anonymous credentials from lattices J Bootle, V Lyubashevsky, NK Nguyen, A Sorniotti Annual International Cryptology Conference, 384-417, 2023 | 27 | 2023 |
| 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 | 25 | 2023 |
| 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 | 21 | 2022 |
| Practical sublinear proofs for R1CS from lattices NK Nguyen, G Seiler Annual International Cryptology Conference, 133-162, 2022 | 18 | 2022 |
| 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 | 16 | 2021 |
| 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 | 15 | 2024 |
| Lattice-based polynomial commitments: Towards asymptotic and concrete efficiency G Fenzi, H Moghaddas, NK Nguyen Journal of Cryptology 37 (3), 31, 2024 | 14 | 2024 |
| 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 | 9 | 2024 |
| 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 | 9 | 2017 |
| Lova: lattice-based folding scheme from unstructured lattices G Fenzi, C Knabenhans, NK Nguyen, DT Pham International Conference on the Theory and Application of Cryptology and …, 2025 | 7 | 2025 |
| {K-Waay}: Fast and Deniable {Post-Quantum}{X3DH} without Ring Signatures D Collins, L Huguenin-Dumittan, NK Nguyen, N Rolin, S Vaudenay 33rd USENIX Security Symposium (USENIX Security 24), 433-450, 2024 | 7 | 2024 |
Vadim LyubashevskyIBM Research Europe, Zurichzurich.ibm.com üzerinde doğrulanmış e-posta adresine sahip
