Neekon Vafa

According to our database, Neekon Vafa authored at least 12 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Adaptive Robustness of Hypergrid Johnson-Lindenstrauss.

Andrej Bogdanov, Alon Rosen, Neekon Vafa, Vinod Vaikuntanathan

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025

Symmetric Perceptrons, Number Partitioning and Lattices.

Neekon Vafa, Vinod Vaikuntanathan

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Oblivious Defense in ML Models: Backdoor Removal without Detection.

Shafi Goldwasser, Jonathan Shafer, Neekon Vafa, Vinod Vaikuntanathan

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 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

Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

The Complexity of Memory Checking with Covert Security.

Elette Boyle, Ilan Komargodski, Neekon Vafa

Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024

Indistinguishability Obfuscation from Bilinear Maps and LPN Variants.

Seyoon Ragavan, Neekon Vafa, Vinod Vaikuntanathan

Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Sparse Linear Regression and Lattice Problems.

Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan

Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Memory Checking Requires Logarithmic Overhead.

Elette Boyle, Ilan Komargodski, Neekon Vafa

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023

MacORAMa: Optimal Oblivious RAM with Integrity.

Surya Mathialagan, Neekon Vafa

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022

Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions.

Lijie Chen, Shuichi Hirahara, Neekon Vafa

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures.

Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2019

The Non-hardness of Approximating Circuit Size.

Eric Allender, Rahul Ilango, Neekon Vafa

Proceedings of the Computer Science - Theory and Applications, 2019