The Non-Hardness of Approximating Circuit Size. - Eric Allender; Rahul Ilango; Neekon Vafa (Electron. Colloquium Comput. Complex., 2018)

Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions. - Lijie Chen 001; Shuichi Hirahara; Neekon Vafa (Electron. Colloquium Comput. Complex., 2021)

Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. - Aparna Gupte; Neekon Vafa; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2022)

MacORAMa: Optimal Oblivious RAM with Integrity. - Surya Mathialagan; Neekon Vafa (IACR Cryptol. ePrint Arch., 2023)

Sparse Linear Regression and Lattice Problems. - Aparna Gupte; Neekon Vafa; Vinod Vaikuntanathan (TCC (2), 2024)

Memory Checking Requires Logarithmic Overhead. - Elette Boyle; Ilan Komargodski; Neekon Vafa (Electron. Colloquium Comput. Complex., 2024)

Indistinguishability Obfuscation from Bilinear Maps and LPN Variants. - Seyoon Ragavan; Neekon Vafa; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2024)

Oblivious Defense in ML Models: Backdoor Removal without Detection. - Shafi Goldwasser; Jonathan Shafer; Neekon Vafa; Vinod Vaikuntanathan (STOC, 2025)

Symmetric Perceptrons, Number Partitioning and Lattices. - Neekon Vafa; Vinod Vaikuntanathan (Electron. Colloquium Comput. Complex., 2025)

Adaptive Robustness of Hypergrid Johnson-Lindenstrauss. - Andrej Bogdanov; Alon Rosen; Neekon Vafa; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2025)

The Complexity of Memory Checking with Covert Security. - Elette Boyle; Ilan Komargodski; Neekon Vafa (IACR Cryptol. ePrint Arch., 2025)

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 (IACR Cryptol. ePrint Arch., 2025)