Fairness versus guaranteed output delivery in secure multiparty computation

DOI10.1007/978-3-662-45608-8_25MaRDI QIDQ2936624zbMATH OpenOpenAlexFDO

Authors Ran Cohen, Yehuda Lindell

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

Mathematics Subject Classification ID

Cryptography (94A60)

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

(20)

• High throughput secure MPC over small population in hybrid networks (extended abstract)
• On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
• Yet another compiler for active security or: efficient MPC over arbitrary rings
• Fairness versus guaranteed output delivery in secure multiparty computation
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• Beyond honest majority: the round complexity of fair and robust multi-party computation
• Efficient, actively secure MPC with a dishonest majority: a survey
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• On the exact round complexity of secure three-party computation
• On achieving the ``best of both worlds in secure multiparty computation
• Probabilistic termination and composability of cryptographic protocols
• Can Alice and Bob guarantee output to Carol?
• 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
• On communication models and best-achievable security in two-round MPC
• Minimizing setup in broadcast-optimal two round MPC
• Efficient secure multiparty computation with identifiable abort
• Characterization of secure multiparty computation without broadcast
• Characterization of secure multiparty computation without broadcast
• Round-optimal multi-party computation with identifiable abort

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)