Neekon Vafa

MaRDI QIDQ2043878zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The complexity of memory checking with covert security	2025-12-02	Paper
Post-quantum PKE from unstructured noisy linear algebraic assumptions: beyond LWE and Alekhnovich's LPN	2025-11-20	Paper
Continuous LWE is as hard as LWE \& applications to learning Gaussian mixtures	2025-08-15	Paper
Sparse linear regression and lattice problems	2025-07-25	Paper
Indistinguishability obfuscation from bilinear maps and LPN variants	2025-07-23	Paper
Memory checking requires logarithmic overhead Journal of the ACM	2025-06-27	Paper
scientific article; zbMATH DE number 7829277 (Why is no real title available?)	2024-04-09	Paper
\textsf{MacORAMa}: optimal oblivious RAM with integrity Advances in Cryptology – CRYPTO 2023	2024-02-06	Paper
The non-hardness of approximating circuit size Theory of Computing Systems	2021-08-03	Paper
The non-hardness of approximating circuit size Computer Science – Theory and Applications	2019-10-22	Paper
Moonshine for all finite groups Research in the Mathematical Sciences	2019-08-20	Paper

Research outcomes over time

This page was built for person: Neekon Vafa