Pages that link to "Item:Q4437112"
From MaRDI portal
The following pages link to Secure computation without agreement (Q4437112):
Displaying 13 items.
- Secure computation without authentication (Q656923) (← links)
- Composition of secure multi-party protocols. A comprehensive study. (Q1407493) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Secure multi-party computation without agreement (Q2501711) (← 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)
- Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract) (Q2819552) (← 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)