On the implementation of huge random objects

SIAM Journal on Computing

Volumn 39, Issue 7, 2010, Pages 2761-2822

  Goldreich, Oded ^a   Goldwasser, Shafi ^a,b   Nussboim, Asaf ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c NONE   (Israel)

Author keywords

Monotone graph properties; Pseudorandomness; Random codes; Random functions; Random graphs; Random walks on regular graphs

Indexed keywords

GRAPH PROPERTIES; PSEUDORANDOMNESS; RANDOM CODES; RANDOM FUNCTIONS; RANDOM GRAPHS; RANDOM WALK;

GRAPHIC METHODS; HAMILTONIANS;

GRAPH THEORY;

EID: 77956027804     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080722771     Document Type: Article

References (40)

1. M. ABADI, E. ALLENDER, A. BRODER, J. FEIGENBAUM, AND L. A. HEMACHANDRA, On generating hard, solved instances of computational problems, in Advances in Cryptology - Crypto 88, Springer-Verlag, Berlin, pp. 297-310.
2. N. ALON, L. BABAI, AND A. ITAI, A fast and simple randomized algorithm for the maximal independent set problem, J. Algorithms, 7 (1986), pp. 567-583.
3. N. ALON AND A. NUSSBOIM, k-wise independent random graphs, in Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Washington, D.C., 2008, pp. 813-822.
4. E. BACH, Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms, ACM Disting. Diss., MIT Press, Cambridge, MA, 1985.
5. S. BEN-DAVID, B. CHOR, O. GOLDREICH, AND M. LUBY, On the theory of average case complexity, J. Comput. System. Sci., 44 (1992), pp. 193-219.
6. M. BLUM AND S. MICALI, HOW to generate cryptographically strong sequences of pseudorandom bits, SIAM J. Comput., 13 (1984), pp. 850-864.
7. A. BOGDANOV AND H. WEE, A stateful implementation of a random, function supporting parity queries over hypercubes, in Proceedings of the 8th International Workshop on Randomization and Computation (RANDOM '04), Lecture Notes in Comput. Sci. 3122, Springer, Berlin, 2004, pp. 298-309.
8. B. BOLLOBÁS, Random Graphs, Academic Press, 1985.
9. B. BOLLOBÁS AND P. ERDÖS, Cliques in Random Graphs, Math. Proc. Cambridge Philos. Soc. 80 (1976), pp. 419-427.
10. E. R. CANFIELD, P. ERDÖS, AND C. POMERANCE, On a Problem, of Oppenheim, Concerning "factorisatio numerorum," J. Number Theory, 17 (1983), pp. 1-28.
11. B. CHOR AND O. GOLDREICH, On the power of two-point based sampling, J. Complexity, 5 (1989), pp. 96-106.
12. I. DÅMGARD, Collision free hash functions and public key signature schemes, in Advances in Cryptography - EuroCrypt '87, Lecture Notes in Comput. Sci. 304, Springer-Verlag, New York, pp. 203-216.
13. P. ERDÖS AND H. SACHS, Reguläre Graphen gegenebener Taillenweite mit minimaler Knotenzahl, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg, Math.-Natur. Reihe, 12 (1963), pp. 251-257.
14. J. FEIGENBAUM, S. KANNAN, M. J. STRAUSS, AND M. VISWANATHAN, An approximate L1-difference algorithm for massive data streams, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1999, pp. 501-511.
15. P. FLAJOLET AND A.M. ODLYZKO, Random, mapping statistics, in Advances in Cryptology-EuroCrypt '89, Lecture Notes in Comput. Sci. 434, Springer, Berlin, pp. 329-354.
16. A. C. GILBERT, S. GUHA, P. INDYK, Y. KOTIDIS, S. MUTHUKRISHNAN, AND M. J. STRAUSS, Fast, small-space algorithms for approximate histogram maintenance, in Proceedings of the 34th Annual Symposium on Theory of Computing, ACM, New York, 2002, pp. 389-398. (Pubitemid 35009399)
17. O. GOLDREICH, A note on computational indistinguishability, Inform. Process. Lett., 34 (1990), pp. 277-281.
18. O. GOLDREICH, Foundation of Cryptography Basic Tools, Cambridge University Press, Cambridge, UK, 2001.
19. O. GOLDREICH, Foundation of Cryptography Basic Applications, Cambridge University Press, Cambridge, UK, 2004.
20. O. GOLDREICH, S. GOLDWASSER, AND S. MICALI, How to construct random functions, J. Assoc. Comput. Mach., 33 (1986), pp. 792-807.
21. O. GOLDREICH AND H. KRAWCZYK, Sparse pseudorandom distributions, Random Structures Algorithms, 3 (1992), pp. 163-174.
22. O. GOLDREICH AND D. RON, Property testing in bounded degree graphs, Algorithmica, 32 (2002), pp. 302-343.
23. O. GOLDREICH AND L. TREVISAN, Three theorems regarding testing graph properties, in Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2001, pp. 460-469.
24. S. GOLDWASSER AND S. MICALI, Probabilistic encryption, J. Comput. System Sci., 28 (1984), pp. 270-299.
25. J. HASTAD, R. IMPAGLIAZZO, L. A. LEVIN, AND M. LUBY, A pseudorandom generator from any one-way function, SIAM J. Comput., 28 (1999), pp. 1364-1396.
26. R. IMPAGLIAZZO AND A. WIGDERSON, P=BPP if E requires exponential circuits: Derandomizing the XOR lemma, in Proceedings of the 29th Annual Symposium on the Theory of Computing, ACM, New York, 1997, pp. 220-229.
27. W. IMRICH, Explicit construction of regular graphs without small cycles, Combinatorica, 4 (1984), pp. 53-59.
28. S. JANSON, The numbers of spanning trees, Hamilton cycles and perfect matchings in a random graph, Combin. Probab. Comput., 3 (1994), pp. 97-126.
29. D. E. KNUTH, The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, MA, 1981.
30. F. LAZEBNIK AND V. A. USTIMENKO, Explicit construction of graphs with arbitrary large girth and of large size, Discrete Appl. Math., 60 (1995), pp. 275-284.
31. L. A. LEVIN, Average case complete problems, SIAM J. Comput., 15 (1986), pp. 285-286.
32. M. LI AND P. VITANYI, An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag, New York, 1993.
33. A. LUBOTZKY, R. PHILLIPS, AND P. SARNAK, Ramanujan graphs, Combinatorica, 8 (1988), pp. 261-277.
34. M. LUBY AND C. RACKOFF, HOW to construct pseudorandom permutations from pseudorandom functions, SIAM J. Comput., 17 (1988), pp. 373-386.
35. G. A. MARGULIS, Explicit construction of graphs without short cycles and low density codes, Combinatorica, 2 (1982), pp. 71-78.
36. M. NAOR AND A. NUSSBOIM, Implementing huge sparse random graphs, in Proceedings of the 11th International Workshop on Randomization and Combinatorial Optimization, Lecture Notes in Comput. Sci. 4627, Springer-Verlag, Heidelberg, 2007, pp. 596-608.
37. M. NAOR, A. NUSSBOIM, AND E. TROMER, Efficiently constructible huge graphs that preserve first order properties of random graphs, Second Theory of Cryptography Conference, Lecture Notes in Comput. Sci. 3378, Springer, Berlin, 2005, pp. 66-85.
38. M. NAOR AND O. REINGOLD, Constructing pseudo-random permutations with a prescribed structure, J. Cryptology, 15 (2002), pp. 97-102.
39. B. TSABAN, Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation, J. Algorithms, 47 (2003), pp. 104-121.
40. A. C. YAO, Theory and Applications of Trapdoor Functions, in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, IEEE, New York, 1982, pp. 80-91.