( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Game-Theoretically Fair Distributed Sampling.

, , и . IACR Cryptol. ePrint Arch., (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.

Rohit Soni

Pratik Gajane

Soni Pullamsetti

Hardik Soni

Aashish Soni

 

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

Non-Interactive Anonymous Router with Quasi-Linear Router Computation., , , и . IACR Cryptol. ePrint Arch., (2022)Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads., , , , и . TCC (2), том 12551 из Lecture Notes in Computer Science, стр. 168-197. Springer, (2020)Public-Seed Pseudorandom Permutations., и . EUROCRYPT (2), том 10211 из Lecture Notes in Computer Science, стр. 412-441. (2017)Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles., , и . SIAM J. Comput., (2020)Naor-Reingold Goes Public: The Complexity of Known-Key Security., и . EUROCRYPT (3), том 10822 из Lecture Notes in Computer Science, стр. 653-684. Springer, (2018)On the Query Complexity of Constructing PRFs from Non-adaptive PRFs., и . IACR Cryptol. ePrint Arch., (2020)NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness., , , , , и . IACR Cryptol. ePrint Arch., (2024)Distributed-Prover Interactive Proofs., , , , и . TCC (1), том 14369 из Lecture Notes in Computer Science, стр. 91-120. Springer, (2023)Time-Traveling Simulators Using Blockchains and Their Applications., , и . ITCS, том 215 из LIPIcs, стр. 81:1-81:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Transforming Pseudorandomness and Non-malleability with Minimal Overheads.. University of California, Santa Barbara, USA, (2020)