Reliable communication over partially authenticated networks

Amos Beimel, Matthew Franklin

Research output: Contribution to journalArticlepeer-review

16 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
Pages (from-to)185-210
Number of pages26
JournalTheoretical Computer Science
Issue number1
StatePublished - 6 Jun 1999
Externally publishedYes


  • Authentication keys
  • Byzantine failures
  • Graph connectivity
  • Private communication
  • Reliable communication

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


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

Cite this