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 | 25 | 2022 |
The non-hardness of approximating circuit size E Allender, R Ilango, N Vafa Theory of computing systems 65, 559-578, 2021 | 17 | 2021 |
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 | 8 | 2022 |
MacORAMa: Optimal oblivious RAM with integrity S Mathialagan, N Vafa Annual International Cryptology Conference, 95-127, 2023 | 4 | 2023 |
Moonshine for all finite groups S DeHority, X Gonzalez, N Vafa, R Van Peski Research in the Mathematical Sciences 5, 1-34, 2018 | 3 | 2018 |
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants S Ragavan, N Vafa, V Vaikuntanathan Cryptology ePrint Archive, 2024 | 1 | 2024 |
Memory Checking Requires Logarithmic Overhead E Boyle, I Komargodski, N Vafa Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1712-1723, 2024 | | 2024 |
Sparse Linear Regression and Lattice Problems A Gupte, N Vafa, V Vaikuntanathan arXiv preprint arXiv:2402.14645, 2024 | | 2024 |