The following pages link to Divya Ravi (Q1705715):
Displaying 19 items.
- Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network (Q1705716) (← links)
- Crash-tolerant consensus in directed graph revisited (extended abstract) (Q1713896) (← links)
- Broadcast-optimal two round MPC with an honest majority (Q2128559) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q2181890) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Information-theoretically secure MPC against mixed dynamic adversaries (Q2695650) (← links)
- On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
- On the Power of Hybrid Networks in Multi-Party Computation (Q5375571) (← links)
- On the exact round complexity of secure three-party computation (Q5916237) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- Broadcast-optimal four-round MPC in the plain model (Q6582165) (← links)
- Taming adaptivity in YOSO protocols: the modular way (Q6582166) (← links)
- On the round complexity of fully secure solitary MPC with honest majority (Q6582169) (← links)
- Broadcast-optimal two round MPC with asynchronous peer-to-peer channels (Q6619925) (← links)
- Threshold-optimal MPC with friends and foes (Q6623341) (← links)
- MPC with low bottleneck-complexity: information-theoretic security and more (Q6642397) (← links)
- Secure communication in dynamic incomplete networks (Q6642399) (← links)
