Expander Graphs for Digital Stream Authentication and Robust Overlay Networks

  • Authors:
  • Dawn Song;J. D. Tygar;David Zuckerman

  • Affiliations:
  • -;-;-

  • Venue:
  • SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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 summaryof 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,such as [MS01],used authentication graphs but requir ed 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 certicate revocation problem [WLM00].