default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPratik Soni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Nikhil Vanjani
, Pratik Soni, Sri Aravinda Krishnan Thyagarajan:
Functional Adaptor Signatures: Beyond All-or-Nothing Blockchain-based Payments. CCS 2024: 1493-1507- [c13]Sri Aravinda Krishnan Thyagarajan, Pratik Soni, Ke Wu:
Game-Theoretically Fair Distributed Sampling. CRYPTO (8) 2024: 207-239 - [c12]Paul Gerhart, Dominique Schröder, Pratik Soni, Sri Aravinda Krishnan Thyagarajan:
Foundations of Adaptor Signatures. EUROCRYPT (2) 2024: 161-189 - [c11]Prabhanjan Ananth, Gilad Asharov, Vipul Goyal, Hadar Kaner, Pratik Soni, Brent Waters:
NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness. SCN (1) 2024: 3-23 - [i14]Nikhil Vanjani, Pratik Soni, Sri Aravinda Krishnan Thyagarajan:
Functional Adaptor Signatures: Beyond All-or-Nothing Blockchain-based Payments. CoRR abs/2410.11134 (2024) - [i13]Prabhanjan Ananth, Gilad Asharov, Vipul Goyal, Hadar Kaner, Pratik Soni, Brent Waters:
NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness. IACR Cryptol. ePrint Arch. 2024: 207 (2024) - [i12]Sri Aravinda Krishnan Thyagarajan, Ke Wu, Pratik Soni:
Game-Theoretically Fair Distributed Sampling. IACR Cryptol. ePrint Arch. 2024: 223 (2024) - [i11]Chen-Da Liu-Zhang, Elisaweta Masserova, João Ribeiro, Pratik Soni, Sri Aravinda Krishnan Thyagarajan:
Improved YOSO Randomness Generation with Worst-Case Corruptions. IACR Cryptol. ePrint Arch. 2024: 1268 (2024) - [i10]Nikhil Vanjani, Pratik Soni, Sri Aravinda Krishnan Thyagarajan:
Functional Adaptor Signatures: Beyond All-or-Nothing Blockchain-based Payments. IACR Cryptol. ePrint Arch. 2024: 1523 (2024) - [i9]Paul Gerhart, Dominique Schröder, Pratik Soni, Sri Aravinda Krishnan Thyagarajan:
Foundations of Adaptor Signatures. IACR Cryptol. ePrint Arch. 2024: 1809 (2024) - 2023
- [c10]Rex Fernando, Elaine Shi, Pratik Soni, Nikhil Vanjani, Brent Waters:
Non-Interactive Anonymous Router with Quasi-Linear Router Computation. TCC (3) 2023: 62-92 - [c9]Sourav Das, Rex Fernando, Ilan Komargodski, Elaine Shi, Pratik Soni:
Distributed-Prover Interactive Proofs. TCC (1) 2023: 91-120 - 2022
- [c8]Vipul Goyal, Justin Raizes, Pratik Soni:
Time-Traveling Simulators Using Blockchains and Their Applications. ITCS 2022: 81:1-81:19 - [i8]Vipul Goyal, Justin Raizes, Pratik Soni:
Time-Traveling Simulators Using Blockchains and Their Applications. IACR Cryptol. ePrint Arch. 2022: 35 (2022) - [i7]Rex Fernando, Elaine Shi, Pratik Soni, Nikhil Vanjani:
Non-Interactive Anonymous Router with Quasi-Linear Router Computation. IACR Cryptol. ePrint Arch. 2022: 1395 (2022) - 2021
- [c7]Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni:
Time- and Space-Efficient Arguments from Groups of Unknown Order. CRYPTO (4) 2021: 123-152 - [i6]Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni:
Time- and Space-Efficient Arguments from Groups of Unknown Order. IACR Cryptol. ePrint Arch. 2021: 358 (2021) - 2020
- [b1]Pratik Soni:
Transforming Pseudorandomness and Non-malleability with Minimal Overheads. University of California, Santa Barbara, USA, 2020 - [j1]Huijia Lin, Rafael Pass, Pratik Soni:
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles. SIAM J. Comput. 49(4) (2020) - [c6]Pratik Soni, Stefano Tessaro:
On the Query Complexity of Constructing PRFs from Non-adaptive PRFs. SCN 2020: 546-565 - [c5]Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni:
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. TCC (2) 2020: 168-197 - [i5]Pratik Soni, Stefano Tessaro:
On the Query Complexity of Constructing PRFs from Non-adaptive PRFs. IACR Cryptol. ePrint Arch. 2020: 1075 (2020) - [i4]Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni:
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. IACR Cryptol. ePrint Arch. 2020: 1425 (2020)
2010 – 2019
- 2018
- [c4]Pratik Soni, Stefano Tessaro:
Naor-Reingold Goes Public: The Complexity of Known-Key Security. EUROCRYPT (3) 2018: 653-684 - [i3]Pratik Soni, Stefano Tessaro:
Naor-Reingold Goes Public: The Complexity of Known-key Security. IACR Cryptol. ePrint Arch. 2018: 137 (2018) - 2017
- [c3]Pratik Soni, Stefano Tessaro:
Public-Seed Pseudorandom Permutations. EUROCRYPT (2) 2017: 412-441 - [c2]Huijia Lin, Rafael Pass, Pratik Soni:
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles. FOCS 2017: 576-587 - [i2]Huijia Lin, Rafael Pass, Pratik Soni:
Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles. IACR Cryptol. ePrint Arch. 2017: 273 (2017) - [i1]Pratik Soni, Stefano Tessaro:
Public-Seed Pseudorandom Permutations. IACR Cryptol. ePrint Arch. 2017: 539 (2017) - 2015
- [c1]Pratik Soni, Enrico Budianto, Prateek Saxena:
The SICILIAN Defense: Signature-based Whitelisting of Web JavaScript. CCS 2015: 1542-1557
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
