{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:59:52Z","timestamp":1787504392988,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679073","type":"print"},{"value":"9783540445982","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44598-6_33","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T06:15:21Z","timestamp":1178000121000},"page":"533-543","source":"Crossref","is-referenced-by-count":15,"title":["Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Bierbrauer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Holger","family":"Schellwat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables, Random Structures and Algorithms 3 (1992), 289\u2013304, preliminary version: Symposium 31st FOCS 1990, 544\u2013553","journal-title":"Random Structures and Algorithms"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1008226810363","volume":"11","author":"J. Bierbrauer","year":"1997","unstructured":"Bierbrauer, J.: Universal hashing and geometric codes, Designs, Codes and Cryptography 11 (1997), 207\u2013221","journal-title":"Designs, Codes and Cryptography"},{"key":"33_CR3","first-page":"139","volume":"51","author":"J. Bierbrauer","year":"1998","unstructured":"Bierbrauer, J.: Authentication via algebraic-geometric codes, in: Recent Progress in Geometry, Supplemento ai Rendiconti del Circolo Matematico di Palermo 51 (1998), 139\u2013152","journal-title":"Recent Progress in Geometry, Supplemento ai Rendiconti del Circolo Matematico di Palermo"},{"key":"33_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-48329-2_28","volume-title":"Proceedings CRYPTO 93","author":"J. Bierbrauer","year":"1994","unstructured":"Bierbrauer, J., Johansson, T., Kabatiansky, G., Smeets, B.: On families of hash functions via geometric codes and concatenation, Proceedings CRYPTO 93, Lecture Notes in Computer Science 773 (1994), 331\u2013342"},{"key":"33_CR5","unstructured":"Bierbrauer, J., Schellwat, H.: Weakly biased arrays, almost independent arrays and error-correcting codes, submitted for publication in the Proceedings of AMS-DIMACS."},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1145\/227683.227686","volume":"42","author":"J. Boyar","year":"1995","unstructured":"Boyar, J., Brassard, G., Peralta, R.: Subquadratic zero-knowledge, JACM 42 (1995), 1169\u20131193","journal-title":"JACM"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1109\/18.556673","volume":"42","author":"G. Brassard","year":"1996","unstructured":"Brassard, G., C\u0155epeau, C., Santha, M.: Oblivious transfers and intersecting codes, IEEE Transactions on Information Theory 42 (1996), 1769\u20131780","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1215\/S0012-7094-57-02406-7","volume":"24","author":"L. Carlitz","year":"1957","unstructured":"Carlitz, L., Uchiyama, S.: Bounds for exponential sums, Duke Mathematical Journal 24 (1957), 37\u201341","journal-title":"Duke Mathematical Journal"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/18.340462","volume":"40","author":"G. D. Cohen","year":"1994","unstructured":"Cohen, G. D., Z\u00e9mor, G.: Intersecting codes and independent families, IEEE Transactions on Information Theory 40 (1994), 1872\u20131881","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Gal, A.: A characterization of span program size and improved lower bounds for monotone span programs, Proceedings 13th Symposium of the Theory of Computing (1998), 429\u2013437","DOI":"10.1145\/276698.276855"},{"key":"33_CR11","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, J.Computer and System Sci. 18 (1979), 143\u2013154","journal-title":"J.Computer and System Sci"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF01810849","volume":"1","author":"J. P. Hansen","year":"1990","unstructured":"Hansen, J. P., Stichtenoth, H.: Group codes on certain algebraic curves with many rational points, AAECC 1 (1990), 67\u201377","journal-title":"AAECC"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Helleseth, T., Johansson, T.: Universal hash functions from exponential sums over finite fields and Galois rings, Lecture Notes in Computer Science 1109 (1996), 31\u201344 (CRYPTO 96)","DOI":"10.1007\/3-540-68697-5_3"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TIT.1972.1054893","volume":"18","author":"J. Justesen","year":"1972","unstructured":"Justesen, J.: A class of asymptotically good algebraic codes, IEEE Transactions on Information Theory 18 (1972), 652\u2013656","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TIT.1984.1056879","volume":"30","author":"G. L. Katsman","year":"1984","unstructured":"Katsman, G. L., Tsfasman, M. A., Vladut, S. G.: Modular curves and codes with a polynomial construction, IEEE Transaction on Information Theory 30 (1984), 353\u2013355","journal-title":"IEEE Transaction on Information Theory"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Johansson, T., Stinson, D.: Almost k-wise independent sample spaces and their cryptologic applications, Lecture Notes in Computer Science 1233 (1997), 409\u2013421 (Advances in Cryptology, Eurocrypt 97)","DOI":"10.1007\/3-540-69053-0_28"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Lu, C. J.: Improved pseudorandom generators for combinatorial rectangles, Proceedings of the 25\u266ath International Colloquium on Automata, Languages and Programming (1998), 223\u2013234","DOI":"10.1007\/BFb0055056"},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications, SIAM Journal on Computing 22 (1993), 838\u2013856, preliminary version: Proceedings STOC 1990, 213\u2013223","journal-title":"SIAM Journal on Computing"},{"key":"33_CR19","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1145\/258533.258581","volume":"29","author":"M. Naor","year":"1997","unstructured":"Naor, M., Reingold, O.: On the construction of pseudo-random permutations: Luby-Rackoff revisited, Proceedings STOC 29 (1997), 189\u2013199","journal-title":"Proceedings STOC"},{"key":"33_CR20","first-page":"2135","volume":"63","author":"L. H. Ozarow","year":"1984","unstructured":"Ozarow, L. H., Wyner, A. D.: Wire-Tap Channel II, AT&T Bell Laboratories Technical Journal 63 (1984), 2135\u20132157","journal-title":"Technical Journal"},{"key":"33_CR21","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/18.179365","volume":"39","author":"B. Z. Shen","year":"1993","unstructured":"Shen, B. Z.: A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate, IEEE Transactions on Information Theory 39 (1993), 239\u2013242","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR22","first-page":"413","volume":"34","author":"G. J. Simmons","year":"1992","unstructured":"Simmons, G. J.: A game theory model of digital message authentication, Congressus Numerantium 34 (1992), 413\u2013424","journal-title":"Congressus Numerantium"},{"key":"33_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/3-540-39568-7_32","volume-title":"Advances in Cryptology, Proceedings of Crypto 84","author":"G. J. Simmons","year":"1985","unstructured":"Simmons, G. J.: Authentication theory\/coding theory, in: Advances in Cryptology, Proceedings of Crypto 84, Lecture Notes in Computer Science 196 (1985), 411\u2013431"},{"key":"33_CR24","unstructured":"Stichtenoth, H.: Algebraic function fields and codes, Springer 1993."},{"key":"33_CR25","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, J.Computer and System Sci. 22 (1981), 265\u2013279","journal-title":"J.Computer and System Sci."},{"key":"33_CR26","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/18.133259","volume":"37","author":"V. K. Wei","year":"1991","unstructured":"Wei, V. K.: Generalized Hamming weights for linear codes, IEEE Transactions on Information Theory 37 (1991), 1412\u20131418","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR27","first-page":"3","volume":"7","author":"V. V. Zyablov","year":"1971","unstructured":"Zyablov, V. V.: An estimate of the complexity of constructing binary linear cascade codes, Problems in Information transmission 7 (1971), 3\u201310","journal-title":"Problems in Information transmission"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44598-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T21:23:16Z","timestamp":1628803396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44598-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679073","9783540445982"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-44598-6_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}