Follow
Neekon Vafa
Title
Cited by
Cited by
Year
Continuous lwe is as hard as lwe & applications to learning gaussian mixtures
A Gupte, N Vafa, V Vaikuntanathan
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
212022
The non-hardness of approximating circuit size
E Allender, R Ilango, N Vafa
Theory of computing systems 65, 559-578, 2021
152021
Average-case hardness of NP and PH from worst-case fine-grained assumptions
L Chen, S Hirahara, N Vafa
13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022
82022
MacORAMa: Optimal oblivious RAM with integrity
S Mathialagan, N Vafa
Annual International Cryptology Conference, 95-127, 2023
42023
Moonshine for all finite groups
S DeHority, X Gonzalez, N Vafa, R Van Peski
Research in the Mathematical Sciences 5, 1-34, 2018
32018
Sparse Linear Regression and Lattice Problems
A Gupte, N Vafa, V Vaikuntanathan
arXiv preprint arXiv:2402.14645, 2024
2024
Memory Checking Requires Logarithmic Overhead
E Boyle, I Komargodski, N Vafa
Cryptology ePrint Archive, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–7