| 2026 | PKC | Conditionally Linkable Attribute-Based Signatures. | Minh Pham, Khoa Nguyen, Slim Bettaieb, Mukul Kulkarni, Willy Susilo |
| 2024 | ASIACRYPT | Don't Use it Twice! Solving Relaxed Linear Equivalence Problems. | Alessandro Budroni, Jess-Javier Chi-Domnguez, Giuseppe D'Alconzo, Antonio Jos Di Scala, Mukul Kulkarni |
| 2024 | PQCrypto | Properties of Lattice Isomorphism as a Cryptographic Group Action. | Benjamin Bencina, Alessandro Budroni, Jess-Javier Chi-Domnguez, Mukul Kulkarni |
| 2022 | ISIT | Quasi-Cyclic Stern Proof of Knowledge. | Loc Bidoux, Philippe Gaborit, Mukul Kulkarni, Nicolas Sendrier |
| 2020 | CRYPTO | New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust. | Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni |
| 2019 | EuroCrypt | Non-Malleable Codes Against Bounded Polynomial Time Tampering. | Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin |
| 2019 | PKC | Upper and Lower Bounds for Continuous Non-Malleable Codes. | Dana Dachman-Soled, Mukul Kulkarni |
| 2018 | EuroCrypt | Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering. | Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin |
| 2018 | PKC | Local Non-malleable Codes in the Bounded Retrieval Model. | Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi |
| 2017 | PKC | Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes. | Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi |
| 2016 | EuroCrypt | Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits. | Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin |
| 2016 | OOPSLA | Helping Johnny encrypt: toward semantic interfaces for cryptographic frameworks. | Soumya Indela, Mukul Kulkarni, Kartik Nayak, Tudor Dumitras |