Abstract
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 language | English |
---|---|
Pages (from-to) | 185-210 |
Number of pages | 26 |
Journal | Theoretical Computer Science |
Volume | 220 |
Issue number | 1 |
DOIs | |
State | Published - 6 Jun 1999 |
Externally published | Yes |
Keywords
- Authentication keys
- Byzantine failures
- Graph connectivity
- Private communication
- Reliable communication
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science