{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:26:48Z","timestamp":1743154008009,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341281"},{"type":"electronic","value":"9783642341298"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34129-8_27","type":"book-chapter","created":{"date-parts":[[2012,10,17]],"date-time":"2012-10-17T11:15:22Z","timestamp":1350472522000},"page":"303-310","source":"Crossref","is-referenced-by-count":2,"title":["On Security of Universal Hash Function Based Multiple Authentication"],"prefix":"10.1007","author":[{"given":"Aysajan","family":"Abidin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-68697-5_2","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M. Atici","year":"1996","unstructured":"Atici, M., Stinson, D.R.: Universal Hashing and Multiple Authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 16\u201330. Springer, Heidelberg (1996)"},{"key":"27_CR2","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. In: Proc. IEEE Int. Conf. Comput. Syst. Signal Process, Bangalore, India, pp. 175\u2013179 (1984)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11502760_3","volume-title":"Fast Software Encryption","author":"D.J. Bernstein","year":"2005","unstructured":"Bernstein, D.J.: The Poly1305-AES Message-Authentication Code. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol.\u00a03557, pp. 32\u201349. Springer, Heidelberg (2005)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11426639_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D.J. Bernstein","year":"2005","unstructured":"Bernstein, D.J.: Stronger Security Bounds for Wegman-Carter-Shoup Authenticators. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 164\u2013180. Springer, Heidelberg (2005)"},{"key":"27_CR5","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":"27_CR6","unstructured":"Black, J.: Message authentication codes. Ph.D. thesis, University of California Davis, USA (2000)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-03317-9_21","volume-title":"Fast Software Encryption","author":"J. Black","year":"2009","unstructured":"Black, J., Cochran, M.: MAC Reforgeability. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol.\u00a05665, pp. 345\u2013362. Springer, Heidelberg (2009), \n                      \n                        http:\/\/dx.doi.org\/10.1007\/978-3-642-03317-9_21"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48405-1_14","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J. Black","year":"1999","unstructured":"Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: Fast and Secure Message Authentication. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 216\u2013233. Springer, Heidelberg (1999)"},{"key":"27_CR9","first-page":"65","volume":"2","author":"B. Boer den","year":"1993","unstructured":"den Boer, B.: A simple and key-economical unconditional authentication scheme. J. Comp. Sec.\u00a02, 65\u201372 (1993)","journal-title":"J. Comp. Sec."},{"key":"27_CR10","first-page":"79","volume-title":"CRYPTO","author":"G. Brassard","year":"1982","unstructured":"Brassard, G.: On computationally secure authentication tags requiring short secret shared keys. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) CRYPTO, pp. 79\u201386. Plenum Press, New York (1982)"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. Carter","year":"1979","unstructured":"Carter, L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci.\u00a018, 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BFb0052345","volume-title":"Fast Software Encryption","author":"S. Halevi","year":"1997","unstructured":"Halevi, S., Krawczyk, H.: MMH: Software Message Authentication in the Gbit\/Second Rates. In: Biham, E. (ed.) FSE 1997. LNCS, vol.\u00a01267, pp. 172\u2013189. Springer, Heidelberg (1997)"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/978-3-540-85174-5_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"H. Handschuh","year":"2008","unstructured":"Handschuh, H., Preneel, B.: Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 144\u2013161. Springer, Heidelberg (2008), \n                      \n                        http:\/\/dx.doi.org\/10.1007\/978-3-540-85174-5_9"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-48658-5_15","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"H. Krawczyk","year":"1994","unstructured":"Krawczyk, H.: LFSR-Based Hashing and Authentication. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 129\u2013139. Springer, Heidelberg (1994)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-49264-X_24","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"H. Krawczyk","year":"1995","unstructured":"Krawczyk, H.: New Hash Functions for Message Authentication. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 301\u2013310. Springer, Heidelberg (1995)"},{"key":"27_CR16","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":"27_CR17","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1103\/PhysRevLett.85.441","volume":"85","author":"P.W. Shor","year":"2000","unstructured":"Shor, P.W., Preskill, J.: Simple proof of security of the bb84 quantum key distribution protocol. Phys. Rev. Lett.\u00a085, 441\u2013444 (2000)","journal-title":"Phys. Rev. Lett."},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-68697-5_24","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"V. Shoup","year":"1996","unstructured":"Shoup, V.: On Fast and Provably Secure Message Authentication Based on Universal Hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 313\u2013328. Springer, Heidelberg (1996)"},{"issue":"5","key":"27_CR19","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/5.4445","volume":"76","author":"G.J. Simmons","year":"1988","unstructured":"Simmons, G.J.: A survey of information authentication. Proceedings of the IEEE\u00a076(5), 603 (1988)","journal-title":"Proceedings of the IEEE"},{"key":"27_CR20","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":"27_CR21","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0022-0000(05)80007-8","volume":"48","author":"D.R. Stinson","year":"1994","unstructured":"Stinson, D.R.: Combinatorial techniques for universal hashing. J. Comput. Syst. Sci.\u00a048, 337\u2013346 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR22","first-page":"7","volume":"114","author":"D.R. Stinson","year":"1996","unstructured":"Stinson, D.R.: On the connections between universal hashing, combinatorial designs and error-correcting codes. Congressus Numerantium\u00a0114, 7\u201327 (1996)","journal-title":"Congressus Numerantium"},{"key":"27_CR23","first-page":"3","volume":"42","author":"D.R. Stinson","year":"2002","unstructured":"Stinson, D.R.: Universal hash families and the leftover hash lemma, and applications to cryptography and computing. J. Combin. Math. Combin. Comput.\u00a042, 3\u201331 (2002)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"27_CR24","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, L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci.\u00a022, 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34129-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T20:22:22Z","timestamp":1566764542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34129-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341281","9783642341298"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34129-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}