{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:19:19Z","timestamp":1725488359708},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540629757"},{"type":"electronic","value":"9783540690535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-69053-0_28","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:24:05Z","timestamp":1186363445000},"page":"409-421","source":"Crossref","is-referenced-by-count":10,"title":["Almost k-wise Independent Sample Spaces and Their Cryptologic Applications"],"prefix":"10.1007","author":[{"given":"Kaoru","family":"Kurosawa","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Johansson","sequence":"additional","affiliation":[]},{"given":"Douglas","family":"Stinson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"N. Alon, O. Goldreich, J. Hastad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms 3 (1992), 289\u2013304.","journal-title":"Random Structures and Algorithms"},{"key":"28_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-68697-5_2","volume-title":"Universal hashing and multiple authentication","author":"M. Atici","year":"1996","unstructured":"M. Atici and D. R. Stinson. Universal hashing and multiple authentication. Lecture Notes in Computer Science 1109 (1996), 16\u201330 (CRYPTO\u2019 96)."},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C. H. Bennett","year":"1988","unstructured":"C. H. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion. SIAM Journal on Computing 17 (1988), 210\u2013229.","journal-title":"SIAM Journal on Computing"},{"key":"28_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/3-540-48658-5_24","volume-title":"Bounds for resilient functions and orthogonal arrays","author":"J. Bierbrauer","year":"1994","unstructured":"J. Bierbrauer, K. Gopalakrishnan and D. R. Stinson. Bounds for resilient functions and orthogonal arrays. Lecture Notes in Computer Science 839 (1994), 247\u2013257 (CRYPTO\u2019 94)."},{"key":"28_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-48329-2_28","volume-title":"On families of hash functions via geometric codes and concatenation","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. Lecture Notes in Computer Science 773 (1994), 331\u2013342 (CRYPTO\u2019 93)."},{"key":"28_CR6","unstructured":"A. E. Brouwer. Bounds on the minimum distance of binary linear codes. http:\/\/www.win.tue.nl\/win\/math\/dw\/voorlincod.html"},{"key":"28_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/3-540-68697-5_28","volume-title":"Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations","author":"P. Camion","year":"1996","unstructured":"P. Camion and A. Canteaut. Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations. Lecture Notes in Computer Science 1109 (1996), 372\u2013386 (CRYPTO\u2019 96)."},{"key":"28_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/3-540-46766-1_6","volume-title":"On correlation-immune functions","author":"P. Camion","year":"1992","unstructured":"P. Camion, C. Carlet, P. Charpin and N. Sendrier. On correlation-immune functions. Lecture Notes in Computer Science 576 (1992), 86\u2013100 (CRYPTO\u2019 91)."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"L. Carlitz and S. Uchiyama. Bounds on exponential sums. Duke Math. Journal, (1957), 37\u201341.","DOI":"10.1215\/S0012-7094-57-02406-7"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"B. Chor, O. Goldreich, J. Hastad, J. Friedman, S Rudich and R. Smolensky. The bit extraction problem or t-resilient functions. 26th IEEE symposium on Foundations of Computer Science, pages 396\u2013407, 1985.","DOI":"10.1109\/SFCS.1985.55"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"J. Friedman. On the bit extraction problem. 33rd IEEE symposium on Foundations of Computer Science, pages 314\u2013319, 1992.","DOI":"10.1109\/SFCS.1992.267760"},{"key":"28_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-68697-5_3","volume-title":"Universal hash functions from exponential sums over finite fields and Galois rings","author":"T. Helleseth","year":"1996","unstructured":"T. Helleseth and T. Johansson. Universal hash functions from exponential sums over finite fields and Galois rings. Lecture Notes in Computer Science 1109 (1996), 31\u201344 (CRYPTO\u2019 96)."},{"key":"28_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-49264-X_24","volume-title":"New hash functions for message authentication","author":"H. Krawczyk","year":"1995","unstructured":"H. Krawczyk. New hash functions for message authentication. Lecture Notes in Computer Science 921 (1995), 301\u2013310 (EUROCRYPT\u2019 95)."},{"key":"28_CR14","unstructured":"F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1977."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"J. L. Massey. Cryptography \u2014 A selective survey. Digital Communications, North-Holland (1986), 3\u201321.","DOI":"10.1016\/S0029-6465(22)00409-1"},{"key":"28_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/0-387-34805-0_11","volume-title":"Perfect local randomness in pseudo-random sequences","author":"U. M. Maurer","year":"1990","unstructured":"U. M. Maurer and J. L. Massey. Perfect local randomness in pseudo-random sequences. Lecture Notes in Computer Science 435 (1990), 100\u2013112 (CRYPTO\u2019 89)."},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"J. Naor and M. Naor. Small bias probability spaces: efficient constructions and applications. SIAM Journal on Computing 22 (1993), 838\u2013856.","journal-title":"SIAM Journal on Computing"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1137\/0222045","volume":"22","author":"H. Niederreiter","year":"1993","unstructured":"H. Niederreiter and C. P. Schnorr. Local randomness in polynomial random number and random function generators. SIAM Journal on Computing 22 (1993), 684\u2013694.","journal-title":"SIAM Journal on Computing"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1109\/TIT.1984.1056949","volume":"30","author":"T. Siegenthaler","year":"1984","unstructured":"T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Trans. Inform. Theory 30 (1984), 776\u2013780.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"28_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/3-540-45961-8_19","volume-title":"On the construction of random number generators and random function generators","author":"C. P. Schnorr","year":"1988","unstructured":"C. P. Schnorr. On the construction of random number generators and random function generators. Lecture Notes in Computer Science 330 (1988), 225\u2013232 (EUROCRYPT\u2019 88)."},{"key":"28_CR21","first-page":"413","volume":"34","author":"G.J. Simmons","year":"1982","unstructured":"G.J. Simmons. A game theory model of digital message authentication. Congressus Numeratium 34 (1982), 413\u2013424.","journal-title":"Congressus Numeratium"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/3-540-39568-7_32","volume":"196","author":"G.J. Simmons","year":"1985","unstructured":"G.J. Simmons. Authentication theory\/coding theory, Lecture Notes in Computer Science. 196 (1985), 411\u2013431 (CRYPTO\u2019 84).","journal-title":"Lecture Notes in Computer Science"},{"key":"28_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-46766-1_5","volume-title":"Universal hashing and authentication codes","author":"D. R. Stinson","year":"1992","unstructured":"D. R. Stinson. Universal hashing and authentication codes. Lecture Notes in Computer Science 576 (1992), 74\u201385 (CRYPTO\u2019 91)."},{"key":"28_CR24","first-page":"105","volume":"92","author":"D. R. Stinson","year":"1993","unstructured":"D. R. Stinson. Resilient functions and large set of orthogonal arrays. Congressus Numerantium 92 (1993), 105\u2013110.","journal-title":"Congressus Numerantium"},{"key":"28_CR25","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00202271","volume":"8","author":"D. R. Stinson","year":"1995","unstructured":"D. R. Stinson and J. L. Massey. An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions. Journal of Cryptology 8 (1995), 167\u2013173.","journal-title":"Journal of Cryptology"},{"key":"28_CR26","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 22 (1981), 265\u2013279.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69053-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T17:59:10Z","timestamp":1684000750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69053-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629757","9783540690535"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-69053-0_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1997]]}}}