On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
From MaRDI portal
Recommendations
- Fairness versus guaranteed output delivery in secure multiparty computation
- Fairness versus guaranteed output delivery in secure multiparty computation
- On achieving the ``best of both worlds in secure multiparty computation
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- \(1/p\)-secure multiparty computation without honest majority and the best of both worlds
Cited in
(19)- On fully secure MPC with solitary output
- MPC with synchronous security and asynchronous responsiveness
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Player-centric Byzantine agreement
- Three party secure computation with friends and foes
- MPC vs. SFE : Unconditional and Computational Security
- scientific article; zbMATH DE number 4101088 (Why is no real title available?)
- Network oblivious transfer
- Protocols for multiparty coin toss with a dishonest majority
- Multi-threshold asynchronous reliable broadcast and consensus
- Threshold-optimal MPC with friends and foes
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Can Alice and Bob guarantee output to Carol?
- Fairness versus guaranteed output delivery in secure multiparty computation
- Fairness versus guaranteed output delivery in secure multiparty computation
- On the exact round complexity of best-of-both-worlds multi-party computation
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- On achieving the ``best of both worlds in secure multiparty computation
- When is a semi-honest secure multiparty computation valuable?
This page was built for publication: On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756647)