Divya Ravi

Orcid: 0000-0001-6423-8331

According to our database1, Divya Ravi authored at least 31 papers between 2017 and 2025.

Collaborative distances:

Timeline

2017
2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
7
1
3
6
5
4
1
1
3
2
1
1
1
2

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Separating Broadcast from Cheater Identification.
IACR Cryptol. ePrint Arch., 2025

2024
Efficient Secure Communication Over Dynamic Incomplete Networks With Minimal Connectivity.
IACR Cryptol. ePrint Arch., 2024

Minimizing the Use of the Honest Majority in YOSO MPC with Guaranteed Output Delivery.
IACR Cryptol. ePrint Arch., 2024

Constant-Round YOSO MPC Without Setup.
IACR Commun. Cryptol., 2024

Asterisk: Super-fast MPC with a Friend.
Proceedings of the IEEE Symposium on Security and Privacy, 2024

2023
MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More.
IACR Cryptol. ePrint Arch., 2023

sfAsterisk: Super-fast MPC with a Friend.
IACR Cryptol. ePrint Arch., 2023

Secure Communication in Dynamic Incomplete Networks.
IACR Cryptol. ePrint Arch., 2023

Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels.
IACR Cryptol. ePrint Arch., 2023

Broadcast-Optimal Four-Round MPC in the Plain Model.
IACR Cryptol. ePrint Arch., 2023

Taming Adaptivity in YOSO Protocols: The Modular Way.
IACR Cryptol. ePrint Arch., 2023

2022
Threshold-Optimal MPC With Friends and Foes.
IACR Cryptol. ePrint Arch., 2022

Towards Efficient YOSO MPC Without Setup.
IACR Cryptol. ePrint Arch., 2022

Fully-Secure MPC with Minimal Trust.
IACR Cryptol. ePrint Arch., 2022

Minimizing Setup in Broadcast-Optimal Two Round MPC.
IACR Cryptol. ePrint Arch., 2022

Round-Optimal Multi-Party Computation with Identifiable Abort.
IACR Cryptol. ePrint Arch., 2022

2021
On the Exact Round Complexity of Secure Three-Party Computation.
J. Cryptol., 2021

On the Bottleneck Complexity of MPC with Correlated Randomness.
IACR Cryptol. ePrint Arch., 2021

Information-Theoretically Secure MPC against Mixed Dynamic Adversaries.
IACR Cryptol. ePrint Arch., 2021

On the Round Complexity of Fully Secure Solitary MPC with Honest Majority.
IACR Cryptol. ePrint Arch., 2021

Broadcast-Optimal Two Round MPC with an Honest Majority.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation.
IACR Cryptol. ePrint Arch., 2020

2019
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation.
IACR Cryptol. ePrint Arch., 2019

2018
On the Power of Hybrid Networks in Multi-Party Computation.
IEEE Trans. Inf. Theory, 2018

Crash-tolerant Consensus in Directed Graph Revisited.
IACR Cryptol. ePrint Arch., 2018

Fast Secure Computation for Small Population over the Internet.
IACR Cryptol. ePrint Arch., 2018

Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2018

2017
Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network.
IACR Cryptol. ePrint Arch., 2017

Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security.
IACR Cryptol. ePrint Arch., 2017

Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network.
Proceedings of the Information Theoretic Security - 10th International Conference, 2017


  Loading...