Neekon Vafa
where else to find them
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
- Lijie Chenonce
- Shuichi Hiraharaonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Indistinguishability Obfuscation from Bilinear Maps and LPN Variants | Obfuscation | 2025-06-23 |
Constructs indistinguishability obfuscation from three assumptions: bilinear maps, large-field LPN, and a new local functions with noise (LFN) assumption that… | ||
| How to Cheat at “Who Wants to Be a Millionaire?” (and Show Non-Hardness of GapMCSP) | Lower Bounds, Learning, and Average-Case Complexity | 2023-02-13 |
Shows a concrete combinatorial scheme: split p pages into blocks of r/2, assign one friend to each pair-of-chapters construction (friend reads union of two… | ||
| Continuous LWE is as Hard as LWE | Quantum and Lattices Joint Reunion Workshop | 2022-06-13 |
Claim: continuous LWE (CLWE) is as hard as standard LWE via a classical reduction. Proof path: use LWE leakage-resilience to convert to binary sparse secrets… | ||
| Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions | ITCS 2022 | 2022-01-31 |
Proves concrete average-case hardness from weaker worst-case fine‑grained assumptions: improving on Hirahara’s 2^{O(N/log N)} threshold, the paper shows that… | ||
| nothing matches | ||