The full text of this article


Efficient multicast stream authentication for the fully adversarial network model
by Christophe Tartary, Huaxiong Wang
International Journal of Security and Networks (IJSN), Vol. 2, No. 3/4, 2007


Abstract: We consider the stream authentication problem when an adversary has the ability to drop, reorder or inject data 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 λn packets where λ and n are predesignated parameters. Our scheme, which is also joinable at the boundary of any n-packet block, can be viewed as an extension of Lysyanskaya, Tamassia and Triandopoulos's technique in which λ = 1. We show that by choosing λ and n 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%.


is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:


    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email