A coding approach to the multicast stream authentication problem

Christophe Tartary*, Huaxiong Wang, Josef Pieprzyk

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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 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.

Original languageEnglish
Pages (from-to)265-283
Number of pages19
JournalInternational Journal of Information Security
Volume7
Issue number4
DOIs
Publication statusPublished - Aug 2008

Fingerprint Dive into the research topics of 'A coding approach to the multicast stream authentication problem'. Together they form a unique fingerprint.

Cite this