Graceful Degradation in Multi-Party Computation (Extended Abstract)

DOI10.1007/978-3-642-20728-0_15zbMath1295.94081OpenAlexW1486998117MaRDI QIDQ3002112

Ueli M. Maurer, Christoph Lucas, Martin Hirt, Dominik Raub

Publication date: 19 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20728-0_15

zbMATH Keywords

multi-party computationgraceful degradationhybrid securitymixed adversaries

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Best possible information-theoretic MPC ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Information-theoretically secure MPC against mixed dynamic adversaries ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation

This page was built for publication: Graceful Degradation in Multi-Party Computation (Extended Abstract)