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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
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)
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)
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)
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)
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)
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)
Fu, J.C., Lou, W.Y.W.: Distribution Theory of Runs and Patterns and its Applications. World Scientific Publishing, Singapore (2003)
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)
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)
Guruswami, V.: List Decoding of Error-Correcting Codes. Springer, Heidelberg (2004)
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)
Guruswami, V., Rudra, A.: Explicit capacity-achieving list-decodable codes. Technical Report TR05-133, Electronic Colloquium on Computational Complexity (November 2005)
Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory, 1757–1767 (May 1999)
Indyk, P.: List-decoding in linear time. Technical Report TR02-024, Electronic Colloquium on Computational Complexity (April 2002)
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)
Lacan, J., Fimes, J.: Systematic MDS erasure codes based on Vandermonde matrices. IEEE Communications Letters 8(9), 570–572 (2004)
Lidl, R., Niederreiter, H.: Introduction to Finite Fields and their Applications - Revised Edition. Cambridge University Press, Cambridge (2000)
Luby, M.: LT codes. In: 43rd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos (2002)
Lysyanskaya, A., Tamassia, R., Triandopoulos, N.: Multicast authentication in fully adversarial networks. In: IEEE Symposium on Security and Privacy (November 2003)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)
Maymounkov, P.: Online codes. Technical report, New York University (November 2002)
Merkle, R.: A Certified Digital Signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218–238. Springer, Heidelberg (1990)
Miner, S., Staddon, J.: Graph-based authentication of digital streams. In: IEEE Symposium on Security and Privacy, pp. 232–246 (May 2001)
Nguyen, L.: Accumulators from Bilinear Pairings and Applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275–292. Springer, Heidelberg (2005)
Nyberg, K.: Fast accumulated hashing. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 83–87. Springer, Heidelberg (1996)
Pannetrat, A., Molva, R.: Authenticating real time packet streams and multicasts. In: 7th International Symposium on Computers and Communications (July 2002)
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)
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)
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)
Paxson, V.: End-to-end Internet packet dynamics. IEEE/ACM Transactions on Networking, 277–292 (June 1999)
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)
Perrig, A., Tygar, J.D.: Secure Broadcast Communication in Wired and Wireless Networks. Kluwer Academic Publishers, Dordrecht (2003)
Pieprzyk, J., Hardjono, T., Seberry, J.: Fundamentals of Computer Security. Springer, Heidelberg (2003)
Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. Journal of Society for Industrial and Applied Mathematics 8(2), 300–304 (1960)
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)
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
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)
Shokrollahi, A.: Raptor codes. Technical report, Digital Fountain (June 2003)
Stinson, D.R.: Cryptography: Theory and Practice. CRC Press, Boca Raton (1995)
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)
Wong, C.K., Lam, S.S.: Digital signatures for flows and multicasts. IEEE/ACM Transactions on Networking 7 (August 1999)
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)
Zanotti, J.P.: Le code correcteur C.I.R.C., available online at: http://zanotti.univ-tln.fr/enseignement/divers/chapter3.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)