Secure Communication in Dynamic Incomplete Networks

ePrint Report: Secure Communication in Dynamic Incomplete Networks

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

In this paper, we explore the feasibility of reliable and private communication in dynamic networks, where in each round the adversary can choose which direct peer-to-peer links are available in the network graph, under the sole condition that the graph is k-connected at each round (for some k).


We show that reliable communication is possible in such a dynamic network if and only if …

adversary communication daniel dynamic eprint report links network networks peer-to-peer private report secure communication under