Author of the publication

Time- and Space-Efficient Arguments from Groups of Unknown Order.

, , , , and . CRYPTO (4), volume 12828 of Lecture Notes in Computer Science, page 123-152. Springer, (2021)

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.

 

Other publications of authors with the same name

Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads., , , , and . TCC (2), volume 12551 of Lecture Notes in Computer Science, page 168-197. Springer, (2020)Public-Seed Pseudorandom Permutations., and . EUROCRYPT (2), volume 10211 of Lecture Notes in Computer Science, page 412-441. (2017)Game-Theoretically Fair Distributed Sampling., , and . IACR Cryptol. ePrint Arch., (2024)Transforming Pseudorandomness and Non-malleability with Minimal Overheads.. University of California, Santa Barbara, USA, (2020)Non-Interactive Anonymous Router with Quasi-Linear Router Computation., , , , and . TCC (3), volume 14371 of Lecture Notes in Computer Science, page 62-92. Springer, (2023)Time- and Space-Efficient Arguments from Groups of Unknown Order., , , , and . CRYPTO (4), volume 12828 of Lecture Notes in Computer Science, page 123-152. Springer, (2021)Foundations of Adaptor Signatures., , , and . EUROCRYPT (2), volume 14652 of Lecture Notes in Computer Science, page 161-189. Springer, (2024)Naor-Reingold Goes Public: The Complexity of Known-Key Security., and . EUROCRYPT (3), volume 10822 of Lecture Notes in Computer Science, page 653-684. Springer, (2018)On the Query Complexity of Constructing PRFs from Non-adaptive PRFs., and . IACR Cryptol. ePrint Arch., (2020)Time-Traveling Simulators Using Blockchains and Their Applications., , and . ITCS, volume 215 of LIPIcs, page 81:1-81:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)