( en | de | ru )

 

Disambiguation of "Nguyen, Ngoc Khanh"

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setup.

, , , and . CRYPTO (10), volume 14929 of Lecture Notes in Computer Science, page 207-242. Springer, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nguyen Ngoc

Nguyen Ngoc

Quoc-Khanh Nguyen

Nguyen quoc Khanh

Nguyen-Khanh-Bui

 

Other publications of authors with the same name

DCASE 2018 task 2: iterative training, label smoothing, and background noise normalization for audio event tagging., , , and . DCASE, page 54-58. (2018)BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications., and . ASIACRYPT (4), volume 13794 of Lecture Notes in Computer Science, page 95-125. Springer, (2022)Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments., , and . Public Key Cryptography (1), volume 12710 of Lecture Notes in Computer Science, page 215-241. Springer, (2021)Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal., , , and . CCS, page 16-29. ACM, (2023)Greyhound: Fast Polynomial Commitments from Lattices., and . IACR Cryptol. ePrint Arch., (2024)Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency., , and . J. Cryptol., 37 (3): 31 (September 2024)Beauty Moment Rendering via Face Happiness Scoring., , , , , and . MAPR, page 1-5. IEEE, (2021)Lattice-Based Blind Signatures, Revisited., , , and . CRYPTO (2), volume 12171 of Lecture Notes in Computer Science, page 500-529. Springer, (2020)Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings., , and . ASIACRYPT (2), volume 12492 of Lecture Notes in Computer Science, page 259-288. Springer, (2020)Lifting Standard Model Reductions to Common Setup Assumptions., , and . Public Key Cryptography (2), volume 13178 of Lecture Notes in Computer Science, page 130-160. Springer, (2022)