| 2026 | STOC | Adaptive Robustness of Hypergrid Johnson-Lindenstrauss. | Andrej Bogdanov, Alon Rosen, Neekon Vafa, Vinod Vaikuntanathan |
| 2025 | EuroCrypt | The Complexity of Memory Checking with Covert Security. | Elette Boyle, Ilan Komargodski, Neekon Vafa |
| 2025 | EuroCrypt | Post-quantum PKE from Unstructured Noisy Linear Algebraic Assumptions: Beyond LWE and Alekhnovich's LPN. | Riddhi Ghosal, Aayush Jain, Paul Lou, Amit Sahai, Neekon Vafa |
| 2025 | STOC | Oblivious Defense in ML Models: Backdoor Removal without Detection. | Shafi Goldwasser, Jonathan Shafer, Neekon Vafa, Vinod Vaikuntanathan |
| 2025 | STOC | Symmetric Perceptrons, Number Partitioning and Lattices. | Neekon Vafa, Vinod Vaikuntanathan |
| 2024 | STOC | Memory Checking Requires Logarithmic Overhead. | Elette Boyle, Ilan Komargodski, Neekon Vafa |
| 2024 | TCC | Sparse Linear Regression and Lattice Problems. | Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan |
| 2024 | TCC | Indistinguishability Obfuscation from Bilinear Maps and LPN Variants. | Seyoon Ragavan, Neekon Vafa, Vinod Vaikuntanathan |
| 2023 | CRYPTO | MacORAMa: Optimal Oblivious RAM with Integrity. | Surya Mathialagan, Neekon Vafa |
| 2022 | FOCS | Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. | Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan |
| 2019 | CSR | The Non-hardness of Approximating Circuit Size. | Eric Allender, Rahul Ilango, Neekon Vafa |