Efficiency in Secure Multi-Party Computations

Efficiency in Secure Multi-Party Computations

Status

This project started in September 2004 and ended in December 2008.

Researchers

Prof. Dr. Ueli Maurer, Cryptography & Information Security Group, ETH
Zuzana Beerliova, Cryptography & Information Security Group, ETH
Dr. Martin Hirt, Cryptography & Information Security Group, ETH
Vassilis Zikas, Cryptography & Information Security Group, ETH

Description

Cooperation among parties that do not necessarily trust each other is a common problem in business and government administration contexts and will become more important in the emerging information economy. Examples include business negotiations, collective decision making (e.g. voting), auctioning, contract signing, or the joint computation of statistical data.
The topic of this project is secure cooperation in a distributed environment among parties that neither trust each other nor have a common party they all trust.
Secure multi-party computation (MPC) is a crucial technique in this context as it allows the simulation of a trusted party. However, known protocols for MPC are either highly inefficient, especially in terms of the communication complexity, or they are targeted to very specific problems (like voting). This projects aims at devising new models and protocols, bridging the gap from theory to practice.

Publication

Zuzana Beerliova-Trubiniova and Martin Hirt

Efficient Multi-Party Computation with Dispute Control

Theory of Cryptography -TCC ‘2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 3876, pp. 305-328, Mar 2006
.

Zuzana Beerliova-Trubiniova and Martin Hirt

Simple and Efficient Perfectly-Secure Asynchronous MPC 

Advances in Cryptology – ASIACRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4833, pp. 376-392, 2007
.

Zuzana Beerliova-Trubiniova, Martin Hirt, and Micha Riser

Efficient Byzantine Agreement with Faulty Minority

Advances in Cryptology – ASIACRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4833, pp. 393 – 409, 2007
.

Zuzana Beerliova-Trubiniova and Martin Hirt

Perfectly-Secure MPC with Linear Communication Complexity

Theory of Cryptography – TCC 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 4948, pp. 213-230, Mar 2008

Zuzana Beerliova-Trubiniova, Matthias Fitzi, Martin Hirt, Ueli Maurer, and Vassilis Zikas

MPC vs. SFE: Perfect Security in a Unified Corruption Model

Theory of Cryptography – TCC 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 4948, pp. 231-250, Mar 2008.