About
I am a third-year PhD student at MIT, where I am advised by Vinod Vaikuntanathan. I’m interested in theoretical computer science, particularly cryptography and complexity theory. I am 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 and Jane Street.
Here is my CV.
Recent News
- February 2023: I am visiting the Simons Institute for the first month of the Meta-Complexity program. I gave a talk at the Lower Bounds, Learning, and Average-Case Complexity workshop based on previous work with Eric Allender and Rahul Ilango.
- February 2023: I gave talks at the Berkeley Security Seminar and Stanford Security Seminar based on recent joint work with Surya Mathialagan. Previously, I gave a talk at MIT’s Cryptography and Information Security (CIS) Seminar on the same work.
- November 2022: I attended FOCS and gave a talk on joint work with Aparna Gupte and Vinod Vaikuntanathan.
- June 2022: I visited the Simons Institute for the Lattices and Beyond program and gave a talk at the Quantum and Lattices Joint Reunion Workshop.
Publications
MacORAMa: Optimal Oblivious RAM with Integrity
Surya Mathialagan, NV
[Paper]
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures
Aparna Gupte, NV, Vinod Vaikuntanathan
FOCS 2022
[arXiv] [ePrint] [Video (FOCS)] [Video (Simons)]
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 Special Issue of Theory of Computing Systems
[Paper]
Moonshine for All Finite Groups
Samuel DeHority, Xavier Gonzalez, NV, Roger Van Peski
Research in the Mathematical Sciences
[Paper]
Authors are listed in alphabetical order of last name, as is the convention in theoretical computer science and mathematics.