Pratik Sarkar

Research Interests

I work as a researcher in Cryptography and Information Security, focusing on developing Privacy-Preserving solutions to different problems using cryptographic tools such as Multiparty Computation (MPC), Zero Knowledge (ZK) proofs, and other primitives. During my internship with the VISA Research team, I contributed to the isogeny-based Post-Quantum secure cryptographic solutions. I have also worked in Privacy-Preserving Machine Learning and conducting statistical analysis on client data while maintaining their privacy.

Currently, I am a Research Scientist at SupraOracles, working in the Cryptography team. Here, I have contributed to advancements in distributed randomness services, developed thresholdized Post-Quantum MPC over blockchains, and designed community-based Key Recovery mechanisms for Web3 wallets. Some of these works are publicly available and can be found in the Publications section.

Contact

• Email ID: iampratiksarkar at gmail dot com

• Linkedin ID: iampratiksarkar

News

• August 2025: I am serving on the program committee of USENIX Security 2026

• May 2025: I am serving on the program committee of PETS 2026

• April 2025: I am serving on the program committee of IEEE S&P 2026

• April 2025: Our work VRaaS got accepted in CSF'25

• April 2025: Our work Dyna-hints got accepted in CVC'25

• March 2025: Our work Quicksilver is used in Primus Labs and TLSNotary

• February 2025: Our work on straightline extractable NIZK got accepted in PKC'25

• September 2024: Presented InstaRand at the Decompute'24 conference, an event affiliated with TOKEN2049 

• August 2024: Mastic got accepted in PETS'25 

• July 2024: CompactTag got accepted in PETS'24 as a poster

• June 2024: I gave a talk on InstaRand at the Web3 randomness workshop organized by Supra

• May 2024: I am serving on the program committee of IEEE S&P 2025 

• February 2024: Our work Mastic (follow-up to PLASMA) on Privacy-Preserving Data and Attribute-Based Aggregation is available on Eprint and the corresponding VDAF draft is available on IETF 

• February 2024: Our work PLASMA on Privacy-Preserving Data Aggregation got accepted at PETS'24

• November 2023: Our joint work, CompactTag for Privacy-Preserving Neural Networks, is available on Eprint  

• October 2023: Dimitris presented our new IETF draft Mastic for Secure Data Aggregation at the IETF meeting

• October 2023: Uploaded the first draft of Verifiable Distributed Aggregatable Functions (Mastic) on IETF

• September 2023: Joined Supra Research as a Research Scientist, Cryptography

• August 2023: Graduated from Boston University with a PhD in Computer Science

• June 2023: Defended my PhD thesis

• May 2023: Presented my VISA Research internship work on Post-Quantum Secure Computation from Isogenies at PKC'23

• April 2023: Presented PLASMA in the poster session of the RSA conference as an RSA Security Scholar

• April 2023: Chaya Ganesh presented our joint work on Reverse Firewalls at Eurocrypt'23

• March 2023: Dimitris Mouris presented our joint work PLASMA at the Internet Engineering Task Force (IETF) meeting

• February 2023: Our work on Reverse Firewalls got accepted at Eurocrypt'23

• February 2023: Our work on Post-Quantum Secure Computation from Isogenies got accepted at PKC'23

• January 2023: Our work PLASMA on Private Statistics is published on Eprint

• December 2022: Presented Triply Adaptive UC-NIZK at Asiacrypt'22

• November 2022: Presented Statistical Security in Two-Party Computation Revisited at TCC'22.

• October 2022: Selected as RSA Conference Security Scholar in area of Cryptography and Security

• October 2022: Completed my Summer internship at Meta

• May 2022: Started my Summer internship at the Statistics and Privacy team, Meta

Awards and Achievements

• RSA Conference (2023) Security Scholar 

• PhD is funded by the DARPA SIEVE program and NSF grants

• Finalist for Facebook PhD Fellowship 2022 in Security and Privacy

• CCS'21 Best Paper Runner-up

• Recipient of Boston University PhD Chair Fellowship

• Received Grant for Masters project titled Computing on private data in high latency networks from Robert Bosch Centre for Cyber-Physical Systems, IISc Bangalore.

Publications

My updated list of works can be found below. They can also be found on dblp and google scholar. 

(Author names are arranged in alphabetical order since the area of cryptography follows the mathematical tradition of alphabetizing author lists) 

2025

1. 1. 1. VRaaS: Verifiable Randomness as a Service on Blockchains. Jacob Gorman, Lucjan Hanzlik, Aniket Kate, Easwar Vivek Mangipudi, Pratyay Mukherjee, Pratik Sarkar, Sri AravindaKrishnan Thyagarajan, CSF 2025, Full Version

      2. Dyna-hinTS: Silent Threshold Signatures for Dynamic Committees. Aniket Kate, Pratyay Mukherjee, Samipa Samanta, Pratik Sarkar, CVC 2025, Full Version 

      3. Mastic: Private Weighted Heavy-Hitters and Attribute-Based Metrics. Dimitris Mouris, Christopher Patton, Hannah Davis, Pratik Sarkar, Nektarios Georgios Tsoutsos, PETS 2025, Full Version

      4. Universally Composable Non-Interactive Zero-Knowledge from Sigma Protocols via a New Straight-line Compiler. Megan Chen, Pousali Dey, Chaya Ganesh, Pratyay Mukherjee, Pratik Sarkar, Swagata Sasmal, PKC 2025, Full Version

      5. ANARKey: A New Approach to (Socially) Recover Keys. Aniket Kate, Pratyay Mukherjee, Hamza Saleem, Pratik Sarkar, Bhaskar Roberts, Full Version 

      6. InstaRand: Instantly Available and Instantly Verifiable On-chain Randomness. Jacob Gorman, Lucjan Hanzlik, Aniket Kate, Pratyay Mukherjee, Pratik Sarkar, Sri AravindaKrishnan Thyagarajan, Full Version

2024

1. 1. 7. PLASMA: Private, Lightweight Aggregated Statistics against Malicious Adversaries. Dimitris Mouris, Pratik Sarkar, Nektarios Georgios Tsoutsos, PETS 2024, Full Version

      8. CompactTag: Minimizing Computation Overheads in Actively-Secure MPC for Deep Neural Networks. Yongqin Wang, Pratik Sarkar, Nishat Koti, Arpita Patra, Murali Annavaram, PETS 2024 (Poster), Full Version

2023

1. 1. 9. Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge. Suvradip Chakraborty, Chaya Ganesh, Pratik Sarkar, Eurocrypt 2023, Full Version

      10. Round-Optimal Oblivious Transfer and MPC from Computational CSIDH. Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee, Sikhar Patranabis, Srinivasan Raghuraman, Pratik Sarkar, PKC 2023, Full Version

2022

1. 1. 11. Triply Adaptive UC NIZK. Ran Canetti, Pratik Sarkar and Xiao Wang, Asiacrypt 2022, Full Version

      12. Statistical Security in Two-Party Computation Revisited. Saikrishna Badrinarayanan, Sikhar Patranabis and Pratik Sarkar, TCC 2022, Full Version

2021

1. 1. 13. Reverse Firewalls for Adaptively Secure MPC without Setup. Suvradip Chakraborty, Chaya Ganesh, Mahak Pancholi and Pratik Sarkar, Asiacrypt 2021, Full Version

      14. Two-Round Adaptively Secure MPC from Isogenies, LPN, or CDH. Navid Alamati, Hart Montgomery, Sikhar Patranabis and Pratik Sarkar, Asiacrypt 2021, Full Version

      15.  Quicksilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field. Kang Yang, Pratik Sarkar, Chenkai Weng and Xiao Wang, CCS 2021 (Best Paper Runner-Up), Full Version (Used in production by Primus Labs and TLSNotary)

2020

1. 1. 16. Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security. Ran Canetti, Pratik Sarkar and Xiao Wang, Asiacrypt 2020,  Full Version

      17. Blazing Fast OT for Three-Round UC OT Extension. Ran Canetti, Pratik Sarkar and Xiao Wang, PKC 2020, Full Version

2018

1. 1. 18. Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. Chaya Ganesh, Yashvanth Kondi, Arpita Patra and Pratik Sarkar, PKC 2018, Full Version

      19. Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract).  Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar, SIROCCO  2018, Full Version

2017

1. 1. 20. Fast Actively Secure OT Extension for Short Secrets. Arpita Patra, Pratik Sarkar, Ajith Suresh, NDSS 2017, Full Version

      21. Crash-Tolerant Consensus in Directed Graph Revisited. Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar, Brief Announcement, DISC 2017, Full Version

      22. Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security.  Megha Byali, Arpita Patra, Divya Ravi and Pratik Sarkar, Full Version

Teaching

• Spring 2021: CS 538 Fundamentals of Cryptography

• Fall 2019: CS 538 Fundamentals of Cryptography

• Fall 2018: CS 538 Fundamentals of Cryptography

Supervision

I mentored the following interns:

• Riddhi Ghoshal, PhD UCLA (supervising in Summer 2025)

• Bhaskar Roberts, PhD UC Berkeley (supervised in Summer 2024)

• Samipa Samanta, PhD IIT Bombay (supervised in Nov 2023-Dec 2024)

Activities

• Program Committee Participation: IEEE S&P 2025-2026, PETS 2026, USENIX Security 2026, Journal of Cryptology

• External Reviewer for Asiacrypt 2017-2022, Public Key Cryptography 2017-2018, Eurocrypt 2018, Crypto 2019-2023, IEEE S&P 2020, 23-24, Asiacrypt 2020, Indocrypt 2020, Eurocrypt 2020-2024, STOC 2020, TCC 2019-2023, Journal of Cryptology, CCS 2021.

• Member of Cryptology Research Society of India

• Member of IACR (International Association for Cryptologic Research)

• Presented papers in Asiacrypt 2020-22, PKC 2020, ICISS 2014, TCC 2022