SPDZ2k - Efficient MPC mod 2^k for Dishonest Majority

Explore a conference talk presenting a paper on SPDZ2k, an efficient multi-party computation (MPC) protocol operating modulo 2^k for dishonest majority scenarios. Delve into the research conducted by Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, and Chaoping Xing, which was presented at Crypto 2018. Learn about the innovative approach to secure computation that addresses challenges in scenarios where the majority of participants may be dishonest. Gain insights into the protocol's efficiency and its potential applications in various cryptographic contexts. This 24-minute presentation offers a concise yet comprehensive overview of the SPDZ2k protocol, its advantages, and its significance in the field of cryptography and secure multi-party computation.

SPDZ2k Efficient MPC mod 2^k for Dishonest Majority