A coding approach to the multicast stream authentication problem

详细信息    查看全文

• 作者：Christophe Tartary ; Huaxiong Wang and Josef Pieprzyk
• 关键词：Stream authentication ; Polynomial reconstruction ; Rateless codes ; Erasure codes
• 刊名：International Journal of Information Security
• 出版年：2008
• 出版时间：August, 2008
• 年：2008
• 卷：7
• 期：4
• 页码：265-283
• 全文大小：368.6 KB

文摘

We study the multicast stream authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. In such a model, packet overhead and computing efficiency are two parameters to be taken into account when designing a multicast stream protocol. In this paper, we propose to use two families of erasure codes to deal with this problem, namely, rateless codes and maximum distance separable codes. Our constructions will have the following advantages. First, our packet overhead will be small. Second, the number of signature verifications to be performed at the receiver is O(1). Third, every receiver will be able to recover all the original data packets emitted by the sender despite losses and injection occurred during the transmission of information.