About
I am a final-year PhD student in the Mathematics Department at MIT, where I am advised by Vinod Vaikuntanathan. I’m interested in theoretical computer science, particularly cryptography and its connections to statistics and trustworthy machine learning. Earlier in my PhD, I was supported by an NSF Graduate Research Fellowship.
Before MIT, I was a software engineer at Google (YouTube). Prior to that, I received a BA in mathematics from Harvard University. As an undergraduate, I attended the DIMACS REU (under Eric Allender’s mentorship) and Ken Ono’s number theory REU (under his and John Duncan’s mentorship). I also interned in industry at Facebook, Jane Street, and most recently at NTT Research.
Recent News
- December 2025: I gave a talk at the UT Austin Theory and AI Alignment group meeting.
- November 2025: I gave a talk at the Columbia Theory Lunch.
- October 2025: I gave talks at the Stanford CS Theory Lunch and the MIT ML+Cryptography Seminar.
Manuscripts
Authors are listed in alphabetical order of last name, as is the convention in my field.
Adaptive Robustness of Hypergrid Johnson-Lindenstrauss
Andrej Bogdanov, Alon Rosen, NV, Vinod Vaikuntanathan
[arXiv] [ePrint]
Publications
Symmetric Perceptrons, Number Partitioning and Lattices
NV, Vinod Vaikuntanathan
STOC 2025
Invited to the SIAM Journal of Computing Special Issue
[arXiv] [ePrint] [ECCC] [Video]
Oblivious Defense in ML Models: Backdoor Removal without Detection
Shafi Goldwasser, Jonathan Shafer, NV, Vinod Vaikuntanathan
STOC 2025 (also appeared at AICrypt 2025)
[Paper]
Post-Quantum PKE from Unstructured Noisy Linear Algebraic Assumptions: Beyond LWE and Alekhnovich’s LPN
Riddhi Ghosal, Aayush Jain, Paul Lou, Amit Sahai, NV
Eurocrypt 2025
[Paper]
The Complexity of Memory Checking with Covert Security
Elette Boyle, Ilan Komargodski, NV
Eurocrypt 2025
[Paper] [Video]
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants
Seyoon Ragavan, NV, Vinod Vaikuntanathan
TCC 2024
[Paper] [Video]
Sparse Linear Regression and Lattice Problems
Aparna Gupte, NV, Vinod Vaikuntanathan
TCC 2024
[Paper]
Memory Checking Requires Logarithmic Overhead
Elette Boyle, Ilan Komargodski, NV
STOC 2024
Journal of the ACM
[ePrint] [ECCC] [JACM] [STOC Video] [CMU Video]
MacORAMa: Optimal Oblivious RAM with Integrity
Surya Mathialagan, NV
Crypto 2023
[Paper]
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures
Aparna Gupte, NV, Vinod Vaikuntanathan
FOCS 2022
[arXiv] [ePrint] [CMU Video] [FOCS Video] [Simons Video]
Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions
Lijie Chen, Shuichi Hirahara, NV
ITCS 2022
[Paper] [Video]
The Non-hardness of Approximating Circuit Size
Eric Allender, Rahul Ilango, NV
CSR 2019
Invited to the Theory of Computing Systems Special Issue
[Paper]
Moonshine for All Finite Groups
Samuel DeHority, Xavier Gonzalez, NV, Roger Van Peski
Research in the Mathematical Sciences
[Paper]