MPC vs. SFE: Perfect Security in a Unified Corruption Model

DOI10.1007/978-3-540-78524-8_14zbMath1162.94335OpenAlexW2129868596MaRDI QIDQ5445509

Matthias Fitzi, Zuzana Beerliová-Trubíniová, Martin Hirt, Ueli M. Maurer, Vassilis Zikas

Publication date: 5 March 2008

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Fully-secure MPC with minimal trust ⋮ 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 ⋮ MPC vs. SFE : Unconditional and Computational Security ⋮ MPC with friends and foes

This page was built for publication: MPC vs. SFE: Perfect Security in a Unified Corruption Model