
Research
Design and Analysis of Privacy Preserving Cryptographic Protocols for Blockchain based Decentralized Systems
Web3 applications built on blockchains often require randomness that is fair, unpredictable, and can be publicly verified. In Web3 gaming applications, the ability to provide publicly verifiable and unbiased randomness is a critical feature, enhancing user trust and platform credibility—particularly in mechanisms such as random reward distribution, outcome generation—thereby serving as a compelling factor in user acquisition and retention. With the rapid expansion of blockchain technology and Web3 applications—particularly in domains like decentralized finance (DeFi) and GameFi the demand for reliable, unbiased, and verifiable sources of randomness has grown substantially. Verifiable Random Function (VRF) protocols inherently satisfy these requirements, and their adoption has seen significant growth across various decentralized applications, reflecting the increasing demand for trustless and verifiable randomness. VRFs are cryptographic primitives that produce outputs that are both random-looking and verifiably correct. Zero-knowledge proofs (ZKP) and secure multiparty computation (MPC) are fundamental components of privacy-preserving encryption, and MPC has several uses in decentralised blockchain systems. ZKP enables blockchain projects to facilitate greater transaction throughput, protect user data while still being able to verify identities, and support complex computation, while also allowing enterprises to adopt blockchain technology while protecting their intellectual property. Zero knowledge succinct non-interactive argument of knowledge (zkSNARK) is a potent cryptographic primitive that allows a prover to produce short proofs that convince a verifier of the knowledge of a witness attesting the validity of an NP relation, without revealing any extra information about the underlying witness. zkSNARK has broad applications in various scenarios, such as blockchain and verifiable machine learning. ZKPs are commonly used in VRF constructions to enable secure and efficient proof generation. Furthermore, MPC techniques have been applied to design distributed VRF protocols, allowing multiple parties to jointly compute verifiable random outputs without relying on a single trusted entity.


Internship/ Project Work
The Study of Scalable, Transparent Argument Systems (2022 -2023)
Supervisor : Prof. Ratna Dutta
Description : In this project, we studied Fast Reed Solomon IOP of Proximity(FRI), some arithmetizations and algebraic reduction, construction of Scalable Transparent IOP of Knowledge(STIK), Scalable Transparent Argument of Knowledge(STARK) as a realization STIK and corresponding zero knowledge versions zkSTIK and zkSTARK. Finally we came up with the Implementation of a STARK proof in C language.
The Study of Transparent zkSNARK for R1CS (2022)
Supervisor : Prof. Ratna Dutta
Description : In this project studied Interactive Oracle Proof(IOP), Rank-1 Constraint Satisfaction, Merkle Tree and learned construction of RS encoded IOP for Lincheck, Rowcheck and Univariate Sumcheck Problem, Conversion of a RS encoded IOP to an arbitrary IOP and IOP for R1CS, Aurora zkSNARK for R1CS. We implemented merkle tree using the hash function SHAKE-256.
The Study of Algebraic Number Theory (2020 - 2021)
Supervisor : Prof. Balesh Kumar
Description : In this project, we learned two algorithms to compute fundamental units. Studied Dirichlet Unit Theorem and its application, Riemann Zeta Functions, Dedekind Zeta Functions, Dirichlet L-function and Dirichlet Class Number Formula.