| 2025 | FOCS | NP-hardness of the Minimum Circuit Size Problem from Well-Studied Assumptions. | Shuichi Hirahara, Rahul Ilango |
| 2025 | FOCS | Gdel in Cryptography: Effectively Zero-Knowledge Proofs for NP with No Interaction, No Setup, and Perfect Soundness. | Rahul Ilango |
| 2025 | FOCS | Cryptography Meets Worst-case Complexity: Optimal Security and More From iO and Worst-case Assumptions. | Rahul Ilango, Alex Lombardi |
| 2024 | STOC | Beating Brute Force for Compression Problems. | Shuichi Hirahara, Rahul Ilango, R. Ryan Williams |
| 2023 | FOCS | Towards Separating Computational and Statistical Differential Privacy. | Badih Ghazi, Rahul Ilango, Pritish Kamath, Ravi Kumar, Pasin Manurangsi |
| 2023 | FOCS | SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle. | Rahul Ilango |
| 2023 | STOC | A Duality between One-Way Functions and Average-Case Symmetry of Information. | Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira |
| 2023 | STOC | NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. | Yizhi Huang, Rahul Ilango, Hanlin Ren |
| 2023 | STOC | Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. | Rahul Ilango, Jiatu Li, R. Ryan Williams |
| 2022 | STOC | Robustness of average-case meta-complexity via pseudorandomness. | Rahul Ilango, Hanlin Ren, Rahul Santhanam |
| 2021 | FOCS | The Minimum Formula Size Problem is (ETH) Hard. | Rahul Ilango |
| 2020 | FOCS | Constant Depth Formula and Partial Function Versions of MCSP are Hard. | Rahul Ilango |
| 2019 | CSR | The Non-hardness of Approximating Circuit Size. | Eric Allender, Rahul Ilango, Neekon Vafa |
| 2019 | ICALP | AC | Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal |