. 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.
Christophe Tartary, Huaxiong Wang and Josef Pieprzyk
Abstract
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 . 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.
Publication Details: International Journal of Information Security, vol. 7, no. 4, pp 265 - 283, August 2008. Springer - Verlag.
Download: pdf
Back to the list of publications.
Back to the list of publications (research area).