default search action
Pratik Sarkar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j2]Dimitris Mouris, Christopher Patton, Hannah Davis, Pratik Sarkar, Nektarios Georgios Tsoutsos:
Mastic: Private Weighted Heavy-Hitters and Attribute-Based Metrics. Proc. Priv. Enhancing Technol. 2025(1): 290-319 (2025) - 2024
- [j1]Dimitris Mouris, Pratik Sarkar, Nektarios Georgios Tsoutsos:
PLASMA: Private, Lightweight Aggregated Statistics against Malicious Adversaries. Proc. Priv. Enhancing Technol. 2024(3): 4-24 (2024) - [i21]Dimitris Mouris, Christopher Patton, Hannah Davis, Pratik Sarkar, Nektarios Georgios Tsoutsos:
Mastic: Private Weighted Heavy-Hitters and Attribute-Based Metrics. IACR Cryptol. ePrint Arch. 2024: 221 (2024) - [i20]Jacob Gorman, Lucjan Hanzlik, Aniket Kate, Easwar Vivek Mangipudi, Pratyay Mukherjee, Pratik Sarkar, Sri Aravinda Krishnan Thyagarajan:
VRaaS: Verifiable Randomness as a Service on Blockchains. IACR Cryptol. ePrint Arch. 2024: 957 (2024) - [i19]Megan Chen, Pousali Dey, Chaya Ganesh, Pratyay Mukherjee, Pratik Sarkar, Swagata Sasmal:
Universally Composable Non-Interactive Zero-Knowledge from Sigma Protocols via a New Straight-line Compiler. IACR Cryptol. ePrint Arch. 2024: 1713 (2024) - 2023
- [c14]Suvradip Chakraborty, Chaya Ganesh, Pratik Sarkar:
Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge. EUROCRYPT (1) 2023: 239-270 - [c13]Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee
, Sikhar Patranabis, Srinivasan Raghuraman, Pratik Sarkar:
Round-Optimal Oblivious Transfer and MPC from Computational CSIDH. Public Key Cryptography (1) 2023: 376-405 - [i18]Yongqin Wang, Pratik Sarkar, Nishat Koti
CompactTag: Minimizing Computation Overheads in Actively-Secure MPC for Deep Neural Networks. CoRR abs/2311.04406 (2023) - [i17]Dimitris Mouris, Pratik Sarkar, Nektarios Georgios Tsoutsos:
PLASMA: Private, Lightweight Aggregated Statistics against Malicious Adversaries with Full Security. IACR Cryptol. ePrint Arch. 2023: 80 (2023) - [i16]Navid Alamati, Hart Montgomery, Sikhar Patranabis, Pratik Sarkar:
Two-Round Adaptively Secure MPC from Isogenies, LPN, or CDH. IACR Cryptol. ePrint Arch. 2023: 1170 (2023) - [i15]Yongqin Wang, Pratik Sarkar, Nishat Koti, Arpita Patra, Murali Annavaram:
CompactTag: Minimizing Computation Overheads in Actively-Secure MPC for Deep Neural Networks. IACR Cryptol. ePrint Arch. 2023: 1729 (2023) - 2022
- [c12]Ran Canetti, Pratik Sarkar, Xiao Wang:
Triply Adaptive UC NIZK. ASIACRYPT (2) 2022: 466-495 - [c11]Saikrishna Badrinarayanan, Sikhar Patranabis, Pratik Sarkar:
Statistical Security in Two-Party Computation Revisited. TCC (2) 2022: 181-210 - [i14]Saikrishna Badrinarayanan, Sikhar Patranabis, Pratik Sarkar:
Statistical Security in Two-Party Computation Revisited. IACR Cryptol. ePrint Arch. 2022: 1190 (2022) - [i13]Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee, Sikhar Patranabis, Srinivasan Raghuraman, Pratik Sarkar:
Round-Optimal Oblivious Transfer and MPC from Computational CSIDH. IACR Cryptol. ePrint Arch. 2022: 1511 (2022) - [i12]Suvradip Chakraborty, Chaya Ganesh, Pratik Sarkar:
Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge. IACR Cryptol. ePrint Arch. 2022: 1535 (2022) - 2021
- [c10]Navid Alamati, Hart Montgomery, Sikhar Patranabis, Pratik Sarkar:
Two-Round Adaptively Secure MPC from Isogenies, LPN, or CDH. ASIACRYPT (2) 2021: 305-334 - [c9]Suvradip Chakraborty, Chaya Ganesh, Mahak Pancholi
Reverse Firewalls for Adaptively Secure MPC Without Setup. ASIACRYPT (2) 2021: 335-364 - [c8]Kang Yang, Pratik Sarkar, Chenkai Weng
QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field. CCS 2021: 2986-3001 - [i11]Kang Yang, Pratik Sarkar, Chenkai Weng, Xiao Wang:
QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field. IACR Cryptol. ePrint Arch. 2021: 76 (2021) - [i10]Suvradip Chakraborty, Chaya Ganesh, Mahak Pancholi, Pratik Sarkar:
Reverse Firewalls for Adaptively Secure MPC without Setup. IACR Cryptol. ePrint Arch. 2021: 1262 (2021) - 2020
- [c7]Ran Canetti, Pratik Sarkar, Xiao Wang
Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security. ASIACRYPT (3) 2020: 277-308 - [c6]Ran Canetti, Pratik Sarkar, Xiao Wang
Blazing Fast OT for Three-Round UC OT Extension. Public Key Cryptography (2) 2020: 299-327 - [i9]Ran Canetti, Pratik Sarkar, Xiao Wang:
Blazing Fast OT for Three-Round UC OT Extension. IACR Cryptol. ePrint Arch. 2020: 110 (2020) - [i8]Ran Canetti, Pratik Sarkar, Xiao Wang:
Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security. IACR Cryptol. ePrint Arch. 2020: 545 (2020) - [i7]Ran Canetti, Pratik Sarkar, Xiao Wang:
Triply Adaptive UC NIZK. IACR Cryptol. ePrint Arch. 2020: 1212 (2020)
2010 – 2019
- 2019
- [i6]Arpita Patra, Pratik Sarkar, Ajith Suresh:
Fast Actively Secure OT Extension for Short Secrets. CoRR abs/1911.08834 (2019) - 2018
- [c5]Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar:
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits. Public Key Cryptography (2) 2018: 499-529 - [c4]Ashish Choudhury
Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract). SIROCCO 2018: 55-71 - [i5]Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar:
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. IACR Cryptol. ePrint Arch. 2018: 43 (2018) - [i4]Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Crash-tolerant Consensus in Directed Graph Revisited. IACR Cryptol. ePrint Arch. 2018: 436 (2018) - 2017
- [c3]Arpita Patra, Pratik Sarkar, Ajith Suresh:
Fast Actively Secure OT Extension for Short Secrets. NDSS 2017 - [c2]Ashish Choudhury
Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited. DISC 2017: 46:1-46:4 - [i3]Megha Byali, Arpita Patra, Divya Ravi, Pratik Sarkar:
Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security. IACR Cryptol. ePrint Arch. 2017: 1165 (2017) - 2016
- [i2]Arpita Patra, Pratik Sarkar, Ajith Suresh:
Fast Actively Secure OT Extension for Short Secrets. IACR Cryptol. ePrint Arch. 2016: 940 (2016) - 2014
- [c1]Goutam Paul, Pratik Sarkar, Sarbajit Mukherjee:
Towards a More Democratic Mining in Bitcoins. ICISS 2014: 185-203 - 2013
- [i1]Pratik Sarkar:
Multiple-Use Transferable E-Cash. IACR Cryptol. ePrint Arch. 2013: 854 (2013)
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-04 21:09 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: