Efficient Secure Communication Over Dynamic Incomplete Networks With Minimal Connectivity

ePrint Report: Efficient Secure Communication Over Dynamic Incomplete Networks With Minimal Connectivity

Ivan Damgård, Divya Ravi, Lawrence Roy, Daniel Tschudi, Sophia Yakoubov

We study the problem of implementing unconditionally secure reliable and private communication (and hence secure computation) in dynamic incomplete networks.
Our model assumes that the network is always $k$-connected, for some $k$, but the concrete connection graph is adversarially chosen in each round of interaction.
We show that, with $n$ players and $t$ malicious corruptions, perfectly secure communication …

communication computation connectivity daniel dynamic eprint report network networks private problem report secure communication secure computation study