An information-theoretic treatment of random-self-reducibility: Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1200, Issue , 1997, Pages 523-534

  Feigenbaum, Joan ^a   Strauss, Martin ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HARDNESS;

CORRECTABILITY; EXTENDED ABSTRACTS; MUTUAL INFORMATIONS; NP-HARDNESS; OTHER PROPERTIES; POLYNOMIAL HIERARCHIES; SELF-REDUCTION; STANDARD DEFINITIONS;

INFORMATION THEORY;

EID: 84949663394     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023486     Document Type: Conference Paper

References (22)

1. M. Abadi, J. Feigenbaum, and J. Kilian. On Hiding Information from an Oracle. Journal of Computing and System Sciences, 39:21-50, 1989.
2. L. Babai. Random oracles separate PSPACE from the polynomial-time hierarchy. Information Processing Letters, 26:51-53, 1987.
3. L. Babai and S. Moran. Arthur-Merlin games: A randomized proof system and a hierarchy of complexity classes. Journal of Computing and System Sciences, 36:254-276, 1988.
4. L. Babai, L. Fortnow, and C. Lund. Nondeterministic exponential time has two-prover interactive protocols. Computational Complexity, 1:3-40, 1991.
5. D. Beaver and J. Feigenbaum. Hiding instance in multioracle queries. In Proc. 7th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 415, pages 37-48. Springer, Berlin, 1990.
6. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Locally random reductions: Improvements and applications. Journal of Cryptology, to appear. Preliminary version in Proc. Crypto '90, pages 62-76, under the title "Security with low communication overhead."
7. M. Blum and S. Kannan. Designing programs that check their work. Journal of the ACM, 42:269-291, 1995.
8. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting, with applications to numerical problems. Journal of Computing and System Sciences, 59:549-595, 1993.
9. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13:850-864, 1984.
10. J. Cai. With probability one, a random oracle separates PSPACE from the polynomial hierarchy. Journal of Computing and System Sciences, 38:68-85, 1989.
11. J. Feigenbaum. Locally random reductions in interactive complexity theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, pages 73-98. American Mathematical Society, Providence, 1993.
12. J. Feigenbaum and L. Fortnow. Random-self-reducibility of complete sets. SIAM Journal on Computing, 22:994-1005, 1993.
13. J. Feigenbaum, L. Fortnow, S. Laplante, and A. Naik. On coherence, random-self-reducibility, and self-correction. In Proc. 11th Conference on Computational Complexity, pages 59-67. IEEE Computer Society Press, Los Alamitos, 1996.
14. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computing and System Sciences, 28:270-299, 1984.
15. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18:186-208, 1989.
16. S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. Advances in Computing Research, vol. 5, pages 73-90. JAI Press, Greenwich, 1989.
17. R. Lipton. New directions in testing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 2, pages 191-202. American Mathematical Society, Providence, 1991.
18. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. Journal of the ACM, 39:859-868, 1992.
19. A. Shamir. IP = PSPACE. Journal of the ACM, 39:869-877, 1992.
20. M. Sipser. A complexity theoretic approach to randomness. In Proc. 15th Symposium on Theory of Computation, pages 330-335. ACM Press, New York, 1983.
21. L. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
22. C. Yap. Some consequences of nonuniform conditions on uniform classes. Theoretical Computer Science, 26:287-300, 1983.