Tiny families of functions with random properties: A quality-size trade-off for hashing

Random Structures and Algorithms

Volumn 11, Issue 4, 1997, Pages 315-343

  Goldreich, Oded ^a   Wigderson, Avi ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031504510     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199712)11:4<315::AID-RSA3>3.0.CO;2-1     Document Type: Article

References (38)

1. M. Ajtai, J. Komlos, and E. Szemerédi, Deterministic Simulation in LogSpace, Proceedings of the 19th Symposium on Theory of Computing, 1987, pp. 132-140.
2. N. Alon, Eigenvalues, geometric expanders, sorting in rounds and Ramsey theory, Combinatorica, 6, 231-243 (1986).
3. N. Alon, J. Bruck, J. Naor, M. Naor, and R. Roth, Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs, IEEE Trans. Inform. Theory, 38, 509-516 (1992).
4. N. Alon, O. Goldreich, J. Hastad, and R. Peralta, Simple constructions of almost k-wise independent random variables, Random Structures Algorithms, 3, 289-304 (1992).
5. 1, isoperimetric inequalities for graphs and superconcentrators, J. Combin. Theory Ser. B, 38, 73-88 (1985).
6. N. Alon and J. H. Spencer, The Probabilistic Method, John Wiley & Sons, New York, 1992.
7. M. Bellare, O. Goldreich, and S. Goldwasser, Randomness in interactive proofs, Comput. Complexity, 4, 319-354 (1993).
8. R. Canetti, G. Even, and O. Goldreich, Lower bounds for sampling algorithms for estimating the average, IPL, 53, 17-25 (1995).
9. L. Carter and M. Wegman, Universal classes of hash functions, J. Comput. System Sci., 18, 143-154 (1979).
10. B. Chor and O. Goldreich, Unbiased bits from sources of weak randomness and probabilistic communication complexity, SIAM J. Comput., 17, 230-261 (1988).
11. B. Chor and O. Goldreich, On the power of two-point based sampling, J. Complexity, 5, 96-106 (1989).
12. A. Cohen and A. Wigderson, Dispensers, deterministic amplification, and weak random sources, 30th Symposium on Foundations of Computer Science (FOCS), 1989, pp. 14-19.
13. P. Erdös and J. Spencer, Probabilistic Methods in Combinatorics, Academic Press, San Diego, 1974.
14. G. Even, Construction of small probability spaces for deterministic simulation, M.Sc. thesis, Technion, Haifa, Israel, 1991 (in Hebrew, abstract in English).
15. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Veličković, Approximations of general independent distributions, 24th Symposium on Theory of Computing, 1992, pp. 10-16.
16. O. Gaber and Z. Galil, Explicit constructions of linear size superconcentrators, J. Comput. System Sci., 22, 407-420 (1981).
17. O. Goldreich, H. Krawcyzk and M. Luby, On the existence of pseudorandom generators, SIAM J. Comput., 22, 1163-1175 (1993).
18. S. Goldwasser and M. Sipser, Private coins versus public coins in interactive proof systems, in Advances in Computing Research: A Research Annual, Vol. 5, Randomness and Computation, S. Micali, Ed., JAI Press, 1989, pp. 73-90.
19. R. Impagliazzo and M. Luby, One-way functions are essential for complexity based cryptography, 30th FOCS, 1989, pp. 230-235.
20. R. Impagliazzo and L. A. Levin, No better ways to generate hard NP instances than picking uniformly at random, 31st FOCS, 1990, pp. 812-821.
21. R. Impagliazzo, L. A. Levin, and M. G. Luby, Pseudorandom generators from any one-way functions, 21st Symposium on Theory of Computing, 1989, pp. 12-24.
22. R. Impagliazzo and D. Zuckerman, How to recycle random bits, 30th FOCS, 1989, pp. 248-253.
23. R. M. Karp, N. Pippinger, and M. Sipser, A time-randomness tradeoff, AMS Conference on Probabilistic Computational Complexity, Durham, New Hampshire, 1982.
24. A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, 8, 261-277 (1988).
25. G. A. Margulis, Explicit construction of concentrators, Prob. Per. Inform., 9, 71-80 (1973). (In Russian, English translation in Problems of Inform. Transmission, 1975, 325-332.)
26. G. A. Margulis, Explicit construction of concentrators, Prob. Per. Inform., 9, 71-80 (1973). (In Russian, English translation in Problems of Inform. Transmission, 1975, 325-332.)
27. J. Naor and M. Naor, Small-bias probability spaces: Efficient constructions and applications, SIAM J. Comput., 22, 838-856 (1993).
28. N. Nisan, Pseudorandom generators for space bounded computation, Combinatorica, 12, 449-461 (1992).
29. N. Nisan, ℛ ℒ ⊆ script capital L sign script C sign, J. Comput. Complexity, 4, 1-11 (1994).
30. N. Nisan and D. Zuckerman, Randomness is linear in space, to appear in JCSS. (Preliminary version in 25th Symposium on Theory of Computing, 1993, pp. 235-244.)
31. M. Sipser, A complexity theoretic approach to randomness, 15th Symposium on Theory of Computing, 1983, pp. 330-335.
32. M. Sipser, Expanders, randomness or time vs space, Structure in Complexity Theory, Lecture Notes in Computer Science No. 223, G. Goos and J. Hartmanis, Eds., pp. 325-329, 1986.
33. L. Stockmeyer, The complexity of approximate counting, 15th Symposium on Theory of Computing, 1983, pp. 118-126.
34. A. Srinivasan and D. Zuckerman, Computing with very weak random sources, 35th FOCS, pp. 264-275, 1994.
35. L. Valiant and V. V. Vazirani, NP is as easy as detecting unique solutions, Theoret. Comput. Sci., 47, 85-93 (1986).
36. A. Wigderson and D. Zuckerman, Expanders that beat the eigenvalue bound, explicit construction and applications, Proceedings of the 25th Symposium on Theory of Computing, pp. 245-251, 1993. (To appear in Combinatorica.)
37. D. Zuckerman, Simulating BPP using a general weak random source, Algorithmica, 16, 367-391 (1996).
38. D. Zuckerman, Randomness-optimal sampling, extractors, and constructive leader election, 28th Symposium on Theory of Computing, pp. 286-295, 1996.