Efficient Reliable Communication over Partially Authenticated Networks

Amos Beimel, Lior Malka

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

3 Scopus citations

Abstract

Reliable communication between parties in a network is a basic requirement for executing any protocol. Dolev and Dolev et al. showed that reliable communication is possible if and only if the communication network is sufficiently connected. Beimel and Franklin showed that the connectivity requirement can be relaxed if some pairs of parties share authentication keys. That is, costly communication links can be replaced by authentication keys. In this work, we continue this line of research. We consider the scenario where there is a specific sender and a specific receiver. In this case, the protocol of has nO(n) rounds even if there is a single Byzantine processor. We present a more efficient protocol with round complexity of (n/t) O(t) where n is the number of processors in the network and t is an upper bound on the number of Byzantine processors in the network. Specifically, our protocol is polynomial when the number of Byzantine processors is O(1), and for every t its round complexity is bounded by 2O(n). The same improvements hold for reliable and private communication. The improved protocol is obtained by analyzing the properties of a "communication and authentication graph" that characterizes reliable communication.

Original languageEnglish
Title of host publicationTwenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, MA, United States.
Pages233-242
Number of pages10
DOIs
StatePublished - 1 Jan 2003
EventTwenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003 - Boston, MA, United States
Duration: 13 Jul 200316 Jul 2003

Conference

ConferenceTwenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003
Country/TerritoryUnited States
CityBoston, MA
Period13/07/0316/07/03

Fingerprint

Dive into the research topics of 'Efficient Reliable Communication over Partially Authenticated Networks'. Together they form a unique fingerprint.

Cite this