Title: MPC over rings

Abstract:

Traditionally arithmetic multiparty computation protocols have mostly worked over finite fields. Recently, more general commutative rings have been considered, mostly notably the integers modulo a prime power. The SPDZ2k protocol (CRYPTO 2018) showed that in the dishonest majority setting MPC over these rings can be obtained with comparable efficiency to over fields. Since then, several works have shown that in some cases, working over these rings can be much faster than working over fields. We discuss some of the differences of doing MPC over fields versus these rings, and show that comparable efficiency to fields can also be obtained in the information-theoretic honest-majority setting.

Speaker: Mark Abspoel is a PhD student at CWI and the Mathematical Institute at Leiden University since January 2017, under the supervision of Ronald Cramer. Before this, he completed a Masters degree in Mathematics at Leiden University, with his thesis written at CWI on the topic of secret sharing. Mark Abspoel is currently visiting the Cryptography and Security Research Group.