Almost &-wise independent sample spaces and their cryptologic applications

Journal of Cryptology

Volumn 14, Issue 4, 2001, Pages 231-253

  Kurosawa, Kaoru ^a   Johansson, Thomas ^a   Stinson, Douglas R ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012575273     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-001-0010-y     Document Type: Article

References (33)

1. N. Alon, O. Goldreich, J. Hastad, and R. Peralta. Simple constructions of almost A-\vise independent random variables. Random Structures and Algorithms 3 (1992), 289-304.
2. M. Atici and D. R. Stinson. Universal hashing and multiple authentication. Proceedings ofCRYPTO '96, pages 16-30. Lecture Notes in Computer Science 1109. Springer-Verlag, Berlin, 1996.
3. C. H. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion. SIAM Journal on Computing 17 (1988), 210-229.
4. J. Bierbrauer, K. Gopalakrishnan and D. R. Stinson. Bounds for resilient functions and orthogonal arrays. Proceedings ofCRYPTO '94, pages 247-257. Lecture Notes in Computer Science 839. Springer-Verlag, Berlin, 1994.
5. J. Bierbrauer, K. Gopalakrishnan and D. R. Stinson. Orthogonal arrays, resilient functions, errorcorrecting codes and linear programming bounds. SMA/ Journal on Discrete Mathematics 9 (1996), 424-452.
6. J. Bierbrauer, T. Johansson, G. Kabatianskii and B. Smeets. On families of hash functions via geometric codes and concatenation. Proceedings ofCRYPTO "93, pages 331-342. Lecture Notes in Computer Science 773. Springer-Verlag, Berlin, 1994.
7. J. Bierbrauer and H. Schelhvat. Efficient constructions of e-biased arrays, t-dependent arrays and authentication codes. Preprint.
8. J. Bierbrauer and H. Schellwat. Weakly biased arrays, weakly dependent arrays and error-correcting codes. Codes and Association Schemes, pages 3346. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 56. American Mathematical Society, Providence, RI, 2001.
9. J. Bierbrauer and H. Schellwat. Almost independent and weakly biased arrays: efficient constructions and cryptologic applications. Proceedings ofCRYPTO 2000, pages 533-543. Lecture Notes in Computer Science 1880. Springer-Verlag, Berlin, 2000.
10. A. E. Brouwer. Bounds on the minimum distance of binary linear codes, http://www.win.tue.nl/win/math/dw/voorlincod.html
11. P. Camion and A. Canteaut. Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations. Proceedings ofCRYPTO '96, pages 372-386. Lecture Notes in Computer Science 1109. Springer-Verlag, Berlin, 1996.
12. P. Camion and A. Canteaut. Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography. Designs, Codes and Cryptography 16 (1999), 121-149.
13. P. Camion, C. Carlet, P. Charpin and N. Sendrier. On correlation-immune functions. Proceedings of CRYPTO '91, pages 86-100. Lecture Notes in Computer Science 576. Springer-Verlag, Berlin, 1992.
14. L. Carlitz and S. Uchiyama. Bounds for exponential sums. Duke Mathematical Journal 24 ( 1957), 37-41.
15. B. Chor, O. Goldreich, J. Hastad, J. Friedman, S Rudich and R. Smolensky. The bit extraction problem or /-resilient functions. Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 396-407, 1985.
16. J. Friedman. On the bit extraction problem. Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pages 314-319, 1992.
17. K. Gopalakrishnan and D. R. Stinson. Three characterizations of non-binary correlation-immune and resilient functions. Designs, Codes and Cryptography 5 ( 1995), 241 -251.
18. T. Helleseth and T. Johansson. Universal hash functions from exponential sums over finite fields and Galois rings. Proceedings of CRYPTO '96, pages 31-W. Lecture Notes in Computer Science 1109. Springer-Verlag, Berlin, 1996.
19. H. Krawczyk. New hash functions for message authentication. Proceedings of EVROCRYPT '95, pages 301-310. Lecture Notes in Computer Science 921. Springer-Verlag, Berlin, 1995.
20. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1977.
21. J. L. Massey. Cryptography -a selective survey. In Digital Communications, pages 3-21. North-Holland, Amsterdam, 1986.
22. U. M. Maurer and J. L. Massey. Local randomness in pseudo-random sequences. Journal ofCryptology 4(1991), 135-149.
23. J. Naor and M. Naor. Small bias probability spaces: efficient constructions and applications. SIAM Journal on Computing 22 (1993), 838-856.
24. H. Niederreiter and C. P. Schnorr. Local randomness in polynomial random number and random function generators. SIAM Journal on Computing 22 ( 1993), 684-694.
25. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory 30 (1984), 776-780.
26. C. P. Schnorr. On the construction of random number generators and random function generators. Proceedings ofEUROCRYPT '88, pages 225-232. Lecture Notes in Computer Science 330. Springer-Verlag, Berlin, 1988.
27. G. J. Simmons. A game theory model of digital message authentication. Congressus Niimeratium 34 (1982), 413-424.
28. G. J. Simmons. Authentication theory/coding theory. Proceedings of CRYPTO '84, pages 411-431. Lecture Notes in Computer Science 196. Springer-Verlag, Berlin, 1985.
29. D. R. Stinson. Resilient functions and large set of orthogonal arrays. Congressus Niimerantiiim 92 ( 1993), 105-110.
30. D. R. Stinson. Universal hashing and authentication codes. Designs, Codes and Cryptography 4 (1994), 369-380.
31. D. R. Stinson and J. L. Massey. An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions. Journal ofCryptology 8 (1995), 167-173.
32. S. Vaudenay. Adaptive-attack norm for decorrelation and super-pseudorandomness. Proceedings of SAC '99, pages 49-61. Lecture Notes in Computer Science 1758. Springer-Verlag, Berlin, 2000.
33. 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-279.