The following pages link to (Q4249325):
Displaying 14 items.
- Multi-party computation with conversion of secret sharing (Q664384) (← links)
- On minimal connectivity requirements for secure message transmission in directed networks (Q1685018) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Secure multi-party computation made simple (Q2489932) (← links)
- Secure MPC: laziness leads to GOD (Q2691583) (← links)
- Information-theoretically secure MPC against mixed dynamic adversaries (Q2695650) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity (Q2947521) (← links)
- Player-Centric Byzantine Agreement (Q3012813) (← links)
- MPC vs. SFE : Unconditional and Computational Security (Q3600361) (← links)
- Efficient Simultaneous Broadcast (Q5445453) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- MPC with delayed parties over star-like networks (Q6595681) (← links)
- On information-theoretic secure multiparty computation with local repairability (Q6635769) (← links)
