Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost

DOI10.1007/978-3-642-14623-7_30zbMath1284.68064OpenAlexW1521893691MaRDI QIDQ3582777

Claudio Orlandi, Ivan B. Damgård

Publication date: 24 August 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_30

Mathematics Subject Classification ID

Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items

Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Highly efficient OT-based multiplication protocols ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ On the exact round complexity of secure three-party computation ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Actively secure setup for SPDZ