{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:13:07Z","timestamp":1760955187385},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,5,26]],"date-time":"2010-05-26T00:00:00Z","timestamp":1274832000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10623-010-9408-6","type":"journal-article","created":{"date-parts":[[2010,5,25]],"date-time":"2010-05-25T01:57:54Z","timestamp":1274752674000},"page":"271-278","source":"Crossref","is-referenced-by-count":8,"title":["A trade-off between collision probability and key size in universal hashing using polynomials"],"prefix":"10.1007","volume":"58","author":[{"given":"Palash","family":"Sarkar","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,26]]},"reference":[{"key":"9408_CR1","first-page":"32","volume-title":"FSE, vol. 3557 of Lecture Notes in Computer Science","author":"D.J. Bernstein","year":"2005","unstructured":"Bernstein D.J.: The Poly1305-AES message-authentication code. In: Gilbert, H., Handschuh, H. (eds) FSE, vol. 3557 of Lecture Notes in Computer Science, pp. 32\u201349. Springer, Heidelberg (2005)"},{"key":"9408_CR2","unstructured":"Bernstein D.J.: Polynomial evaluation and message authentication (2007). http:\/\/cr.yp.to\/papers.html#pema ."},{"key":"9408_CR3","first-page":"331","volume-title":"CRYPTO, vol. 773 of Lecture Notes in Computer Science","author":"J. Bierbrauer","year":"1993","unstructured":"Bierbrauer J., Johansson T., Kabatianskii G., Smeets B.J.M.: On families of hash functions via geometric codes and concatenation. In: Stinson, D.R. (eds) CRYPTO, vol. 773 of Lecture Notes in Computer Science, pp. 331\u2013342. Springer, Heidelberg (1993)"},{"key":"9408_CR4","first-page":"216","volume-title":"CRYPTO, vol. 1666 of Lecture Notes in Computer Science","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.J. (eds) CRYPTO, vol. 1666 of Lecture Notes in Computer Science, pp. 216\u2013233. Springer, Heidelberg (1999)"},{"issue":"2","key":"9408_CR5","doi-asserted-by":"crossref","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. 18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"9408_CR6","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":"Gilbert E.N., Jessie MacWilliams F., Sloane N.J.A.: Codes which detect deception. Bell Syst. Tech. J. 53, 405\u2013424 (1974)","journal-title":"Bell Syst. Tech. J."},{"key":"9408_CR7","first-page":"172","volume-title":"Fast Software Encryption. vol. 1267 of Lecture Notes in Computer Science","author":"S. Halevi","year":"1997","unstructured":"Halevi S., Krawczyk H.: MMH: Software message authentication in the gbit\/second rates. In: Biham, E. (eds) Fast Software Encryption. vol. 1267 of Lecture Notes in Computer Science, pp. 172\u2013189. Springer, Heidelberg (1997)"},{"key":"9408_CR8","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/cpa.3160250405","volume":"25","author":"M.O. Rabin","year":"1972","unstructured":"Rabin M.O., Winograd S.: Fast evaluation of polynomials by rational preparation. Commun. Pure Appl. Math. 25, 433\u2013458 (1972)","journal-title":"Commun. Pure Appl. Math."},{"issue":"2","key":"9408_CR9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/PL00003822","volume":"12","author":"P. Rogaway","year":"1999","unstructured":"Rogaway P.: Bucket hashing and its application to fast message authentication. J. Cryptol. 12(2), 91\u2013115 (1999)","journal-title":"J. Cryptol."},{"issue":"2","key":"9408_CR10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.ipl.2008.09.012","volume":"109","author":"P. Sarkar","year":"2008","unstructured":"Sarkar P.: A general mixing strategy for the ECB-Mix-ECB mode of operation. Inform. Process. Lett. 109(2), 121\u2013123 (2008)","journal-title":"Inform. Process. Lett."},{"key":"9408_CR11","first-page":"313","volume-title":"CRYPTO, vol. 1109 of Lecture Notes in Computer Science","author":"V. Shoup","year":"1996","unstructured":"Shoup V.: On fast and provably secure message authentication based on universal hashing. In: Koblitz, N. (eds) CRYPTO, vol. 1109 of Lecture Notes in Computer Science, pp. 313\u2013328. Springer, Heidelberg (1996)"},{"issue":"4","key":"9408_CR12","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"D.R. Stinson","year":"1994","unstructured":"Stinson D.R.: Universal hashing and authentication codes. Des. Codes Cryptogr. 4(4), 369\u2013380 (1994)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"9408_CR13","doi-asserted-by":"crossref","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. 22(3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9408-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-010-9408-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9408-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:28Z","timestamp":1559231908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-010-9408-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,26]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9408"],"URL":"https:\/\/doi.org\/10.1007\/s10623-010-9408-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,26]]}}}