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

DOI10.1007/978-3-642-40084-1_12MaRDI QIDQ2849397zbMATH OpenOpenAlexFDO

Authors Martin Hirt, Ueli M. Maurer, Christoph Lucas

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

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

Recommendations

• Passive corruption in statistical multi-party computation. (Extended abstract)
• Multiparty computation for dishonest majority: from passive to active security at low cost
• Trading robustness for correctness and privacy in certain multiparty computations, beyond an honest majority
• scientific article; zbMATH DE number 1302842
• A new approach to practical active-secure two-party computation
• Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries
• Efficient multi-party computation: from passive to active security via secure SIMD circuits
• scientific article; zbMATH DE number 1583776
• Proactive secure multiparty computation with a dishonest majority
• Public Key Cryptography - PKC 2006

Cited in

(14)

• Network oblivious transfer
• Communication-efficient proactive MPC for dynamic groups with dishonest majorities
• Realistic Failures in Secure Multi-party Computation
• Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
• Beyond honest majority: the round complexity of fair and robust multi-party computation
• Graceful degradation in multi-party computation. (Extended abstract)
• Proactive Secret Sharing with a Dishonest Majority
• MPC with synchronous security and asynchronous responsiveness
• Efficient MPC with a Mixed Adversary
• MPC vs. SFE: Perfect Security in a Unified Corruption Model
• On the exact round complexity of best-of-both-worlds multi-party computation
• Hybrid-secure MPC, trading information-theoretic robustness for computational privacy
• Information-theoretically secure MPC against mixed dynamic adversaries
• Passive corruption in statistical multi-party computation. (Extended abstract)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849397)