{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:35:24Z","timestamp":1725478524183},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693277"},{"type":"electronic","value":"9783540693284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11967668_21","type":"book-chapter","created":{"date-parts":[[2007,2,6]],"date-time":"2007-02-06T12:03:43Z","timestamp":1170763423000},"page":"324-338","source":"Crossref","is-referenced-by-count":2,"title":["Non-degrading Erasure-Tolerant Information Authentication with an Application to Multicast Stream Authentication over Lossy Channels"],"prefix":"10.1007","author":[{"given":"Yvo","family":"Desmedt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goce","family":"Jakimoski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Afanassiev, V., Gehrmann, C., Smeets, B.: Fast Message Authentication Using Efficient Polynomial Evaluation. In: Proceedings of Fast Software Encryption Workshop 1997, pp. 190\u2013204 (1997)","DOI":"10.1007\/BFb0052346"},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/302350.302353","volume":"32","author":"R. Anderson","year":"1998","unstructured":"Anderson, R., Bergadano, F., Crispo, B., Lee, J., Manifavas, C., Needham, R.: A New Family of Authentication Protocols. ACM Operating Systems Review\u00a032(4), 9\u201320 (1998)","journal-title":"ACM Operating Systems Review"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bergadano, F., Cavagnino, D., Crispo, B.: Chained Stream Authentication. In: Proceeding of Selected Areas in Cryptography 2000, pp. 142\u2013155 (2000)","DOI":"10.1007\/3-540-44983-3_11"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-48329-2_28","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"J. Bierbrauer","year":"1994","unstructured":"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.\u00a0773, pp. 331\u2013342. Springer, Heidelberg (1994)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Canneti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast security: A taxonomy and some efficient constructions. In: Infocom 1999 (1999)","DOI":"10.1109\/INFCOM.1999.751457"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal Classes of Hash Functions. Journal of Computer and System Sciences\u00a018, 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Chan, A.: A graph-theoretical analysis of multicast authentication. In: Proc. of the 23rd Int. Conf. on Distributed Computing Systems (2003)","DOI":"10.1109\/ICDCS.2003.1203462"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Cheung, S.: An Efficient Message Authentication Scheme for Link State Routing. In: Proceedings of the 13th Annual Computer Security Application Conference (1997)","DOI":"10.1109\/CSAC.1997.646178"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/11507840_22","volume-title":"Financial Cryptography and Data Security","author":"G. Crescenzo Di","year":"2005","unstructured":"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.\u00a03570, pp. 240\u2013254. Springer, Heidelberg (2005)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Frankel, Y., Yung, M.: Multi-Receiver\/Multi-Sender Network Security: Efficient Authenticated Multicast\/Feedback. In: INFOCOM, pp. 2045\u20132054 (1992)","DOI":"10.1109\/INFCOM.1992.263476"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S1389-1286(00)00169-9","volume":"35","author":"Y. Desmedt","year":"2001","unstructured":"Desmedt, Y., Safavi-Naini, R., Wang, H., Batten, L., Charnes, C., Pieprzyk, J.: Broadcast anti-jamming systems. Computer Networks\u00a035, 223\u2013236 (2001)","journal-title":"Computer Networks"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF00191355","volume":"8","author":"M. Dyer","year":"1995","unstructured":"Dyer, M., Fenner, T., Frieze, A., Thomson, A.: On key storage in secure networks. Journal of Cryptology\u00a08, 189\u2013200 (1995)","journal-title":"Journal of Cryptology"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1017\/S0963548300002121","volume":"5","author":"K. Engel","year":"1996","unstructured":"Engel, K.: Interval packing and covering in the boolean lattice. Combin. Probab. Comput.\u00a05, 373\u2013384 (1996)","journal-title":"Combin. Probab. Comput."},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BFb0052235","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"R. Gennaro","year":"1997","unstructured":"Gennaro, R., Rohatgi, P.: How to Sign Digital Streams. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 180\u2013197. Springer, Heidelberg (1997)"},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM Journal on Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR16","unstructured":"Graveman, R.F., Xie, L., Arce, G.R.: Approximate Message Authentication Codes. IEEE Transactions on Image Processing (submitted, 2000)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/11586821_21","volume-title":"Cryptography and Coding","author":"G. Jakimoski","year":"2005","unstructured":"Jakimoski, G.: Unconditionally Secure Information Authentication in Presence of Erasures. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 304\u2013321. Springer, Heidelberg (2005)"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"W.H. Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.C.: Nonrandom binary superimposed codes. IEEE Transactions on Information Theory\u00a010, 363\u2013377 (1964)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"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\u2013159 (1997)","DOI":"10.1145\/258533.258573"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Luby, M.: LT codes. In: The 43rd IEEE Symposium on Foundations of Computer Science (2002)","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"21_CR21","volume-title":"Contemporary Cryptology, The Science of Information Integrity","author":"J.L. Massey","year":"1992","unstructured":"Massey, J.L.: Contemporary Cryptology: An Introduction. In: Simmons, G.J. (ed.) Contemporary Cryptology, The Science of Information Integrity. IEEE Press, New York (1992)"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Miner, S., Staddon, J.: Graph-Based Authentication of Digital Streams. In: IEEE Symposium on Security and Privacy (2001)","DOI":"10.1109\/SECPRI.2001.924301"},{"issue":"2","key":"21_CR23","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/762476.762480","volume":"6","author":"J.M. Park","year":"2003","unstructured":"Park, J.M., Chong, E.K.P., Siegel, H.J.: Efficient Multicast Stream Authentication Using Erasure Codes. ACM Transactions on Information and System Security\u00a06(2), 258\u2013285 (2003)","journal-title":"ACM Transactions on Information and System Security"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/SECPRI.2000.848446"},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s001459900054","volume":"12","author":"K.A.S. Quinn","year":"1999","unstructured":"Quinn, K.A.S.: Bounds for key distribution patterns. Journal of Cryptology\u00a012, 227\u2013240 (1999)","journal-title":"Journal of Cryptology"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Rabin, M.: Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance. J. ACM\u00a036(2), 335\u2013348","DOI":"10.1145\/62044.62050"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-44750-4_3","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"P. Rogaway","year":"1995","unstructured":"Rogaway, P.: Bucket hashing and its application to fast message authentication. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 29\u201342. Springer, Heidelberg (1995)"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Rohatgi, P.: A compact and fast hybrid signature scheme for multicast packet authentication. In: 6th ACM Conference on Computer and Communications Security (November 1999)","DOI":"10.1145\/319709.319722"},{"key":"21_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/3-540-39568-7_32","volume-title":"Advances in Cryptology","author":"G.J. Simmons","year":"1985","unstructured":"Simmons, G.J.: Authentication Theory\/Coding Theory. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 411\u2013431. Springer, Heidelberg (1985)"},{"key":"21_CR30","volume-title":"Contemporary Cryptology, The Science of Information Integrity","author":"G.J. Simmons","year":"1992","unstructured":"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)"},{"key":"21_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/3-540-45861-1_22","volume-title":"Information Security and Cryptology - ICISC 2001","author":"R. Steinfeld","year":"2002","unstructured":"Steinfeld, R., Bull, L., Zheng, Y.: Content Extraction Signatures. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol.\u00a02288, p. 285. Springer, Heidelberg (2002)"},{"key":"21_CR32","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF00206324","volume":"1","author":"D.R. Stinson","year":"1988","unstructured":"Stinson, D.R.: Some Constructions and Bounds for Authentication Codes. Journal of Cryptology\u00a01, 37\u201351 (1988)","journal-title":"Journal of Cryptology"},{"key":"21_CR33","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02252868","volume":"2","author":"D.R. Stinson","year":"1990","unstructured":"Stinson, D.R.: The Combinatorics of Authentication and Secrecy Codes. Journal of Cryptology\u00a02, 23\u201349 (1990)","journal-title":"Journal of Cryptology"},{"key":"21_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-46766-1_4","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D.R. Stinson","year":"1992","unstructured":"Stinson, D.R.: Combinatorial Characterizations of Authentication Codes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 62\u201373. Springer, Heidelberg (1992)"},{"key":"21_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-46766-1_5","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D.R. Stinson","year":"1992","unstructured":"Stinson, D.R.: Universal Hashing and Authentication Codes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 74\u201385. Springer, Heidelberg (1992)"},{"key":"21_CR36","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"D.R. Stinson","year":"2000","unstructured":"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\u00a086, 595\u2013617 (2000)","journal-title":"Journal of Statistical Planning and Inference"},{"key":"21_CR37","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1006\/jcta.1999.3036","volume":"90","author":"D.R. Stinson","year":"2000","unstructured":"Stinson, D.R., Wei, R., Zhu, L.: Some new bounds for cover-free families. J. Combin. Theory A.\u00a090, 224\u2013234 (2000)","journal-title":"J. Combin. Theory A."},{"key":"21_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63594-7_66","volume-title":"Financial Cryptography","author":"P.F. Syverson","year":"1997","unstructured":"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.\u00a01318. Springer, Heidelberg (1997)"},{"key":"21_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11908739_10","volume-title":"Advances in Information and Computer Security","author":"C. Tartary","year":"2006","unstructured":"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.\u00a04266. Springer, Heidelberg (2006)"},{"key":"21_CR40","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M.N. Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, J.L.: New Hash Functions and Their Use in Authentication and Set Equality. Journal of Computer and System Sciences\u00a022, 265\u2013279 (1981)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR41","unstructured":"Wong, C.K., Lam, S.S.: Digital Signatures for Flaws and Multicasts. In: Proceedings of IEEE ICNP 1998 (1998)"},{"key":"21_CR42","unstructured":"Zhang, K.: Efficient Protocols for Signing Routing Messages. In: Proceedings of the Symposium on Network and Distributed System Security (1998)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11967668_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T16:58:54Z","timestamp":1683737934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11967668_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540693277","9783540693284"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/11967668_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}