Expander Graphs for Digital Stream Authentication and Robust Overlay Networks.
SP '02: Proceedings of the 2002 IEEE Symposium on Security and Privacy(2002)
摘要
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].
更多查看译文
关键词
lossy network,authentication expander graph,authentication graph,efficient new construction,efficient solution,expander graph,undirected expander graph,building scalable,constant degree,digital stream,Digital Stream Authentication,Expander Graphs,Robust Overlay Networks
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络