MPC vs. SFE : Unconditional and Computational Security

DOI10.1007/978-3-540-89255-7_1zbMath1206.94073OpenAlexW1489247097MaRDI QIDQ3600361

Vassilis Zikas, Ueli M. Maurer, Martin Hirt

Publication date: 10 February 2009

Published in: Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_1

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Broadcast from Minicast Secure Against General Adversaries ⋮ Fully-secure MPC with minimal trust ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Secure MPC: laziness leads to GOD ⋮ Information-theoretically secure MPC against mixed dynamic adversaries ⋮ Player-Centric Byzantine Agreement ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ From fairness to full security in multiparty computation ⋮ MPC with friends and foes

Cites Work

• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• Player simulation and general adversary structures in perfect multiparty computation
• Secure multi-party computation made simple
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• Efficient Byzantine Agreement with Faulty Minority
• Foundations of Cryptography
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• MPC vs. SFE: Perfect Security in a Unified Corruption Model
• On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: MPC vs. SFE : Unconditional and Computational Security