On the randomness complexity of efficient sampling

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 711-720

  Dubrov, Bella ^a   Ishai, Yuval ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Compression; Derandomization; Information theoretic cryptography; Pseudorandom generators; Randomness complexity; Secure computation

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; POLYNOMIALS; STATISTICAL METHODS;

COMPRESSION; DERANDOMIZATION; INFORMATION THEORETIC CRYPTOGRAPHY; PSEUDORANDOM GENERATORS; RANDOMNESS COMPLEXITY; SECURE COMPUTATION;

RANDOM PROCESSES;

EID: 33748094970     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132615     Document Type: Conference Paper

References (39)

1. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3:307-318, 1993.
2. P. Beame. A switching lemma primer. Technical Report UW-CSE95-07-01, University of Washington, 1994.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In 20th STOC, pages 1-10, 1988.
4. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput., 13(4):850-864, 1984.
5. C. Blundo, A. D. Santis, G. Persiano, and U. Vaccaro. On the number of random bits in totally private computation. In 22nd ICALP, pages 171-182, 1995.
6. R. Canetti, E. Kushilevitz, R. Ostrovsky, and A. Rosen. Randomness versus fault-tolerance. Journal of Cryptology, 13(1):107-142, 2000.
7. D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols. In 20th STOC, pages 11-19, 1988.
8. A. Gal and A. Rosen. Lower bounds on the amount of randomness in private computation. In 35th STOC, pages 659-666, 2003.
9. A. V. Goldberg and M. Sipser. Compression and ranking. SIAM J. Comput., 20(3):524-536, 1991.
10. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2000.
11. O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In 21st STOC, pages 25-32, 1989.
12. O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR Lemma. ECCC, 2(50), 1995.
13. J. Håstad. Computational Limitations of Small-Depth Circuits. ACM doctoral dissertation award, 1986. MIT Press, 1987.
14. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999.
15. I. Haitner, D. Harnik, and O. Reingold. On the power of the randomized iterate. ECCC, 2005.
16. D. Harnik and M. Naor. On the compressibility of NP instances and cryptographic applications. ECCC, 2006.
17. T. Holenstein. Pseudorandom generators from one-way functions: A simple construction for any hardness. In TCC '06, 2006.
18. R. Impagliazzo. Hard-core distributions for somewhat hard problems. In 36th FOCS, pages 538-545, 1995.
19. R. Impagliazzo, V. Kabanets, and A. Wigderson. In search of an easy witness: Exponential time vs. probabilistic polynomial time. J. Comput. Syst. Sci., 65(4):672-694, 2002.
20. R. Impagliazzo, N. Nisan, and A. Wigderson. Pseudorandomness for network algorithms. In 26th STOC, pages 356-364, 1994.
21. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In 29th STOC, pages 220-229, 1997.
22. Y. Ishai and E. Kushilevitz. On the hardness of information-theoretic multiparty computation. In EUROCRYPT '04, pages 439-455, 2004.
23. Y. Ishai, E. Kushilevitz, and R. Ostrovsky. Sufficient conditions for collision-resistant hashing. In TCC '05, pages 445-456, 2005.
24. V. Kabanets. Derandomization: A brief overview. Bulletin of the European Association for Theoretical Computer Science, 76:88-103, 2002.
25. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. In 35th STOC, pages 355-364, 2003.
26. A. R. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. In 31st STOC, pages 659-667, 1999.
27. D. E. Knuth and A. C. Yao. The complexity of nonuniform random number generation. Algorithms and Complexity, ed. J. Traub, pages 357-428, 1976.
28. E. Kushilevitz and Y. Mansour. Randomness in private computations. SIAM Jour. on Disc. Math., 10(4):647-661, 1997.
29. E. Kushilevitz, R. Ostrovsky, and A. Rosen. Characterizing linear size circuits in terms of privacy. In 28th STOC, pages 541-550, 1996.
30. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform and learnability. Journal of the ACM, 40(3):607-620, 1993.
31. N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
32. N. Nisan and A. Wigderson. Hardness vs. randomness. J. Comput. Syst. Sci., 49(2):149-167, 1994.
33. N. Nisan and D. Zuckerman. Randomness is linear in space. J. Comput. Syst. Sci., 52(1):43-52, 1996.
34. R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In 42nd FOCS, pages 648-657, 2001.
35. D. R. Simon. Finding collisions on a one-way street: Can secure hash functions be based on general assumptions? In EUROCRYPT '98, pages 334-345, 1998.
36. D. Sivakumar. Algorithmic derandomization via complexity theory. In 34th STOC, pages 619-626, 2002.
37. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR Lemma. J. Comput. Syst. Sci., 62(2):236-266, 2001.
38. C. Umans. Pseudo-random generators for all hardnesses. In 34th STOC, pages 627-634, 2001.
39. A. Yao. Theory and applications of trapdoor functions. In 23rd FOCS, pages 80-91, 1982.