Efficient Multicast Stream Authentication for the Fully Adversarial Network

Christophe Tartary and Huaxiong Wang

Abstract

We consider the stream authentication problem when an adversary has the ability to drop, reorder or inject data packets in the network. We propose a coding approach for multicast stream authentication using the list-decoding property of Reed-Solomon codes. We divide the data to be authenticated into a stream of packets and associate a single trapdoor hash collision for every packets where and are predesignated parameters. Our scheme, which is also joinable at the boundary of any -packet block, can be viewed as an extension of Lysyanskaya, Tamassia and Triandopoulos's technique in which = 1. We show that by choosing and appropriately, our scheme outperforms theirs in time spent for processing data at the sender and receiver. Our approach relies on the dispersion process as SAIDA and eSAIDA. Assuming that we use RSA for signing and SHA-256 for hashing, we give an approximation of the proportion of extra packets per block which could be processed via our technique with respect to the previous scheme. As example when we process = 1000 blocks of 2650 64-byte-packets, the gain of our scheme with respect to Lysyanskaya et al.'s is about 30%.

Remark: This article is an extended version of the paper presented at WISA 2005. In this new version, our goal is to reduce the time spent at the sender/receiver using a trapdoor hash function instead of a digital signature. We also provide additional details concerning the efficiency of the list-decoding process of Reed-Solomon codes in the multicast context.

Publication Details: International Journal of Security and Network (Special Issue on Cryptography in Networks), vol. 2, nos. 3/4, pp 175 - 191, 2007. Inderscience.

Download: pdf
 

Back to the list of publications (research area).

Back to the list of publications (category).

Back to the main page.