default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDivya Ravi 0001
Person information
- affiliation: University of Amsterdam, The Netherlands
- affiliation (former): Aarhus University, Denmark
- affiliation (former, PhD 2020 ): Indian Institute of Science (IISc), Bangalore, India
Other persons with the same name
- Divya Ravi 0002
![[0009-0005-2349-6496]](https://dblp.org/img/orcid-mark.12x12.png "0009-0005-2349-6496")
— University of Sydney, School of Architecture, Design and Planning, Sydney, NSW, Australia
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c27]Banashri Karmakar, Aniket Kate, Shravani Patil, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi:
Breaking the Barrier for Asynchronous MPC with a Friend. SP 2026: 3262-3280- [i29]Yashvanth Kondi, Divya Ravi, Jure Sternad, Sophia Yakoubov:
Putting the OPTI in Round Optimal IA-MPC in the Plain Model. IACR Cryptol. ePrint Arch. 2026: 406 (2026) - 2025
- [c26]Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Yu Xia:
Broadcast-Optimal Secure Computation from Black-Box Oblivious Transfer. ASIACRYPT (5) 2025: 133-162 - [c25]Yashvanth Kondi, Divya Ravi:
Separating Broadcast from Cheater Identification. CCS 2025: 3664-3677 - [c24]Michele Ciampi, Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Information-Theoretic Broadcast-Optimal MPC. TCC (1) 2025: 152-181 - [c23]Ran Canetti, Ivan Damgård, Sebastian Kolby, Divya Ravi, Sophia Yakoubov:
Deniable Secret Sharing. TCC (2) 2025: 399-427 - [i28]Yashvanth Kondi, Divya Ravi:
Separating Broadcast from Cheater Identification. IACR Cryptol. ePrint Arch. 2025: 52 (2025) - [i27]Ran Canetti, Ivan Damgård, Sebastian Kolby, Divya Ravi, Sophia Yakoubov:
Deniable Secret Sharing. IACR Cryptol. ePrint Arch. 2025: 525 (2025) - [i26]Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Yu Xia:
Broadcast-Optimal Secure Computation From Black-Box Oblivious Transfer. IACR Cryptol. ePrint Arch. 2025: 1614 (2025) - [i25]Michele Ciampi, Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Information-Theoretic Broadcast-Optimal MPC. IACR Cryptol. ePrint Arch. 2025: 1710 (2025) - [i24]Banashri Karmakar, Aniket Kate, Shravani Patil, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi:
Breaking the Barrier for Asynchronous MPC with a Friend. IACR Cryptol. ePrint Arch. 2025: 1736 (2025) - 2024
- [j3]Sebastian Kolby, Divya Ravi, Sophia Yakoubov:
Constant-Round YOSO MPC Without Setup. IACR Commun. Cryptol. 1(3): 30 (2024) - [c22]Banashri Karmakar, Nishat Koti, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi:
Asterisk: Super-fast MPC with a Friend. SP 2024: 542-560 - [c21]Ivan Damgård, Divya Ravi, Lawrence Roy, Daniel Tschudi, Sophia Yakoubov:
Efficient Secure Communication over Dynamic Incomplete Networks with Minimal Connectivity. TCC (4) 2024: 266-292 - [i23]Ivan Damgård, Divya Ravi, Lawrence Roy, Daniel Tschudi, Sophia Yakoubov:
Efficient Secure Communication Over Dynamic Incomplete Networks With Minimal Connectivity. IACR Cryptol. ePrint Arch. 2024: 972 (2024) - [i22]Rishabh Bhadauria, James Hsin-yu Chiang, Divya Ravi, Jure Sternad, Sophia Yakoubov:
Minimizing the Use of the Honest Majority in YOSO MPC with Guaranteed Output Delivery. IACR Cryptol. ePrint Arch. 2024: 2059 (2024) - 2023
- [c20]Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky, Divya Ravi:
MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. ITC 2023: 11:1-11:22 - [c19]Ivan Damgård, Divya Ravi, Daniel Tschudi, Sophia Yakoubov:
Secure Communication in Dynamic Incomplete Networks. ITC 2023: 13:1-13:21 - [c18]Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Minimizing Setup in Broadcast-Optimal Two Round MPC. EUROCRYPT (2) 2023: 129-158 - [c17]Nikolas Melissaris, Divya Ravi, Sophia Yakoubov:
Threshold-Optimal MPC with Friends and Foes. INDOCRYPT (2) 2023: 3-24 - [c16]Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels. LATINCRYPT 2023: 87-106 - [c15]Michele Ciampi, Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Yu Xia, Sophia Yakoubov:
Broadcast-Optimal Four-Round MPC in the Plain Model. TCC (2) 2023: 3-32 - [c14]Ran Canetti, Sebastian Kolby, Divya Ravi, Eduardo Soria-Vazquez, Sophia Yakoubov:
Taming Adaptivity in YOSO Protocols: The Modular Way. TCC (2) 2023: 33-62 - [c13]Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee, Divya Ravi:
On the Round Complexity of Fully Secure Solitary MPC with Honest Majority. TCC (2) 2023: 124-155 - [i21]Ivan Damgård, Divya Ravi, Daniel Tschudi, Sophia Yakoubov:
Secure Communication in Dynamic Incomplete Networks. IACR Cryptol. ePrint Arch. 2023: 529 (2023) - [i20]Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky, Divya Ravi:
MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. IACR Cryptol. ePrint Arch. 2023: 683 (2023) - [i19]Ran Canetti, Sebastian Kolby, Divya Ravi, Eduardo Soria-Vazquez, Sophia Yakoubov:
Taming Adaptivity in YOSO Protocols: The Modular Way. IACR Cryptol. ePrint Arch. 2023: 1077 (2023) - [i18]Banashri Karmakar, Nishat Koti, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi:
sfAsterisk: Super-fast MPC with a Friend. IACR Cryptol. ePrint Arch. 2023: 1098 (2023) - [i17]Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels. IACR Cryptol. ePrint Arch. 2023: 1187 (2023) - [i16]Michele Ciampi, Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Yu Xia, Sophia Yakoubov:
Broadcast-Optimal Four-Round MPC in the Plain Model. IACR Cryptol. ePrint Arch. 2023: 1739 (2023) - 2022
- [c12]Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner:
Round-Optimal Multi-party Computation with Identifiable Abort. EUROCRYPT (1) 2022: 335-364 - [c11]Claudio Orlandi, Divya Ravi, Peter Scholl:
On the Bottleneck Complexity of MPC with Correlated Randomness. Public Key Cryptography (1) 2022: 194-220 - [c10]Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan:
Fully-Secure MPC with Minimal Trust. TCC (2) 2022: 470-501 - [i15]Sebastian Kolby, Divya Ravi, Sophia Yakoubov:
Towards Efficient YOSO MPC Without Setup. IACR Cryptol. ePrint Arch. 2022: 187 (2022) - [i14]Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Minimizing Setup in Broadcast-Optimal Two Round MPC. IACR Cryptol. ePrint Arch. 2022: 293 (2022) - [i13]Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner:
Round-Optimal Multi-Party Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. 2022: 645 (2022) - [i12]Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan:
Fully-Secure MPC with Minimal Trust. IACR Cryptol. ePrint Arch. 2022: 1248 (2022) - [i11]Nikolas Melissaris, Divya Ravi, Sophia Yakoubov:
Threshold-Optimal MPC With Friends and Foes. IACR Cryptol. ePrint Arch. 2022: 1526 (2022) - 2021
- [j2]Arpita Patra, Divya Ravi:
On the Exact Round Complexity of Secure Three-Party Computation. J. Cryptol. 34(4): 40 (2021) - [c9]Ivan Damgård, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Broadcast-Optimal Two Round MPC with an Honest Majority. CRYPTO (2) 2021: 155-184 - [c8]Ivan Damgård, Daniel Escudero, Divya Ravi:
Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries. TCC (1) 2021: 591-622 - [i10]Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee, Divya Ravi:
On the Round Complexity of Fully Secure Solitary MPC with Honest Majority. IACR Cryptol. ePrint Arch. 2021: 241 (2021) - [i9]Ivan Damgård, Daniel Escudero, Divya Ravi:
Information-Theoretically Secure MPC against Mixed Dynamic Adversaries. IACR Cryptol. ePrint Arch. 2021: 1163 (2021) - [i8]Claudio Orlandi, Divya Ravi, Peter Scholl:
On the Bottleneck Complexity of MPC with Correlated Randomness. IACR Cryptol. ePrint Arch. 2021: 1594 (2021) - 2020
- [c7]Arpita Patra, Divya Ravi, Swati Singla:
On the Exact Round Complexity of Best-of-Both-Worlds Multi-party Computation. ASIACRYPT (3) 2020: 60-91 - [i7]Arpita Patra, Divya Ravi, Swati Singla:
On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation. IACR Cryptol. ePrint Arch. 2020: 1050 (2020)
2010 – 2019
- 2019
- [c6]Arpita Patra, Divya Ravi:
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. ASIACRYPT (1) 2019: 456-487 - [i6]Arpita Patra, Divya Ravi:
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. IACR Cryptol. ePrint Arch. 2019: 998 (2019) - 2018
- [j1]Arpita Patra, Divya Ravi:
On the Power of Hybrid Networks in Multi-Party Computation. IEEE Trans. Inf. Theory 64(6): 4207-4227 (2018) - [c5]Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi:
Fast Secure Computation for Small Population over the Internet. CCS 2018: 677-694 - [c4]Arpita Patra, Divya Ravi:
On the Exact Round Complexity of Secure Three-Party Computation. CRYPTO (2) 2018: 425-458 - [c3]Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract). SIROCCO 2018: 55-71 - [i5]Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Crash-tolerant Consensus in Directed Graph Revisited. IACR Cryptol. ePrint Arch. 2018: 436 (2018) - [i4]Arpita Patra, Divya Ravi:
On the Exact Round Complexity of Secure Three-Party Computation. IACR Cryptol. ePrint Arch. 2018: 481 (2018) - [i3]Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi:
Fast Secure Computation for Small Population over the Internet. IACR Cryptol. ePrint Arch. 2018: 710 (2018) - 2017
- [c2]Ashish Choudhury, Arpita Patra, Divya Ravi:
Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network. ICITS 2017: 83-109 - [c1]Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited. DISC 2017: 46:1-46:4 - [i2]Ashish Choudhury, Arpita Patra, Divya Ravi:
Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network. IACR Cryptol. ePrint Arch. 2017: 1006 (2017) - [i1]Megha Byali, Arpita Patra, Divya Ravi, Pratik Sarkar:
Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security. IACR Cryptol. ePrint Arch. 2017: 1165 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-07-19 01:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
