Reliable communication over partially authenticated networks

Amos Beimel, Matthew Franklin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations


Reliable communication between parties in a network is a basic requirement for executing any protocol. In this work, we consider the effect on reliable communication when some pairs of parties have common authentication keys. The pairs sharing keys define a natural “authentication graph”, which may be quite different from the “communication graph” of the network. We characterize when reliable communication is possible in terms of these two graphs, focusing on the very strong setting of a Byzantine adversary with unlimited computational resources.

Original languageEnglish
Title of host publicationDistributed Algorithms - 11th International Workshop, WDAG 1997, Proceedings
EditorsPhilippas Tsigas, Marios Mavronicolas
PublisherSpringer Verlag
Number of pages15
ISBN (Print)3540635750, 9783540635758
StatePublished - 1 Jan 1997
Externally publishedYes
Event11th International Workshop on Distributed Algorithms, WDAG 1997 - Saarbrucken, Germany
Duration: 24 Sep 199726 Sep 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference11th International Workshop on Distributed Algorithms, WDAG 1997

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Reliable communication over partially authenticated networks'. Together they form a unique fingerprint.

Cite this