Rahul Ilango
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
- Alex Lombardionce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Beyond P versus NP: Using Complexity Theory in Obfuscation and Vice-Versa | Obfuscation | 2025-06-23 |
Claim: iO plus stronger-than-P≠NP complexity assumptions yields cryptographic objects whose hardness matches naive attacks. Techniques combine… | ||
| Tales of Obfuscation in Bounded Arithmetic, Metacomplexity, and Differential Privacy | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Three concrete results use obfuscation and related primitives to resolve open problems: assuming indistinguishability obfuscation and NP ≠ coNP, there is no… | ||
| Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic | Proof Complexity and Meta-Mathematics 2023 | 2023-03-20 |
Main claim: under two assumptions—NP not in coAM infinitely often and existence of subexponentially secure indistinguishability obfuscation—the theory PV1… | ||
| NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach | Lower Bounds, Learning, and Average-Case Complexity | 2023-02-13 |
Shows NP‑hardness gaps for concrete meta‑complexity problems: under subexponentially‑secure indistinguishability obfuscation/witness encryption the conditional… | ||
| nothing matches | ||