| 2026 | SP | Breaking the Barrier for Asynchronous MPC with a Friend. | Banashri Karmakar, Aniket Kate, Shravani Patil, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi |
| 2025 | ASIACRYPT | Broadcast-Optimal Secure Computation from Black-Box Oblivious Transfer. | Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Yu Xia |
| 2025 | CCS | Separating Broadcast from Cheater Identification. | Yashvanth Kondi, Divya Ravi |
| 2025 | CHI | Exploring Trust and Transparency in Retrieval-Augmented Generation for Domain Experts. | Divya Ravi, Renuka Sindhgatta |
| 2025 | TCC | Deniable Secret Sharing. | Ran Canetti, Ivan Damgrd, Sebastian Kolby, Divya Ravi, Sophia Yakoubov |
| 2025 | TCC | Information-Theoretic Broadcast-Optimal MPC. | Michele Ciampi, Ivan Damgrd, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov |
| 2024 | SP | Asterisk: Super-fast MPC with a Friend. | Banashri Karmakar, Nishat Koti, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi |
| 2024 | TCC | Efficient Secure Communication over Dynamic Incomplete Networks with Minimal Connectivity. | Ivan Damgrd, Divya Ravi, Lawrence Roy, Daniel Tschudi, Sophia Yakoubov |
| 2023 | EuroCrypt | Minimizing Setup in Broadcast-Optimal Two Round MPC. | Ivan Damgrd, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov |
| 2023 | INDOCRYPT | Threshold-Optimal MPC with Friends and Foes. | Nikolas Melissaris, Divya Ravi, Sophia Yakoubov |
| 2023 | TCC | On the Round Complexity of Fully Secure Solitary MPC with Honest Majority. | Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee, Divya Ravi |
| 2023 | TCC | Taming Adaptivity in YOSO Protocols: The Modular Way. | Ran Canetti, Sebastian Kolby, Divya Ravi, Eduardo Soria-Vazquez, Sophia Yakoubov |
| 2023 | TCC | Broadcast-Optimal Four-Round MPC in the Plain Model. | Michele Ciampi, Ivan Damgrd, Divya Ravi, Luisa Siniscalchi, Yu Xia, Sophia Yakoubov |
| 2022 | EuroCrypt | Round-Optimal Multi-party Computation with Identifiable Abort. | Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner |
| 2022 | PKC | On the Bottleneck Complexity of MPC with Correlated Randomness. | Claudio Orlandi, Divya Ravi, Peter Scholl |
| 2022 | TCC | Fully-Secure MPC with Minimal Trust. | Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan |
| 2021 | CRYPTO | Broadcast-Optimal Two Round MPC with an Honest Majority. | Ivan Damgrd, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov |
| 2021 | TCC | Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries. | Ivan Damgrd, Daniel Escudero, Divya Ravi |
| 2020 | ASIACRYPT | On the Exact Round Complexity of Best-of-Both-Worlds Multi-party Computation. | Arpita Patra, Divya Ravi, Swati Singla |
| 2019 | ASIACRYPT | Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. | Arpita Patra, Divya Ravi |
| 2018 | CCS | Fast Secure Computation for Small Population over the Internet. | Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi |
| 2018 | CRYPTO | On the Exact Round Complexity of Secure Three-Party Computation. | Arpita Patra, Divya Ravi |
| 2018 | SIROCCO | Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract). | Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar |