Divya Ravi

Orcid: 0000-0001-6423-8331

Affiliations:
  • University of Amsterdam, The Netherlands
  • Aarhus University, Denmark (former)
  • Indian Institute of Science (IISc), Bangalore, India (former, PhD 2020 )


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Breaking the Barrier for Asynchronous MPC with a Friend.
IACR Cryptol. ePrint Arch., 2025

Broadcast-Optimal Secure Computation From Black-Box Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2025

Information-Theoretic Broadcast-Optimal MPC.
IACR Cryptol. ePrint Arch., 2025

Deniable Secret Sharing.
IACR Cryptol. ePrint Arch., 2025

Separating Broadcast from Cheater Identification.
Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025

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

Efficient Secure Communication over Dynamic Incomplete Networks with Minimal Connectivity.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

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

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

Broadcast-Optimal Four-Round MPC in the Plain Model.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Taming Adaptivity in YOSO Protocols: The Modular Way.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

On the Round Complexity of Fully Secure Solitary MPC with Honest Majority.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels.
Proceedings of the Progress in Cryptology - LATINCRYPT 2023, 2023

Threshold-Optimal MPC with Friends and Foes.
Proceedings of the Progress in Cryptology - INDOCRYPT 2023, 2023

Minimizing Setup in Broadcast-Optimal Two Round MPC.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More.
Proceedings of the 4th Conference on Information-Theoretic Cryptography, 2023

Secure Communication in Dynamic Incomplete Networks.
Proceedings of the 4th Conference on Information-Theoretic Cryptography, 2023

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

Fully-Secure MPC with Minimal Trust.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

On the Bottleneck Complexity of MPC with Correlated Randomness.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

Round-Optimal Multi-party Computation with Identifiable Abort.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries.
Proceedings of the Theory of Cryptography - 19th International Conference, 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.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 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

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

On the Exact Round Complexity of Secure Three-Party Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Fast Secure Computation for Small Population over the Internet.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 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...