TY - GEN
T1 - Reliable communication over partially authenticated networks
AU - Beimel, Amos
AU - Franklin, Matthew
N1 - Publisher Copyright:
© 2015, Springer Verlag, All Rights Reserved.
PY - 1997/1/1
Y1 - 1997/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0039093711&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0039093711
SN - 3540635750
SN - 9783540635758
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 245
EP - 259
BT - Distributed Algorithms - 11th International Workshop, WDAG 1997, Proceedings
A2 - Tsigas, Philippas
A2 - Mavronicolas, Marios
PB - Springer Verlag
T2 - 11th International Workshop on Distributed Algorithms, WDAG 1997
Y2 - 24 September 1997 through 26 September 1997
ER -