Pratik Soni

Orcid: 0000-0002-3225-3323

According to our database1, Pratik Soni authored at least 19 papers between 2015 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Efficient Distributed Randomness Generation from Minimal Assumptions Where PArties Speak Sequentially Once.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024
NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness.
Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024

Improved YOSO Randomness Generation with Worst-Case Corruptions.
Proceedings of the Financial Cryptography and Data Security, 2024

Foundations of Adaptor Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Game-Theoretically Fair Distributed Sampling.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Functional Adaptor Signatures: Beyond All-or-Nothing Blockchain-based Payments.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Non-Interactive Anonymous Router with Quasi-Linear Router Computation.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Distributed-Prover Interactive Proofs.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022
Non-Interactive Anonymous Router with Quasi-Linear Router Computation.
IACR Cryptol. ePrint Arch., 2022

Time-Traveling Simulators Using Blockchains and Their Applications.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Time- and Space-Efficient Arguments from Groups of Unknown Order.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Transforming Pseudorandomness and Non-malleability with Minimal Overheads.
PhD thesis, 2020

Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

On the Query Complexity of Constructing PRFs from Non-adaptive PRFs.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

2018
Naor-Reingold Goes Public: The Complexity of Known-Key Security.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles.
IACR Cryptol. ePrint Arch., 2017

Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Public-Seed Pseudorandom Permutations.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2015
The SICILIAN Defense: Signature-based Whitelisting of Web JavaScript.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015


  Loading...