Secure Communication in Dynamic Incomplete Networks

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

Thumbnail PDF


  • Filesize: 0.88 MB
  • 21 pages

Document Identifiers

Author Details

Ivan Damgård
  • Aarhus University, Denmark
Divya Ravi
  • Aarhus University, Denmark
Daniel Tschudi
  • Concordium, Zürich, Switzerland
Sophia Yakoubov
  • Aarhus University, Denmark

Cite AsGet BibTex

Ivan Damgård, Divya Ravi, Daniel Tschudi, and Sophia Yakoubov. Secure Communication in Dynamic Incomplete Networks. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 13:1-13:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)


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 k > 2t. We also show that if k = cn > 2 t for a constant c, we can achieve reliable communication with polynomial round and communication complexity. For unconditionally private communication, we show that for a passive adversary, k > t is sufficient (and clearly necessary). For an active adversary, we show that k > 2t is sufficient for statistical security (and clearly necessary), while k > 3t is sufficient for perfect security. We conjecture that, in contrast to the static case, k > 2t is not enough for perfect security, and we give evidence that the conjecture is true. Once we have reliable and private communication between each pair of parties, we can emulate a complete network with secure channels, and we can use known protocols to do secure computation.

Subject Classification

ACM Subject Classification
  • Security and privacy → Information-theoretic techniques
  • Secure Communication
  • Dynamic Incomplete Network
  • Information-theoretic


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. E. R. Berlekamp and L. Welch. Error correction of algebraic block codes. US Patent Number 4,633,470. Issued Dec., 1986. Google Scholar
  2. Danny Dolev. The byzantine generals strike again. Journal of algorithms, 3(1):14-30, 1982. Google Scholar
  3. Danny Dolev, Cynthia Dwork, Orli Waarts, and Moti Yung. Perfectly secure message transmission. Journal of the ACM (JACM), 40(1):17-47, 1993. Google Scholar
  4. L. R. Ford and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399-404, 1956. URL:
  5. Alexandre Maurer, Sébastien Tixeuil, and Xavier Defago. Communicating reliably in multihop dynamic networks despite byzantine failures. In 2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS), pages 238-245, 2015. URL:
  6. Adi Shamir. How to share a secret. Communications of the Association for Computing Machinery, 22(11):612-613, November 1979. Google Scholar
  7. Ye Wang and Roger Wattenhofer. Asynchronous byzantine agreement in incomplete networks. In Proceedings of the 2nd ACM Conference on Advances in Financial Technologies, AFT '20, pages 178-188, New York, NY, USA, 2020. Association for Computing Machinery. URL: