About
Dr. Sarkar is a Research Scientist in the Cryptography team of Supra Research. Previously, he completed his PhD (2018-23) in Computer Science from Boston University under the supervision of Prof. Ran Canetti, specializing in Secure Computation and Zero-Knowledge. He has previously interned as a Research Scientist intern with the Advanced Cryptography team at VISA Research, where he worked on fundamental questions in post-quantum. He has also interned as a Research Engineer with the Statistics and Privacy team at Meta, where he worked privacy-preserving advertisement technologies.
Prior to embarking on the Ph.D. journey, he completed his Master's degree (2015-18) at the Department of Computer Science at the Indian Institute of Science in Bangalore, under the supervision of Dr. Arpita Patra in the Cryptography and Information Security Lab. He has also received his Bachelor's in Computer Science from IIEST, Shibpur (2011-15).
Interests and expertise
Dr. Sarkar's primary focus is on creating privacy-preserving solutions with high levels of assurance, which can be proven through formal security models and various cryptographic techniques. These techniques may include Secure Computation and Zero-Knowledge, among others.
At Supra, he is working on improving the state-of-the-art primitives used in the blockchain space, mainly Verifiable Randomness Services, Threshold Cryptosystems and Zero-Knowledge.
Recently, he has been also been intrigued by the potential of Applied Cryptography to utilize statistical analysis on client data without compromising their privacy.
Commentary
Secure Computation is a powerful tool that enables mutually distrusting parties to compute a joint function on their private inputs, without compromising the secrecy of their inputs. This enables different applications like privacy-preserving machine learning, private-data sharing among hospitals, private measurement of advertisement effectiveness, etc.
However, general secure computation is expensive in terms of communication and computation. His research focuses on building customized secure computation protocols for different real-world use-cases that are faster in practice.
Selected research publications
Visit the Research Center for more
2025
VRaaS: Verifiable Randomness as a Service on Blockchains.
with Dr. Aniket Kate, Jacob Gorman, Lucjan Hanzlik, Dr. Easwar Vivek Mangipudi, Dr. Pratyay Mukherjee and Sri Aravinda Krishnan Thyagarajan • 38th IEEE Computer Security Foundations Symposium, 2025
Dyna-hinTS: Silent Threshold Signatures for Dynamic Committees
with Dr. Aniket Kate, Samipa Samanta and Dr. Pratyay Mukherjee • 7th Crypto Valley Conference, 2025
Mastic: Private Weighted Heavy-Hitters and Attribute-Based Metrics
with Dimitris Mouris, Christopher Patton, Hannah Davis and Nektarios G. Tsoutsos • Privacy Enhancing Technologies (PoPETs) 2025
Universally Composable Non-Interactive Zero-Knowledge from Sigma Protocols via a New Straight-line Compiler
with Megan Chen, Pousali Dey, Chaya Ganesh, Dr. Pratyay Mukherjee and Swagata Sasmal • Public Key Cryptography, 2025
2024
KeyClub and RandRec: Two New Social Key Recovery Schemes
with Dr. Aniket Kate, Dr. Pratyay Mukherjee, Bhaskar Roberts, Hamza Saleem
2023
Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge
with Suvradip Chakraborty, Chaya Ganesh • Eurocrypt 2023
Round-Optimal Oblivious Transfer and MPC from Computational CSIDH
with Saikrishna Badrinarayanan, Daniel Masny, Dr. Pratyay Mukherjee, Sikhar Patranabis, Srinivasan Raghuraman • PKC 2023
PLASMA: Private, Lightweight Aggregated Statistics against Malicious Adversaries with Full Security
with Dimitris Mouris, Nektarios Georgios Tsoutsos
2022
Triply Adaptive UC NIZK
with Ran Canetti, Xiao Wang • Asiacrypt 2022
Statistical Security in Two-Party Computation Revisited
with Saikrishna Badrinarayanan, Sikhar Patranabis • TCC 2022
2021
Reverse Firewalls for Adaptively Secure MPC without Setup
with Suvradip Chakraborty, Chaya Ganesh, Mahak Pancholi • Asiacrypt 2021
Two-Round Adaptively Secure MPC from Isogenies, LPN, or CDH
with Navid Alamati, Hart Montgomery, Sikhar Patranabis • Asiacrypt 2021
Quicksilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field
with Kang Yang, Chenkai Weng and Xiao Wang • ACM CCS 2021 (Best Paper Runner-Up)
2020
Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security
with Ran Canetti, Xiao Wang • Asiacrypt 2020
Blazing Fast OT for Three-Round UC OT Extension
Ran Canetti, Xiao Wang • PKC 2020






