Computational indistinguishability: A sample hierarchy

Journal of Computer and System Sciences

Volumn 59, Issue 2, 1999, Pages 253-269

  Goldreich, Oded ^a   Sudan, Madhu ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; POLYNOMIALS; PROBABILITY;

COMPUTATIONAL INDISTINGUISHABILITY;

COMPUTATIONAL COMPLEXITY;

EID: 0032597115     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1652     Document Type: Article

References (13)

1. Alon N., Spencer J. H. The Probabilistic Method. 1992;Wiley, New York.
2. Füredi Z., Komlós J. The eigenvalues of random symmetric matrices. Combinatorica. 1:1981;233-241.
3. M. J. Fischer, and, S. A. Paleologou, On the indistinguishability of probabilistic ensembles, unpublished manuscript, 1994. [See [9]].
4. Goldreich O. Foundation of Cryptography - Fragments of a Book. February 1995.
5. Goldreich O., Goldwasser S., Micali S. How to construct random functions. J. Assoc. Comput. Mach. 33:1986;792-807.
6. Goldreich O., Meyer B. Computational indistinguishability - Algorithms vs. circuits. Theoret. Comput. Sci. 191:1998;215-218.
7. Goldwasser S., Micali S. Probabilistic encryption. J. Comput. Systems Sci. 28:1984;270-299.
8. Meyer B. Constructive separation of classes of indistinguishable ensembles. Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands. 1994;IEEE Comput. Soc. New York. p. 198-204.
9. Paleologou S. A. Probabilistic Decision Making in Games and Cryptographic Protocols. May 1995;Yale University.
10. Schwartz J. T. Fast probabilistic algorithms for verification of polynomial identities. J. of the ACM 27. 4:1980;701-717.
11. Shoup V. New algorithms for finding irreducible polynomials over finite fields. Math. Comp. 54:1990;435-447.
12. Yao A. C. Theory and applications of trapdoor functions (extended abstract). 23rd Annual Symposium on Foundations of Computer Science, Chicago. 1982;IEEE, New York. p. 80-91.
13. Zuckerman D. Randomness-optimal oblivious sampling. J. Random Struct. Algorithms. 11:1997;345-367.