Skip to main content
Springer Nature Link
Log in

Non-degrading Erasure-Tolerant Information Authentication with an Application to Multicast Stream Authentication over Lossy Channels

  • Conference paper
Topics in Cryptology – CT-RSA 2007 (CT-RSA 2007)

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

Included in the following conference series:

  • 1164 Accesses

Abstract

The concept of erasure-tolerant information authentication was recently introduced to study an unconditionally secure setting where it is allowed to lose a limited number of message letters during transmission. Even if a part of the message is lost, the verifier will still be able to check the authenticity of some or all of the received message letters. In general, there might be some letters whose authenticity cannot be verified although they have arrived at the recipient’s side. These letters will be discarded.

We consider a special case when the verifier can always check the authenticity of all received message letters. This property is desirable since no data will be lost due to the verifier’s inability to verify its authenticity (i.e., the scheme does not introduce additional degradation of the quality of the received information). We provide necessary and sufficient conditions for a set system based erasure-tolerant authentication scheme to be non-degrading. We also discuss efficient implementations and propose a provably secure stream authentication scheme that makes use of erasure-tolerant authentication codes.

This research was done while the authors were at Florida State University, sponsored by NSF CCR-0209092.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Afanassiev, V., Gehrmann, C., Smeets, B.: Fast Message Authentication Using Efficient Polynomial Evaluation. In: Proceedings of Fast Software Encryption Workshop 1997, pp. 190–204 (1997)

    Google Scholar 

  2. Anderson, R., Bergadano, F., Crispo, B., Lee, J., Manifavas, C., Needham, R.: A New Family of Authentication Protocols. ACM Operating Systems Review 32(4), 9–20 (1998)

    Article  Google Scholar 

  3. Bergadano, F., Cavagnino, D., Crispo, B.: Chained Stream Authentication. In: Proceeding of Selected Areas in Cryptography 2000, pp. 142–155 (2000)

    Google Scholar 

  4. Bierbrauer, J., Johansson, T., Kabatianskii, G., Smeets, B.: On Families of Hash Functions Via Geometric Codes and Concatenation. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 331–342. Springer, Heidelberg (1994)

    Google Scholar 

  5. Canneti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast security: A taxonomy and some efficient constructions. In: Infocom 1999 (1999)

    Google Scholar 

  6. Carter, J.L., Wegman, M.N.: Universal Classes of Hash Functions. Journal of Computer and System Sciences 18, 143–154 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chan, A.: A graph-theoretical analysis of multicast authentication. In: Proc. of the 23rd Int. Conf. on Distributed Computing Systems (2003)

    Google Scholar 

  8. Cheung, S.: An Efficient Message Authentication Scheme for Link State Routing. In: Proceedings of the 13th Annual Computer Security Application Conference (1997)

    Google Scholar 

  9. Di Crescenzo, G., Graveman, R., Ge, R., Arce, G.: Approximate Message Authentication and Biometric Entity Authentication. In: S. Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol. 3570, pp. 240–254. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Desmedt, Y., Frankel, Y., Yung, M.: Multi-Receiver/Multi-Sender Network Security: Efficient Authenticated Multicast/Feedback. In: INFOCOM, pp. 2045–2054 (1992)

    Google Scholar 

  11. Desmedt, Y., Safavi-Naini, R., Wang, H., Batten, L., Charnes, C., Pieprzyk, J.: Broadcast anti-jamming systems. Computer Networks 35, 223–236 (2001)

    Article  Google Scholar 

  12. Dyer, M., Fenner, T., Frieze, A., Thomson, A.: On key storage in secure networks. Journal of Cryptology 8, 189–200 (1995)

    Article  MATH  Google Scholar 

  13. Engel, K.: Interval packing and covering in the boolean lattice. Combin. Probab. Comput. 5, 373–384 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  14. Gennaro, R., Rohatgi, P.: How to Sign Digital Streams. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 180–197. Springer, Heidelberg (1997)

    Google Scholar 

  15. Goldwasser, S., Micali, S., Rivest, R.: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM Journal on Computing 17(2), 281–308 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  16. Graveman, R.F., Xie, L., Arce, G.R.: Approximate Message Authentication Codes. IEEE Transactions on Image Processing (submitted, 2000)

    Google Scholar 

  17. Jakimoski, G.: Unconditionally Secure Information Authentication in Presence of Erasures. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 304–321. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Kautz, W.H., Singleton, R.C.: Nonrandom binary superimposed codes. IEEE Transactions on Information Theory 10, 363–377 (1964)

    Article  MATH  Google Scholar 

  19. Luby, M., Mitzenmacher, M., Shokrollahi, M.A., Spielman, D.A., Stemann, V.: Practical Loss-Resilient Codes. In: Proc. 29th Symp. on Theory of Computing, pp. 150–159 (1997)

    Google Scholar 

  20. Luby, M.: LT codes. In: The 43rd IEEE Symposium on Foundations of Computer Science (2002)

    Google Scholar 

  21. Massey, J.L.: Contemporary Cryptology: An Introduction. In: Simmons, G.J. (ed.) Contemporary Cryptology, The Science of Information Integrity. IEEE Press, New York (1992)

    Google Scholar 

  22. Miner, S., Staddon, J.: Graph-Based Authentication of Digital Streams. In: IEEE Symposium on Security and Privacy (2001)

    Google Scholar 

  23. 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(2), 258–285 (2003)

    Article  Google Scholar 

  24. Perrig, A., Canneti, R., Tygar, J.D., Song, D.: Efficient Authentication and Signing of Multicast Streams Over Lossy Channels. In: Proceedings of the IEEE Security and Privacy Symposium (2000)

    Google Scholar 

  25. Quinn, K.A.S.: Bounds for key distribution patterns. Journal of Cryptology 12, 227–240 (1999)

    Article  MATH  Google Scholar 

  26. Rabin, M.: Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance. J. ACM 36(2), 335–348

    Google Scholar 

  27. Rogaway, P.: Bucket hashing and its application to fast message authentication. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 29–42. Springer, Heidelberg (1995)

    Google Scholar 

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

    Google Scholar 

  29. Simmons, G.J.: Authentication Theory/Coding Theory. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 411–431. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  30. Simmons, G.J.: A Survey of Information Authentication. In: Simmons, G.J. (ed.) Contemporary Cryptology, The Science of Information Integrity. IEEE Press, New York (1992)

    Google Scholar 

  31. Steinfeld, R., Bull, L., Zheng, Y.: Content Extraction Signatures. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol. 2288, p. 285. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  32. Stinson, D.R.: Some Constructions and Bounds for Authentication Codes. Journal of Cryptology 1, 37–51 (1988)

    MATH  MathSciNet  Google Scholar 

  33. Stinson, D.R.: The Combinatorics of Authentication and Secrecy Codes. Journal of Cryptology 2, 23–49 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  34. Stinson, D.R.: Combinatorial Characterizations of Authentication Codes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 62–73. Springer, Heidelberg (1992)

    Google Scholar 

  35. Stinson, D.R.: Universal Hashing and Authentication Codes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 74–85. Springer, Heidelberg (1992)

    Google Scholar 

  36. Stinson, D.R., van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. Journal of Statistical Planning and Inference 86, 595–617 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  37. Stinson, D.R., Wei, R., Zhu, L.: Some new bounds for cover-free families. J. Combin. Theory A. 90, 224–234 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  38. Syverson, P.F., Stubblebine, S.G., Goldschlag, D.M.: Unlinkable serial transactions. In: Luby, M., Rolim, J.D.P., Serna, M. (eds.) FC 1997. LNCS, vol. 1318. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  39. Tartary, C., Wang, H.: Rateless Codes for the Multicast Stream Authentication Problem. In: Yoshiura, H., Sakurai, K., Rannenberg, K., Murayama, Y., Kawamura, S.-i. (eds.) IWSEC 2006. LNCS, vol. 4266. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  40. Wegman, M.N., Carter, J.L.: New Hash Functions and Their Use in Authentication and Set Equality. Journal of Computer and System Sciences 22, 265–279 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  41. Wong, C.K., Lam, S.S.: Digital Signatures for Flaws and Multicasts. In: Proceedings of IEEE ICNP 1998 (1998)

    Google Scholar 

  42. Zhang, K.: Efficient Protocols for Signing Routing Messages. In: Proceedings of the Symposium on Network and Distributed System Security (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University College London, Gower Street, London, WC1E 6BT, United Kingdom

    Yvo Desmedt

  2. Department of Electrical and Computer Engineering, Burchard 212, Stevens Institute of Technology, Hoboken, NJ, 07030, USA

    Goce Jakimoski

Authors
  1. Yvo Desmedt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Goce Jakimoski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Sharing Platform Laboratories, NTT Corporation, Japan

    Masayuki Abe

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Desmedt, Y., Jakimoski, G. (2006). Non-degrading Erasure-Tolerant Information Authentication with an Application to Multicast Stream Authentication over Lossy Channels. In: Abe, M. (eds) Topics in Cryptology – CT-RSA 2007. CT-RSA 2007. Lecture Notes in Computer Science, vol 4377. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11967668_21

Download citation

  • DOI: https://doi.org/10.1007/11967668_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69327-7

  • Online ISBN: 978-3-540-69328-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics