Pages that link to "Item:Q2849397"
From MaRDI portal
The following pages link to A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation (Q2849397):
Displaying 8 items.
- Communication-efficient proactive MPC for dynamic groups with dishonest majorities (Q2096629) (← links)
- Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities (Q2229260) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Information-theoretically secure MPC against mixed dynamic adversaries (Q2695650) (← links)
- Proactive Secret Sharing with a Dishonest Majority (Q2827737) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
