{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:00:05Z","timestamp":1725494405925},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615125"},{"type":"electronic","value":"9783540686972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68697-5_2","type":"book-chapter","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T17:10:00Z","timestamp":1194541800000},"page":"16-30","source":"Crossref","is-referenced-by-count":19,"title":["Universal Hashing and Multiple Authentication"],"prefix":"10.1007","author":[{"given":"M.","family":"Atici","sequence":"first","affiliation":[]},{"given":"D. R.","family":"Stinson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"2_CR1","unstructured":"J. Bierbrauer, Universal hashing and geometric codes, to appear in Designs, Codes and Cryptography."},{"key":"2_CR2","unstructured":"J. Bierbrauer, Construction of orthogonal arrays, to appear in Journal of Statistical Planning and Inference."},{"key":"2_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-48329-2_28","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"J. Bierbrauer","year":"1994","unstructured":"J. Bierbrauer, T. Johansson, G. Kabatianskii and B. Smeets, On families of hash functions via geometric codes and concatenation, in \u201cAdvances in Cryptology \u2014 CRYPTO\u2019 93\u201d, D. R. Stinson, ed., Lecture Notes in Computer Science\n 773 (1994), 331\u2013342."},{"key":"2_CR4","first-page":"65","volume":"2","author":"B. Boer den","year":"1993","unstructured":"B. den Boer, A simple and key-economical unconditional authentication scheme, Journal of Computer Security\n 2 (1993), 65\u201371.","journal-title":"Journal of Computer Security"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53","author":"E. N. Gilbert","year":"1974","unstructured":"E. N. Gilbert, F. J. MacWilliams and N. J. A. Sloane, Codes which detect deception, Bell System Technical Journal\n 53 (1974), 405\u2013424.","journal-title":"Bell System Technical Journal"},{"key":"2_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 96","author":"T. Helleseth","year":"1996","unstructured":"T. Helleseth and T. Johansson, Universal hash functions from exponential sums over finite fields and Galois rings, in \u201cAdvances in Cryptology \u2014 CRYPTO\u2019 96\u201d, N. Koblitz, ed, Lecture Notes in Computer Science (1996)."},{"key":"2_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-48658-5_15","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 94","author":"H. Krawczyk","year":"1994","unstructured":"H. Krawczyk, LFSR-based hashing and authentication, in \u201cAdvances in Cryptology \u2014 CRYPTO\u2019 94\u201d, Y. G. Desmedt, ed., Lecture Notes in Computer Science\n 839 (1994), 129\u2013139."},{"key":"2_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-49264-X_24","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 95","author":"H. Krawczyk","year":"1995","unstructured":"H. Krawczyk, New hash functions for message authentication, in \u201cAdvances in Cryptology \u2014 EUROCRYPT\u2019 95\u201d, L. C. Guillou and J.-J. Quisquater, eds., Lecture Notes in Computer Science\n 921 (1995), 301\u2013310."},{"key":"2_CR9","unstructured":"J. L. Massey, Cryptography \u2014 a selective survey, in \u201cDigital Communications\u201d, E. Biglieri and G. Prati, eds., North-Holland, 1986, 3\u201321. [Also published in Alta Frequenza\n 55 (1986), 4\u201311.]"},{"key":"2_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-44750-4_3","volume-title":"Advances in Cryptology CRYPTO\u2019 95","author":"P. Rogaway","year":"1995","unstructured":"P. Rogaway, Bucket hashing and its application to fast message authentication, in \u201cAdvances in Cryptology CRYPTO\u2019 95\u201d, D. Coppersmith, ed., Lecture Notes in Computer Science\n 963 (1995), 29\u201342."},{"key":"2_CR11","unstructured":"G. J. Simmons, A survey of information authentication, in \u201cContemporary Cryptology, The Science of Information Integrity\u201d, G. J. Simmons, ed., IEEE Press, 1992, 379\u2013419. [Preliminary version appeared in Proceedings of the IEEE\n 76 (1988), 603\u2013620.]"},{"key":"2_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-46766-1_5","volume-title":"Advances in Cryptology CRYPTO\u2019 91","author":"D. R. Stinson","year":"1992","unstructured":"D. R. Stinson, Universal hashing and authentication codes, in \u201cAdvances in Cryptology CRYPTO\u2019 91\u201d, J. Feigenbaum, ed., Lecture Notes in Computer Science\n 576 (1992), 74\u201385."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"D. R. Stinson","year":"1994","unstructured":"D. R. Stinson, Universal hashing and authentication codes, Designs, Codes and Cryptography\n 4 (1994), 369\u2013380.","journal-title":"Designs, Codes and Cryptography"},{"key":"2_CR14","unstructured":"D. R. Stinson, On the connections between universal hashing, combinatorial designs and error-correcting codes, to appear in Congressus Numerantium\n 115 (1996). [Also appears in Electronic Colloquium on Computational Complexity, Report TR95-052.]"},{"key":"2_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/BFb0053440","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 94","author":"R. Taylor","year":"1995","unstructured":"R. Taylor, Nearly optimal unconditionally secure authentication, in \u201cAdvances in Cryptology \u2014 EUROCRYPT\u2019 94\u201d, A. De Santis, ed., Lecture Notes in Computer Science\n 950 (1995), 244\u2013253."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. N. Wegman","year":"1981","unstructured":"M. N. Wegman and J. L. Carter, New hash functions and their use in authentication and set equality, Journal of Computer and System Sciences\n 22 (1981), 265\u2013279.","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/3-540-57332-1_10","volume-title":"Advances in Cryptology \u2014 ASIACRYPT\u2019 91","author":"Y. Zheng","year":"1993","unstructured":"Y. Zheng, T. Hardjono and J. Pieprzyk, Sibling intractable function families and their applications, in \u201cAdvances in Cryptology \u2014 ASIACRYPT\u2019 91\u201d, H. Imai, R. L. Rivest and T. Matsumoto, eds., Lecture Notes in Computer Science\n 739 (1993), 124\u2013138."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68697-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T21:53:23Z","timestamp":1551045203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68697-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615125","9783540686972"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-68697-5_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1996]]}}}