{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T15:33:19Z","timestamp":1785771199360,"version":"3.56.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7047,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,4]]},"DOI":"10.1016\/s0022-0000(05)80007-8","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"337-346","source":"Crossref","is-referenced-by-count":40,"title":["Combinatorial techniques for universal hashing"],"prefix":"10.1016","volume":"48","author":[{"given":"D.R.","family":"Stinson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80007-8_bib1","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","article-title":"Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes","volume":"36","author":"Babai","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80007-8_bib2","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0217014","article-title":"Privacy amplification by public discussion","volume":"17","author":"Bennett","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80007-8_bib3","series-title":"Design Theory","author":"Beth","year":"1985"},{"key":"10.1016\/S0022-0000(05)80007-8_bib4","first-page":"105","article-title":"A note on the resolvability of balanced incomplete block designs","volume":"6","author":"Bose","year":"1942","journal-title":"Sankhy\u0101"},{"key":"10.1016\/S0022-0000(05)80007-8_bib5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","volume":"18","author":"Carter","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80007-8_bib6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/66443.66446","article-title":"Applications of combinatorial designs in computer science","volume":"21","author":"Colbourn","year":"1989","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0022-0000(05)80007-8_bib7","series-title":"Proceedings, Eighteenth Annual ACM Symp. Theory of Comput.","first-page":"59","article-title":"Private coins versus public coins in interactive proof systems","author":"Goldwasser","year":"1986"},{"key":"10.1016\/S0022-0000(05)80007-8_bib8","series-title":"Proceedings 30th IEEE Symp. on Foundations of Computer Science","first-page":"248","article-title":"How to recycle random bits","author":"Impagliazzo","year":"1989"},{"key":"10.1016\/S0022-0000(05)80007-8_bib9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(87)90010-7","article-title":"A probabilistic distributed algorithm for set intersection and its analysis","volume":"49","author":"Kurtz","year":"1987","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S0022-0000(05)80007-8_bib10","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","article-title":"A simple parallel algorithm for the maximal independent set problem","volume":"15","author":"Luby","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80007-8_bib11","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0022-0000(05)80007-8_bib12","series-title":"Proceedings, 22nd Annual ACM Symp. Theory of Comput.","first-page":"235","article-title":"The computational complexity of universal hashing","author":"Mansour","year":"1990"},{"key":"10.1016\/S0022-0000(05)80007-8_bib13","series-title":"Proceedings, 22nd Annual ACM Symp. Theory of Comput.","first-page":"204","article-title":"Pseudorandom generators for space-bounded computation","author":"Nisan","year":"1990"},{"key":"10.1016\/S0022-0000(05)80007-8_bib14","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1093\/biomet\/33.4.305","article-title":"The design of optimum multi-factorial experiments","volume":"33","author":"Plackett","year":"1945","journal-title":"Biometrika"},{"key":"10.1016\/S0022-0000(05)80007-8_bib15","first-page":"67","article-title":"Hypercubes of strength \u201cd\u201d leading to confounded designs in factorial experiments","volume":"38","author":"Rao","year":"1946","journal-title":"Bull. Calcutta Math. Soc."},{"key":"10.1016\/S0022-0000(05)80007-8_bib16","series-title":"Proceedings, 22nd Annual ACM Symp. Theory of Comput.","first-page":"387","article-title":"One-way functions are necessary and sufficient for secure signatures","author":"Rompel","year":"1990"},{"key":"10.1016\/S0022-0000(05)80007-8_bib17","first-page":"41","article-title":"A note on universal classes of hash functions","volume":"10","author":"Sarwate","year":"1980"},{"key":"10.1016\/S0022-0000(05)80007-8_bib18","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0022-0000(88)90010-4","article-title":"Graph isomorphism is in the low hierarchy","volume":"37","author":"Sch\u00f6ning","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80007-8_bib19","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01835977","article-title":"Affine resolvable balanced incomplete block designs: A survey","volume":"14","author":"Shrikhande","year":"1976","journal-title":"Aequationes Math."},{"key":"10.1016\/S0022-0000(05)80007-8_bib20","series-title":"Proceedings, Fifteenth Annual ACM Symp. Theory of Comput.","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983"},{"key":"10.1016\/S0022-0000(05)80007-8_bib21","first-page":"74","article-title":"Universal hashing and authentication codes, Designs, codes and cryptography, to appear; preliminary version appeared","volume":"Vol. 576","author":"Stinson","year":"1992"},{"key":"10.1016\/S0022-0000(05)80007-8_bib22","series-title":"Combinatorics of Experimental Design","author":"Street","year":"1987"},{"key":"10.1016\/S0022-0000(05)80007-8_bib23","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","article-title":"NP is as easy as detecting unique solutions","volume":"47","author":"Valiant","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80007-8_bib24","series-title":"Combinatorial Designs","author":"Wallis","year":"1988"},{"key":"10.1016\/S0022-0000(05)80007-8_bib25","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","article-title":"New hash functions and their use in authentication and set equality","volume":"22","author":"Wegman","year":"1981","journal-title":"J. Comput. System Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800078?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800078?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:27:40Z","timestamp":1548196060000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["S0022000005800078"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80007-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}