I am mainly interested in the algebraic and complexity-theoretic foundations of cryptographic protocols. At the moment, I am thinking about PCFs for VOLE from DCR-like assumptions, and investigating the feasibility of building polynomial iO using proof complexity techniques.

Manuscripts

ATAVISM: Private Originator Tracing in End-to-End Encrypted Messaging

Archisman Dutta, Debayan Gupta, Arup Mondal

In submission · 2025

ATAVISM studies private originator tracing for end-to-end encrypted messaging. The protocol aims to identify the originator of a reported forwarding chain while preserving the privacy of intermediate parties and retaining the essential privacy guarantees of end-to-end encryption. The work formalizes the tracing problem, compares against existing approaches, and includes an implementation and benchmark evaluation.

Talks and material

  1. Private Originator Tracing in End-to-End Encrypted Messaging Aarhus Crypto Seminar · Jun 2025 slides
  2. Time-Lock Puzzles and Verifiable Delay Functions Trust Lab student seminar · Oct 2024 slides
  3. Fully Homomorphic Encryption Lab ACM India summer school on theoretical foundations of cryptography · Jun 2024 slides