Pages that link to "Item:Q5756647"
From MaRDI portal
The following pages link to On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation (Q5756647):
Displaying 11 items.
- On fully secure MPC with solitary output (Q2175916) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← 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)
- Network Oblivious Transfer (Q2829221) (← links)
- Player-Centric Byzantine Agreement (Q3012813) (← links)
- MPC vs. SFE : Unconditional and Computational Security (Q3600361) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- Three party secure computation with friends and foes (Q6582170) (← links)
- Threshold-optimal MPC with friends and foes (Q6623341) (← links)
