A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation

DOI10.1007/978-3-642-40084-1_12zbMath1316.94077OpenAlexW2167524182MaRDI QIDQ2849397

Ueli M. Maurer, Christoph Lucas, Martin Hirt

Publication date: 17 September 2013

Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40084-1_12

zbMATH Keywords

multi-party computationcomputational securitymixed adversarygradual secret sharing

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

On the exact round complexity of best-of-both-worlds multi-party computation ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ Information-theoretically secure MPC against mixed dynamic adversaries ⋮ Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ Proactive Secret Sharing with a Dishonest Majority ⋮ Network Oblivious Transfer ⋮ Communication-efficient proactive MPC for dynamic groups with dishonest majorities

This page was built for publication: A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation