The following pages link to (Q4783721):
Displaying 13 items.
- Batch secret sharing for secure multi-party computation in asynchronous network (Q615211) (← links)
- Multi-party computation with conversion of secret sharing (Q664384) (← links)
- Robust encryption (Q1753165) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- High throughput secure MPC over small population in hybrid networks (extended abstract) (Q2152069) (← links)
- Secure multi-party computation made simple (Q2489932) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- Graph Design for Secure Multiparty Computation over Non-Abelian Groups (Q3600363) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- Counting Method for Multi-party Computation over Non-abelian Groups (Q5502759) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
