Neekon Vafa

30 papers A* 4A 1Misc 1Journal 19Unranked 5
YearRankTypeTitle / Venue / Authors
2025 J jnl
Adaptive Robustness of Hypergrid Johnson-Lindenstrauss.
CoRR
Andrej Bogdanov, Alon Rosen, Neekon Vafa, Vinod Vaikuntanathan
2025 J jnl
Adaptive Robustness of Hypergrid Johnson-Lindenstrauss.
IACR Cryptol. ePrint Arch.
Andrej Bogdanov, Alon Rosen, Neekon Vafa, Vinod Vaikuntanathan
2025 J jnl
Memory Checking Requires Logarithmic Overhead.
J. ACM
Elette Boyle, Ilan Komargodski, Neekon Vafa
2025 A* conf
Oblivious Defense in ML Models: Backdoor Removal without Detection.
STOC
Shafi Goldwasser, Jonathan Shafer, Neekon Vafa, Vinod Vaikuntanathan
2025 J jnl
Post-Quantum PKE from Unstructured Noisy Linear Algebraic Assumptions: Beyond LWE and Alekhnovich's LPN.
IACR Cryptol. ePrint Arch.
Riddhi Ghosal, Aayush Jain, Paul Lou, Amit Sahai, Neekon Vafa
2025 — conf
Post-quantum PKE from Unstructured Noisy Linear Algebraic Assumptions: Beyond LWE and Alekhnovich's LPN.
EUROCRYPT (2)
Riddhi Ghosal, Aayush Jain, Paul Lou, Amit Sahai, Neekon Vafa
2025 A* conf
Symmetric Perceptrons, Number Partitioning and Lattices.
STOC
Neekon Vafa, Vinod Vaikuntanathan
2025 J jnl
Symmetric Perceptrons, Number Partitioning and Lattices.
CoRR
Neekon Vafa, Vinod Vaikuntanathan
2025 J jnl
Symmetric Perceptrons, Number Partitioning and Lattices.
Electron. Colloquium Comput. Complex.
Neekon Vafa, Vinod Vaikuntanathan
2025 J jnl
Symmetric Perceptrons, Number Partitioning and Lattices.
IACR Cryptol. ePrint Arch.
Neekon Vafa, Vinod Vaikuntanathan
2025 — conf
The Complexity of Memory Checking with Covert Security.
EUROCRYPT (5)
Elette Boyle, Ilan Komargodski, Neekon Vafa
2025 J jnl
The Complexity of Memory Checking with Covert Security.
IACR Cryptol. ePrint Arch.
Elette Boyle, Ilan Komargodski, Neekon Vafa
2024 — conf
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants.
TCC (4)
Seyoon Ragavan, Neekon Vafa, Vinod Vaikuntanathan
2024 J jnl
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants.
IACR Cryptol. ePrint Arch.
Seyoon Ragavan, Neekon Vafa, Vinod Vaikuntanathan
2024 A* conf
Memory Checking Requires Logarithmic Overhead.
STOC
Elette Boyle, Ilan Komargodski, Neekon Vafa
2024 J jnl
Memory Checking Requires Logarithmic Overhead.
Electron. Colloquium Comput. Complex.
Elette Boyle, Ilan Komargodski, Neekon Vafa
2024 J jnl
Memory Checking Requires Logarithmic Overhead.
IACR Cryptol. ePrint Arch.
Elette Boyle, Ilan Komargodski, Neekon Vafa
2024 J jnl
Oblivious Defense in ML Models: Backdoor Removal without Detection.
CoRR
Shafi Goldwasser, Jonathan Shafer, Neekon Vafa, Vinod Vaikuntanathan
2024 — conf
Sparse Linear Regression and Lattice Problems.
TCC (2)
Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan
2024 J jnl
Sparse Linear Regression and Lattice Problems.
CoRR
Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan
2023 — conf
MacORAMa: Optimal Oblivious RAM with Integrity.
CRYPTO (4)
Surya Mathialagan, Neekon Vafa
2023 J jnl
MacORAMa: Optimal Oblivious RAM with Integrity.
IACR Cryptol. ePrint Arch.
Surya Mathialagan, Neekon Vafa
2022 A conf
Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions.
ITCS
Lijie Chen, Shuichi Hirahara, Neekon Vafa
2022 A* conf
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures.
FOCS
Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan
2022 J jnl
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures.
CoRR
Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan
2022 J jnl
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures.
IACR Cryptol. ePrint Arch.
Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan
2021 J jnl
Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions.
Electron. Colloquium Comput. Complex.
Lijie Chen, Shuichi Hirahara, Neekon Vafa
2021 J jnl
The Non-hardness of Approximating Circuit Size.
Theory Comput. Syst.
Eric Allender, Rahul Ilango, Neekon Vafa
2019 Misc conf
The Non-hardness of Approximating Circuit Size.
CSR
Eric Allender, Rahul Ilango, Neekon Vafa
2018 J jnl
The Non-Hardness of Approximating Circuit Size.
Electron. Colloquium Comput. Complex.
Eric Allender, Rahul Ilango, Neekon Vafa