Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network. - Ashish Choudhury; Arpita Patra; Divya Ravi 001 (ICITS, 2017)

Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited. - Ashish Choudhury; Gayathri Garimella; Arpita Patra; Divya Ravi 001; Pratik Sarkar (DISC, 2017)

Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security. - Megha Byali; Arpita Patra; Divya Ravi 001; Pratik Sarkar (IACR Cryptol. ePrint Arch., 2017)

Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network. - Ashish Choudhury; Arpita Patra; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2017)

Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract). - Ashish Choudhury; Gayathri Garimella; Arpita Patra; Divya Ravi 001; Pratik Sarkar (SIROCCO, 2018)

Fast Secure Computation for Small Population over the Internet. - Megha Byali; Arun Joseph; Arpita Patra; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2018)

Crash-tolerant Consensus in Directed Graph Revisited. - Ashish Choudhury; Gayathri Garimella; Arpita Patra; Divya Ravi 001; Pratik Sarkar (IACR Cryptol. ePrint Arch., 2018)

On the Power of Hybrid Networks in Multi-Party Computation. - Arpita Patra; Divya Ravi 001 (IEEE Trans. Inf. Theory, 2018)

Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. - Arpita Patra; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2019)

On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation. - Arpita Patra; Divya Ravi 001; Swati Singla (IACR Cryptol. ePrint Arch., 2020)

Broadcast-Optimal Two Round MPC with an Honest Majority. - Ivan Damgård; Bernardo Magri; Divya Ravi 001; Luisa Siniscalchi; Sophia Yakoubov (CRYPTO (2), 2021)

On the Round Complexity of Fully Secure Solitary MPC with Honest Majority. - Saikrishna Badrinarayanan; Peihan Miao 001; Pratyay Mukherjee; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2021)

Information-Theoretically Secure MPC against Mixed Dynamic Adversaries. - Ivan Damgård; Daniel Escudero 001; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2021)

On the Bottleneck Complexity of MPC with Correlated Randomness. - Claudio Orlandi; Divya Ravi 001; Peter Scholl (IACR Cryptol. ePrint Arch., 2021)

On the Exact Round Complexity of Secure Three-Party Computation. - Arpita Patra; Divya Ravi 001 (J. Cryptol., 2021)

Round-Optimal Multi-Party Computation with Identifiable Abort. - Michele Ciampi; Divya Ravi 001; Luisa Siniscalchi; Hendrik Waldner (IACR Cryptol. ePrint Arch., 2022)

Minimizing Setup in Broadcast-Optimal Two Round MPC. - Ivan Damgård; Divya Ravi 001; Luisa Siniscalchi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2022)

Fully-Secure MPC with Minimal Trust. - Yuval Ishai; Arpita Patra; Sikhar Patranabis; Divya Ravi 001; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2022)

Towards Efficient YOSO MPC Without Setup. - Sebastian Kolby; Divya Ravi 001; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2022)

Threshold-Optimal MPC With Friends and Foes. - Nikolas Melissaris; Divya Ravi 001; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2022)

Taming Adaptivity in YOSO Protocols: The Modular Way. - Ran Canetti; Sebastian Kolby; Divya Ravi 001; Eduardo Soria-Vazquez; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2023)

Broadcast-Optimal Four-Round MPC in the Plain Model. - Michele Ciampi; Ivan Damgård; Divya Ravi 001; Luisa Siniscalchi; Yu Xia 008; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2023)

Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels. - Ivan Damgård; Divya Ravi 001; Luisa Siniscalchi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2023)

Secure Communication in Dynamic Incomplete Networks. - Ivan Damgård; Divya Ravi 001; Daniel Tschudi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2023)

sfAsterisk: Super-fast MPC with a Friend. - Banashri Karmakar; Nishat Koti; Arpita Patra; Sikhar Patranabis; Protik Paul; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2023)

MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. - Hannah Keller; Claudio Orlandi; Anat Paskin-Cherniavsky; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2023)

Asterisk: Super-fast MPC with a Friend. - Banashri Karmakar; Nishat Koti; Arpita Patra; Sikhar Patranabis; Protik Paul; Divya Ravi 001 (SP, 2024)

Constant-Round YOSO MPC Without Setup. - Sebastian Kolby; Divya Ravi 001; Sophia Yakoubov (IACR Commun. Cryptol., 2024)

Minimizing the Use of the Honest Majority in YOSO MPC with Guaranteed Output Delivery. - Rishabh Bhadauria; James Hsin-yu Chiang; Divya Ravi 001; Jure Sternad; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2024)

Efficient Secure Communication Over Dynamic Incomplete Networks With Minimal Connectivity. - Ivan Damgård; Divya Ravi 001; Lawrence Roy; Daniel Tschudi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2024)

Deniable Secret Sharing. - Ran Canetti; Ivan Damgård; Sebastian Kolby; Divya Ravi 001; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2025)

Separating Broadcast from Cheater Identification. - Yashvanth Kondi; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2025)