Fairness versus guaranteed output delivery in secure multiparty computation
From MaRDI portal
Publication:2936624
DOI10.1007/978-3-662-45608-8_25zbMATH Open1317.94099OpenAlexW2911867128MaRDI QIDQ2936624FDOQ2936624
Publication date: 6 January 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-45608-8_25
Recommendations
- Fairness versus guaranteed output delivery in secure multiparty computation
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
- Complete fairness in secure two-party computation
- Legally-Enforceable Fairness in Secure Two-Party Computation
- Complete fairness in secure two-party computation
Cited In (18)
- Efficient, actively secure MPC with a dishonest majority: a survey
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Probabilistic termination and composability of cryptographic protocols
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- On the exact round complexity of secure three-party computation
- Characterization of secure multiparty computation without broadcast
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Characterization of Secure Multiparty Computation Without Broadcast
- Round-optimal multi-party computation with identifiable abort
- Efficient constant-round MPC with identifiable abort and public verifiability
- Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security
- Fairness versus guaranteed output delivery in secure multiparty computation
- Efficient Secure Multiparty Computation with Identifiable Abort
- On communication models and best-achievable security in two-round MPC
- Minimizing setup in broadcast-optimal two round MPC
This page was built for publication: Fairness versus 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 Q2936624)
