Date Added: Jan 2011
The authors study the multicast authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. They first study the packet authentication probability of a scheme proposed by Lysyanskaya, Tamassia and Triandopoulos in 2003 since their opponent model is based on theirs. Using a family of rateless codes called Luby Transform codes (LT codes) they design a protocol which allows any packet to be authenticated at the receiver with probability arbitrary close to 1. They 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.