Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation

DOI10.1007/978-3-662-45608-8_25zbMath1317.94099OpenAlexW2911867128MaRDI QIDQ2936624

Yehuda Lindell, Ran Cohen

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)

Related Items

Efficient Secure Multiparty Computation with Identifiable Abort ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Minimizing setup in broadcast-optimal two round MPC ⋮ Fairness versus guaranteed output delivery in secure multiparty computation ⋮ On communication models and best-achievable security in two-round MPC ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Characterization of secure multiparty computation without broadcast ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ Characterization of Secure Multiparty Computation Without Broadcast ⋮ On the exact round complexity of secure three-party computation ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ 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