Nguyen, Ngoc Khanh
5614  results:
Search for persons X
?
1

SLAP: Succinct Lattice-Based Polynomial Commitments from St..:

, In: Lecture Notes in Computer Science; Advances in Cryptology – EUROCRYPT 2024,
 
?
2

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

, In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security,
 
?
5

A Framework for Practical Anonymous Credentials from Lattic..:

, In: Advances in Cryptology – CRYPTO 2023; Lecture Notes in Computer Science,
 
?
6

Practical Sublinear Proofs for R1CS from Lattices:

, In: Advances in Cryptology – CRYPTO 2022; Lecture Notes in Computer Science,
Nguyen, Ngoc Khanh ; Seiler, Gregor - p. 133-162 , 2022
 
?
7

BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applicati..:

, In: Advances in Cryptology – ASIACRYPT 2022; Lecture Notes in Computer Science,
 
?
8

Efficient Lattice-Based Blind Signatures via Gaussian One-T..:

, In: Public-Key Cryptography – PKC 2022; Lecture Notes in Computer Science,
 
?
9

Lattice-Based Zero-Knowledge Proofs and Applications: Short..:

, In: Advances in Cryptology – CRYPTO 2022; Lecture Notes in Computer Science,
 
?
10

SALSA: Spatial Cue-Augmented Log-Spectrogram Features for P..:

Nguyen, Thi Ngoc Tho ; Watcharasupat, Karn N. ; Nguyen, Ngoc Khanh..
IEEE/ACM Transactions on Audio, Speech, and Language Processing.  30 (2022)  - p. 1749-1762 , 2022
 
?
11

Lifting Standard Model Reductions to Common Setup Assumptio..:

, In: Public-Key Cryptography – PKC 2022; Lecture Notes in Computer Science,
 
?
12

SMILE: Set Membership from Ideal Lattices with Applications..:

, In: Advances in Cryptology – CRYPTO 2021; Lecture Notes in Computer Science,
 
?
13

More Efficient Amortization of Exact Zero-Knowledge Proofs ..:

, In: Computer Security – ESORICS 2021; Lecture Notes in Computer Science,
 
?
14

Shorter Lattice-Based Group Signatures via "Almost Free" En..:

, In: Lecture Notes in Computer Science; Advances in Cryptology – ASIACRYPT 2021,
 
?
15

Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Co..:

, In: Public-Key Cryptography – PKC 2021; Lecture Notes in Computer Science,
 
1-15