The following pages link to (Q4437112):
Displaying 9 items.
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- Characterization of Secure Multiparty Computation Without Broadcast (Q2796144) (← links)
- MPC vs. SFE : Unconditional and Computational Security (Q3600361) (← links)
- How to obtain full privacy in auctions (Q5492128) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
