Research
Publications :
Asterisk: Super-fast MPC with a Friend. [Link]
Authors: Banashri Karmakar, Nishat Koti, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi
IEEE S&P 2024
Threshold-Optimal MPC with Friends and Foes [Link]
Authors: Nikolas Melissaris, Divya Ravi, Sophia Yakoubov
INDOCRYPT 2023
On the Round Complexity of Fully Secure Solitary MPC with Honest Majority [Link]
Authors: Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee, Divya Ravi
TCC 2023
Broadcast-Optimal Four Round MPC in the Plain Model
Authors: Michele Ciampi, Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Yu Xia, Sophia Yakoubov
TCC 2023
Taming Adaptivity in YOSO Protocols: The Modular Way [Link]
Authors: Ran Canetti, Sebastian Kolby, Divya Ravi, Eduardo Soria-Vazquez, Sophia Yakoubov
TCC 2023
Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels [Link]
Authors: Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov
LATINCRYPT 2023
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation [Link]
Full and extended version of ASIACRYPT'19
Authors: Arpita Patra, Divya Ravi
Journal of Cryptology, 2023
MPC with Low Bottleneck Complexity: Information-Theoretic Security and More [Link]
Authors: Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky, Divya Ravi
ITC 2023
Secure Communication in Dynamic Incomplete Networks [Link]
Authors: Ivan Damgård, Divya Ravi, Daniel Tschudi, Sophia Yakoubov
ITC 2023
Minimizing Setup in Broadcast-Optimal Two Round MPC [Link]
Authors: Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov
EUROCRYPT 2023
Fully-Secure MPC with Minimal Trust [Link]
Authors: Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan
TCC 2022
Round-Optimal Multi-Party Computation with Identifiable Abort [Link]
Authors: Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner
EUROCRYPT 2022
On the Bottleneck Complexity of MPC with Correlated Randomness [Link]
Authors: Claudio Orlandi, Divya Ravi, Peter Scholl
PKC 2022
Information-Theoretically Secure MPC against Mixed Dynamic Adversaries [Link]
Authors: Ivan Damgård, Daniel Escudero, Divya Ravi
TCC 2021
On the Exact Round complexity of Secure Three-party Computation [Link]
Full and extended version of CRYPTO'18
Authors: Arpita Patra, Divya Ravi
Journal of Cryptology, 2021
Broadcast-Optimal Two Round MPC with an Honest Majority [Link]
Authors: Ivan Damgård, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov
CRYPTO 2021
On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation [Link]
Authors: Arpita Patra, Divya Ravi, Swati Singla
ASIACRYPT 2020
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation [Link]
Authors: Arpita Patra, Divya Ravi
ASIACRYPT 2019
Fast Secure Computation for Small Population over the Internet [Link]
Authors: Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi
CCS 2018
On the Exact Round complexity of Secure Three-party Computation [Link]
Authors: Arpita Patra, Divya Ravi
CRYPTO 2018
On the Power of Hybrid Networks in Multi-party Computation [Link]
Authors: Arpita Patra, Divya Ravi
IEEE Transactions on Information Theory
Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network [Link]
Authors: Ashish Choudhury, Arpita Patra, Divya Ravi
International Conference on Information Theoretic Security (ICITS) 2017
Crash-Tolerant Consensus in Directed Graph Revisited [Link]
Authors: Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar
DISC 2017 (Brief Announcement); SIROCCO 2018 (Full Paper)