Skip to main content
SpringerLink
Log in

Achieving Multicast Stream Authentication Using MDS Codes

  • Conference paper
Cryptology and Network Security (CANS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 4301))

Included in the following conference series:

Abstract

We address the multicast stream authentication problem when the communication channel is under the control of an opponent who can drop, reorder or inject data. In such a network model, packet overhead and computing efficiency are important parameters to be taken into account when designing a multicast authentication protocol. Our construction will exhibit three main advantages. First, our packet overhead will only be a few hashes long. Second, we will exhibit a number of signature verifications to be performed by the receivers which will turn to be O(1). Third, every receiver will still be able to recover all the data packets emitted by the sender despite losses and injections occurred during the transmission of information.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Al-Ibrahim, M., Pieprzyk, J.: Authenticating Multicast Streams in Lossy Channels Using Threshold Techniques. In: Lorenz, P. (ed.) ICN 2001. LNCS, vol. 2094, pp. 239–249. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Alon, N., Edmonds, J., Luby, M.: Linear time erasure codes with nearly optimal recovery (extended abstract). In: 36th Annual Symposium on Foundations of Computer Science, October 1995, pp. 512–519 (1995)

    Google Scholar 

  3. Barić, N., Pfitzmann, B.: Collision-Free Accumulators and Fail-Stop Signature Schemes without Trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 480–494. Springer, Heidelberg (1997)

    Google Scholar 

  4. Benaloh, J., de Mare, M.: One-Way Accumulators: A Decentralized Alternative to Digital Signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 274–285. Springer, Heidelberg (1994)

    Google Scholar 

  5. Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly-Secure Key Distribution for Dynamic Conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)

    Google Scholar 

  6. Dana, A.F., Gowaikar, R., Palanki, R., Hassibi, B., Effros, M.: Capacity of wireless erasure networks. IEEE Transactions on Information Theory 52(3), 789–804 (2006)

    Article  MathSciNet  Google Scholar 

  7. Desmedt, Y., Frankel, Y., Yung, M.: Multi-receiver/multi-sender network security: Efficient authenticated multicast/feedback. In: INFOCOM 1992, vol. 3, pp. 2045–2054 (May 1992)

    Google Scholar 

  8. Fu, J.C., Lou, W.Y.W.: Distribution Theory of Runs and Patterns and its Applications. World Scientific Publishing, Singapore (2003)

    MATH  Google Scholar 

  9. Gao, C., Yao, Z.: How to authenticate real time streams using improved online/offline signatures. In: Desmedt, Y.G., Wang, H., Mu, Y., Li, Y. (eds.) CANS 2005. LNCS, vol. 3810, pp. 134–146. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Golle, P., Modadugu, N.: Authenticating streamed data in the presence of random packet loss. In: Proceedings of the Symposium on Network and Distributed Systems Security (NDSS 2001), pp. 13–22. Internet Society (February 2001)

    Google Scholar 

  11. Guruswami, V.: List Decoding of Error-Correcting Codes. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  12. Guruswami, V., Indyk, P.: Linear-time decoding in error-free settings (extended abstract). In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 695–707. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Guruswami, V., Rudra, A.: Explicit capacity-achieving list-decodable codes. Technical Report TR05-133, Electronic Colloquium on Computational Complexity (November 2005)

    Google Scholar 

  14. Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory, 1757–1767 (May 1999)

    Google Scholar 

  15. Indyk, P.: List-decoding in linear time. Technical Report TR02-024, Electronic Colloquium on Computational Complexity (April 2002)

    Google Scholar 

  16. Karlof, C., Sastry, N., Li, Y., Perrig, A., Tygar, J.D.: Distillation codes and applications to DoS resistant multicast authentication. In: 11th Network and Distributed Systems Security Symposium (NDSS) (February 2004)

    Google Scholar 

  17. Lacan, J., Fimes, J.: Systematic MDS erasure codes based on Vandermonde matrices. IEEE Communications Letters 8(9), 570–572 (2004)

    Article  Google Scholar 

  18. Lidl, R., Niederreiter, H.: Introduction to Finite Fields and their Applications - Revised Edition. Cambridge University Press, Cambridge (2000)

    Google Scholar 

  19. Luby, M.: LT codes. In: 43rd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos (2002)

    Google Scholar 

  20. Lysyanskaya, A., Tamassia, R., Triandopoulos, N.: Multicast authentication in fully adversarial networks. In: IEEE Symposium on Security and Privacy (November 2003)

    Google Scholar 

  21. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)

    MATH  Google Scholar 

  22. Maymounkov, P.: Online codes. Technical report, New York University (November 2002)

    Google Scholar 

  23. Merkle, R.: A Certified Digital Signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218–238. Springer, Heidelberg (1990)

    Google Scholar 

  24. Miner, S., Staddon, J.: Graph-based authentication of digital streams. In: IEEE Symposium on Security and Privacy, pp. 232–246 (May 2001)

    Google Scholar 

  25. Nguyen, L.: Accumulators from Bilinear Pairings and Applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275–292. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  26. Nyberg, K.: Fast accumulated hashing. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 83–87. Springer, Heidelberg (1996)

    Google Scholar 

  27. Pannetrat, A., Molva, R.: Authenticating real time packet streams and multicasts. In: 7th International Symposium on Computers and Communications (July 2002)

    Google Scholar 

  28. Park, J.M., Chong, E.K.P., Siegel, H.J.: Efficient multicast packet authentication using signature amortization. In: IEEE Symposium on Security and Privacy, pp. 227–240 (May 2002)

    Google Scholar 

  29. Park, J.M., Chong, E.K.P., Siegel, H.J.: Efficient multicast stream authentication using erasure codes. ACM Transactions on Information and System Security 6, 258–285 (2003)

    Article  Google Scholar 

  30. Park, Y., Cho, Y.: The eSAIDA Stream Authentication Scheme. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3046, pp. 799–807. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  31. Paxson, V.: End-to-end Internet packet dynamics. IEEE/ACM Transactions on Networking, 277–292 (June 1999)

    Google Scholar 

  32. Perrig, A., Canetti, R., Tygar, J.D., Song, D.: Efficient authentication and signing of multicast streams over lossy channels. In: IEEE Symposium on Security and Privacy, pp. 56–73 (May 2000)

    Google Scholar 

  33. Perrig, A., Tygar, J.D.: Secure Broadcast Communication in Wired and Wireless Networks. Kluwer Academic Publishers, Dordrecht (2003)

    Google Scholar 

  34. Pieprzyk, J., Hardjono, T., Seberry, J.: Fundamentals of Computer Security. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  35. Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. Journal of Society for Industrial and Applied Mathematics 8(2), 300–304 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  36. Rohatgi, P.: A compact and fast hybrid signature scheme for multicast packet authentication. In: 6th ACM Conference on Computer and Communications Security, pp. 93–100 (1999)

    Google Scholar 

  37. Roth, R.M., Skachek, V.: Improved nearly-MDS expander codes (January 2005), available online at: http://arxiv.org/PS_cache/cs/pdf/0601/0601090.pdf

  38. Safavi-Naini, R., Wang, H.: New results on multi-receiver authentication code. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 527–541. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  39. Shokrollahi, A.: Raptor codes. Technical report, Digital Fountain (June 2003)

    Google Scholar 

  40. Stinson, D.R.: Cryptography: Theory and Practice. CRC Press, Boca Raton (1995)

    MATH  Google Scholar 

  41. Tartary, C., Wang, H.: Efficient multicast stream authentication for the fully adversarial network. In: Song, J.-S., Kwon, T., Yung, M. (eds.) WISA 2005. LNCS, vol. 3786, pp. 108–125. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  42. Wong, C.K., Lam, S.S.: Digital signatures for flows and multicasts. IEEE/ACM Transactions on Networking 7 (August 1999)

    Google Scholar 

  43. Yajnik, M., Moon, S., Kurose, J., Towsley, D.: Measurement and modeling of the temporal dependence in packet loss. In: IEEE Conference on Computer Communications, pp. 345–352. IEEE Press, Los Alamitos (1999)

    Google Scholar 

  44. Zanotti, J.P.: Le code correcteur C.I.R.C., available online at: http://zanotti.univ-tln.fr/enseignement/divers/chapter3.html

Download references

Author information

Authors and Affiliations

  1. Centre for Advanced Computing, Algorithms and Cryptography, Department of Computing, Macquarie University, NSW 2109, Australia

    Christophe Tartary & Huaxiong Wang

Authors
  1. Christophe Tartary
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huaxiong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Ecole Normale Supérieure – LIENS/CNRS/INRIA,, France

    David Pointcheval

  2. Centre for Computer and Information Security Research School of Computer Science and Software Engineering, University of Wollongong, Australia

    Yi Mu

  3. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200240, Shanghai, China

    Kefei Chen

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tartary, C., Wang, H. (2006). Achieving Multicast Stream Authentication Using MDS Codes. In: Pointcheval, D., Mu, Y., Chen, K. (eds) Cryptology and Network Security. CANS 2006. Lecture Notes in Computer Science, vol 4301. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11935070_7

Download citation

  • DOI: https://doi.org/10.1007/11935070_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49462-1

  • Online ISBN: 978-3-540-49463-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation