Neekon Vafa

Orcid: 0000-0002-0555-4200

According to our database1, Neekon Vafa authored at least 8 papers between 2018 and 2024.

Collaborative distances:

Timeline

2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
3
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants.
IACR Cryptol. ePrint Arch., 2024

Memory Checking Requires Logarithmic Overhead.
Electron. Colloquium Comput. Complex., 2024

Oblivious Defense in ML Models: Backdoor Removal without Detection.
CoRR, 2024

Sparse Linear Regression and Lattice Problems.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

2023
MacORAMa: Optimal Oblivious RAM with Integrity.
IACR Cryptol. ePrint Arch., 2023

2022
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures.
IACR Cryptol. ePrint Arch., 2022

2021
Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions.
Electron. Colloquium Comput. Complex., 2021

2018
The Non-Hardness of Approximating Circuit Size.
Electron. Colloquium Comput. Complex., 2018


  Loading...