Expander graphs for digital stream authentication and robust overlay networks
Song, D.
Zuckerman, D.
Tygar, J.D.
California Univ., Berkeley, CA, USA;
This paper appears in: Security and Privacy, 2002. Proceedings. 2002 IEEE Symposium on
Publication Date: 2002
On page(s): 258- 270
ISSN: 1081-6011
ISBN: 0-7695-1543-6
INSPEC Accession Number: 7322058
Digital Object Identifier: 10.1109/SECPRI.2002.1004376
Current Version Published: 2004-08-30
Abstract
We use expander graphs to provide efficient new constructions for two security applications: authentication of long digital streams over lossy networks and building scalable, robust overlay networks. Here is a summary of our contributions: (1) To authenticate long digital streams over lossy networks, we provide a construction with a provable lower bound on the ability to authenticate a packet - and that lower bound is independent of the size of the graph. To achieve this, we present an authentication expander graph with constant degree. (Previous work used authentication graphs but required graphs with degree linear in the number of vertices.) (2) To build efficient, robust, and scalable overlay networks, we provide a construction using undirected expander graphs with a provable lower bound on the ability of a broadcast message to successfully reach any receiver. This also gives us a new, more efficient solution to the decentralized certificate revocation problem.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
