Pratik Soni

Orcid: 0000-0002-3225-3323

According to our database1, Pratik Soni authored at least 15 papers between 2015 and 2024.

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

2024
Game-Theoretically Fair Distributed Sampling.
IACR Cryptol. ePrint Arch., 2024

NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness.
IACR Cryptol. ePrint Arch., 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
Time-Traveling Simulators Using Blockchains and Their Applications.
IACR Cryptol. ePrint Arch., 2022

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

2021
Time- and Space-Efficient Arguments from Groups of Unknown Order.
IACR Cryptol. ePrint Arch., 2021

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

Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles.
SIAM J. Comput., 2020

On the Query Complexity of Constructing PRFs from Non-adaptive PRFs.
IACR Cryptol. ePrint Arch., 2020

Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads.
IACR Cryptol. ePrint Arch., 2020

2018
Naor-Reingold Goes Public: The Complexity of Known-key Security.
IACR Cryptol. ePrint Arch., 2018

2017
Public-Seed Pseudorandom Permutations.
IACR Cryptol. ePrint Arch., 2017

Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles.
IACR Cryptol. ePrint Arch., 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...