Rateless codes for the multicast stream authentication problem

  • Authors:
  • Christophe Tartary;Huaxiong Wang

  • Affiliations:
  • Division of ICS, Department of Computing, Macquarie University, NSW, Australia;Division of ICS, Department of Computing, Macquarie University, NSW, Australia

  • Venue:
  • IWSEC'06 Proceedings of the 1st international conference on Security
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.