About Me
Hi! I am Surya, I am broadly interested in theoretical computer science, with a recent focus in theoretical cryptography.
I completed my PhD in the MIT Theory group where I was extremely fortunate to be advised by Vinod Vaikuntanathan and Virginia Vassilevska Williams. After that, I was a Research Fellow at Simons Institute in UC Berkeley in Summer 2025. I did my undergraduate at Caltech. Then, I started my postdoc at NTT Research (CIS Lab) with Abhishek Jain.
In my free time, I enjoy art, dancing, and playing music.
surya {dot} mathialagan {at} gmail {dot} com
Publications
In all of the works, authors are ordered alphabetically by last name as is the norm in both mathematics and theoretical computer science.Overcoming Padding in Cryptography via the Hardness of Certifying Random Strings
FOCS 2026
Incrementally Verifiable Computation without Extraction
Crypto 2026
Incrementally Verifiable Computation for NP from Standard Assumptions
Crypto 2025
Simple and General Counterexamples for Private-Coin Evasive LWE
Crypto 2025
Universal SNARGs for NP from Proofs of Correctness
STOC 2025
Towards Optimal Output-Sensitive Clique Listing
or: Listing Cliques from Smaller Cliques
STOC 2024
Memory Checking for Parallel RAMs
TCC 2023
Best Young Researcher Award, Invited to Journal of Cryptology
MacORAMa: Optimal Oblivious RAM with Integrity
Crypto 2023
Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds
ICALP 2022
On Bipartite Distinct Distances in the Plane
The Electronic Journal of Combinatorics, Volume 28, Issue 4, 2022