Reliable communication over partially authenticated networks

Amos Beimel; Matthew Franklin

doi:10.1016/S0304-3975(98)00241-2

Reliable communication over partially authenticated networks

Amos Beimel, Matthew Franklin

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

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	https://doi.org/10.1016/S0304-3975(98)00241-2
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
Computer Science (all)

Access to Document

10.1016/S0304-3975(98)00241-2

Cite this

@article{947eebc3df2c42fdadda6ef2f82f48e7,

title = "Reliable communication over partially authenticated networks",

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.",

keywords = "Authentication keys, Byzantine failures, Graph connectivity, Private communication, Reliable communication",

author = "Amos Beimel and Matthew Franklin",

note = "Funding Information: {\textquoteright} An extended abstract of this paper appears in the proceedings of the WDAG {\textquoteleft}97 conference, Lecture Notes in Computer Science, vol. 1320, Springer, Berlin, 1997, pp. 245-259. * This work was done while the author was a postdoctoral fellow at DIMACS, supported in part by NSF under contract STC-91-19999 and the New Jersey Commission on Science and Technology.",

year = "1999",

month = jun,

day = "6",

doi = "10.1016/S0304-3975(98)00241-2",

language = "English",

volume = "220",

pages = "185--210",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Reliable communication over partially authenticated networks

AU - Beimel, Amos

AU - Franklin, Matthew

N1 - Funding Information: ’ An extended abstract of this paper appears in the proceedings of the WDAG ‘97 conference, Lecture Notes in Computer Science, vol. 1320, Springer, Berlin, 1997, pp. 245-259. * This work was done while the author was a postdoctoral fellow at DIMACS, supported in part by NSF under contract STC-91-19999 and the New Jersey Commission on Science and Technology.

PY - 1999/6/6

Y1 - 1999/6/6

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.

KW - Authentication keys

KW - Byzantine failures

KW - Graph connectivity

KW - Private communication

KW - Reliable communication

UR - http://www.scopus.com/inward/record.url?scp=0346396336&partnerID=8YFLogxK

U2 - 10.1016/S0304-3975(98)00241-2

DO - 10.1016/S0304-3975(98)00241-2

M3 - Article

AN - SCOPUS:0346396336

SN - 0304-3975

VL - 220

SP - 185

EP - 210

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1

ER -

Reliable communication over partially authenticated networks

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this