Bi-Weekly Talk: Andreas Klinger: A new hope for matching in a galaxy far, far away....

Mittwoch, 04.03.2020, 10.30 Uhr

Ort: RWTH Aachen University, Informatikzentrum - Ahornstr. 55, Erweiterungsgebäude E3, Raum 9u10

Title: A new hope for matching in a galaxy far, far away....

In secure multi-party computation a number of parties wants to compute a function over their inputs such that their inputs are kept private, and each party learns only its prescribed output. A trusted third party can be used to perform these computations. However, such a trusted third party often does not exist and the parties have to compute the function in a distributed fashion, i.e., they jointly execute a secure protocol to simulate a trusted third party. For static settings where all parties know each other and a single distributed computation is performed, i.e., one call to the trusted third party is simulated, and thus executing an offline algorithm, there exist already a variety of protocols. However, for dynamic settings where parties join and leave over time, or change their input, i.e., they perform an online algorithm, there are no results yet.

In this talk we will give an introduction to secure multi-party computation in general for offline algorithms, and then extend the basic theory to online algorithms. We will also show some positive and negative feasibility results w.r.t. secure multi-party computation for online algorithms.