Estimating the Runtime and Global Network Traffic of SMPC Protocols

Abstract

Secure multi-party computation (SMPC) enables multiple parties to evaluate functions of their private inputs, in a way such that none of the parties can learn anything about the other parties' private input but what can be learned from their own input and its output of the function evaluation. There are various practical applications for SMPC with runtimes ranging from a few seconds to multiple days. The performance of a protocol typically depends on the number of parties, the problem size, and the network setting. Thus, evaluating the applicability and performance of an SMPC protocol requires extensive benchmarking in varying settings, which can be very time and resource consuming, especially in slow network settings.

Authors 3

1. Andreas Klinger Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University, Aachen, Germany

2. Vincent Ehrmanntraut Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University, Aachen, Germany

3. Ulrike Meyer Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University, Aachen, Germany