Rateless codes for the multicast stream authentication problem

Christophe Tartary*, Huaxiong Wang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

2 Citations (Scopus)

Abstract

We study the multicast authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. We first study the packet authentication probability of a scheme proposed by Lysyanskaya, Tamassia and Triandopoulos in 2003 since our opponent model is based on theirs. Using a family of rateless codes called Luby Transform codes (LT codes) we design a protocol which allows any packet to be authenticated at the receiver with probability arbitrary close to 1. We also compare LT codes to other families of rateless codes which could be used in that context in order to minimize the packet overhead as well as the time complexity of encoding and decoding data.

Original languageEnglish
Title of host publicationAdvances in Information and Computer Security - First International Workshop on Security, IWSEC 2006, Proceedings
EditorsHiroshi Yoshiura, Kouichi Sakurai, Kai Rannenberg, Yuko Murayama, Shin-ichi Kawamura
Place of PublicationBerlin; Heidelberg
PublisherSpringer, Springer Nature
Pages136-151
Number of pages16
Volume4266 LNCS
ISBN (Print)3540476997, 9783540476993
Publication statusPublished - 2006
Event1st International Workshop on Security, IWSEC 2006 - Kyoto, Japan
Duration: 23 Oct 200624 Oct 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4266 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other1st International Workshop on Security, IWSEC 2006
Country/TerritoryJapan
CityKyoto
Period23/10/0624/10/06

Fingerprint

Dive into the research topics of 'Rateless codes for the multicast stream authentication problem'. Together they form a unique fingerprint.

Cite this