Daniel Tschudi, ETH Zurich
From 12.00 until 13.30
At CNB/F/110, ETH Zurich
Universitätstrasse 6, 8092 Zurich
Abstract:
Secure multi-party computation (MPC) allows n distrusting parties to jointly compute a function of their inputs while revealing nothing but the output of the function. At TCC 15, Moran et al. [1] introduced "Topology-Hiding MPC". Here, one considers MPC over an incomplete network, where the network topology, in itself, is considered sensitive information. The need for topology-hiding protocols raises naturally in context such as private peer-to-peer computation or anonymous communication.
In this talk, I will give an introduction to topology-hiding MPC.
[1] T. Moran, I. Orlov, S. Richelson, "Topology-Hiding Computation," in Proceedings of the Theory of Cryptography Conference (TCC), 2015.