From post

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.

 

Другие публикации лиц с тем же именем

Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions., , , , и . IACR Cryptol. ePrint Arch., (2020)Succinct Zero-Knowledge Batch Proofs for Set Accumulators., , , , , и . IACR Cryptol. ePrint Arch., (2021)LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs., , и . CCS, стр. 2075-2092. ACM, (2019)Curve Trees: Practical and Transparent Zero-Knowledge Accumulators., и . IACR Cryptol. ePrint Arch., (2022)Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions., и . IACR Cryptol. ePrint Arch., (2021)Succinct Zero-Knowledge Batch Proofs for Set Accumulators., , , , , и . CCS, стр. 455-469. ACM, (2022)Lunar: A Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions., , , , и . ASIACRYPT (3), том 13092 из Lecture Notes in Computer Science, стр. 3-33. Springer, (2021)Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage., , , , и . ASIACRYPT (2), том 12492 из Lecture Notes in Computer Science, стр. 3-35. Springer, (2020)Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees., , , , и . IACR Cryptol. ePrint Arch., (2023)Impossibilities in Succinct Arguments: Black-Box Extraction and More., , , и . AFRICACRYPT, том 14064 из Lecture Notes in Computer Science, стр. 465-489. Springer, (2023)