Neekon Vafa

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 15

Top Topics

Storage Overhead

Gaussian Mixture

Memory Footprint

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

Theory Comput. Syst.

Publications

Elette Boyle, Ilan Komargodski, Neekon Vafa
Memory Checking Requires Logarithmic Overhead. IACR Cryptol. ePrint Arch. 2024 (2024)
Elette Boyle, Ilan Komargodski, Neekon Vafa
Memory Checking Requires Logarithmic Overhead. STOC (2024)
Seyoon Ragavan, Neekon Vafa, Vinod Vaikuntanathan
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants. IACR Cryptol. ePrint Arch. 2024 (2024)
Elette Boyle, Ilan Komargodski, Neekon Vafa
Memory Checking Requires Logarithmic Overhead. Electron. Colloquium Comput. Complex. (2024)
Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan
Sparse Linear Regression and Lattice Problems. CoRR (2024)
Surya Mathialagan, Neekon Vafa
MacORAMa: Optimal Oblivious RAM with Integrity. IACR Cryptol. ePrint Arch. 2023 (2023)
Surya Mathialagan, Neekon Vafa
MacORAMa: Optimal Oblivious RAM with Integrity. CRYPTO (4) (2023)
Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. FOCS (2022)
Lijie Chen, Shuichi Hirahara, Neekon Vafa
Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions. ITCS (2022)
Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. IACR Cryptol. ePrint Arch. 2022 (2022)
Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. CoRR (2022)
Eric Allender, Rahul Ilango, Neekon Vafa
The Non-hardness of Approximating Circuit Size. Theory Comput. Syst. 65 (3) (2021)
Lijie Chen, Shuichi Hirahara, Neekon Vafa
Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions. Electron. Colloquium Comput. Complex. 28 (2021)
Eric Allender, Rahul Ilango, Neekon Vafa
The Non-hardness of Approximating Circuit Size. CSR (2019)
Eric Allender, Rahul Ilango, Neekon Vafa
The Non-Hardness of Approximating Circuit Size. Electron. Colloquium Comput. Complex. 25 (2018)