Threshold computation and cryptographic security

SIAM Journal on Computing

Volumn 26, Issue 1, 1997, Pages 59-78

  Han, Yenjo ^a   Hemaspaandra, Lane A ^b   Thierauf, Thomas ^c  

^a Microtec Research Inc   (United States)

^b University of Rochester ^*  (United States)

^c UNIVERSITY OF ULM   (Germany)

Author keywords

Complexity theory; Cryptography; Probabilistic computation; Threshold computation

Indexed keywords

EID: 0009404434     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539792240467     Document Type: Article

References (38)

1. M. ABADI, J. FEIGENBAUM, AND J. KILIAN, On hiding information from an oracle, J. Comput. System Sci., 39 (1989), pp. 21-50.
2. L. BABAI, Trading group theory for randomness, in Proc. 17th ACM Symposium on Theory of Computing, ACM, New York, 1985, pp. 421-429.
3. T. BAKER, J. GILL, AND R. SOLOVAY, Relativizations of the P=?NP question, SIAM J. Comput., 4 (1975), pp. 431-442.
4. J. BALCÁZAR, R. BOOK, AND U. SCHÖNING, The polynomial-time hierarchy and sparse oracles, J. Assoc. Comput. Mach., 33 (1986), pp. 603-617.
5. D. BEAVER AND J. FEIGENBAUM, Hiding instances in multioracle queries, in Proc. 7th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 415, Springer-Verlag, Berlin, 1990, pp. 37-48.
6. R. BEIGEL, Perceptrons, PP, and the polynomial hierarchy, in Proc. 7th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 14-19.
7. R. BOOK, Restricted relativizations of complexity classes, in Computational Complexity Theory, J. Hartmanis, ed., Proceedings of Symposia in Applied Mathematics 38, AMS, Providence, RI, 1989, pp. 47-74.
8. R. BOPPANA, J. HÅSTAD, AND S. ZACHOS, Does co-NP have short interactive proofs?, Inform. Process. Lett., 25 (1987), pp. 127-132.
9. J. FEIGENBAUM, L. FORTNOW, C. LUND, AND D. SPIELMAN, The power of adaptiveness and additional queries in random-self-reductions, in Proc. 7th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 338-346; final version appears as Comput. Complexity, 4 (1984), pp. 158-174.
10. J. FEIGENBAUM, L. FORTNOW, C. LUND, AND D. SPIELMAN, The power of adaptiveness and additional queries in random-self-reductions, in Proc. 7th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 338-346; final version appears as Comput. Complexity, 4 (1984), pp. 158-174.
11. S. FENNER, L. FORTNOW, AND S. KURTZ, Gap-definable counting classes, J. Comput. System Sci., 48 (1994), pp. 116-148.
12. S. FENNER, L. FORTNOW, S. KURTZ, AND L. LI, An oracle builder's toolkit, in Proc. 8th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 120-131.
13. L. FORTNOW, personal communication, 1994.
14. J. GILL, Computational complexity of probabilistic Turing machines, SIAM J. Comput., 6 (1977), pp. 675-695.
15. J. HARTMANIS, AND L. HEMACHANDRA, Complexity classes without machines: On complete languages for UP, Theoret. Comput. Sci., 58 (1988), pp. 129-142.
16. L. HEMACHANDRA, The strong exponention hierarchy collapses, J. Comput. Sci., 39 (1989), pp. 299-322.
17. U. HERTRAMPF, C. LAUTEMANN, T. SCHWENTICK, H. VOLLMER. AND K. WAGNER, On the power of polynomial time bit-reduction (extended abstract), in Proc. 8th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 200-207,
18. B. JENNER, P. MCKENZIE, AND D. THÉRIEN, Logspace and logtime leaf languages, in Proc. 9th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 242-253.
19. M. JERRUM, L. VALIANT, AND V. VAZIRANI, Random generation of combinatorial structures from a uniform distribution, Theoret. Comput. Sci., 43 (1986), pp. 169-188.
20. R. KARP AND R. LIPTON, Some connections between nonuniform and uniform complexity classes, in Proc. 12th ACM Symposium on Theory of Computing, ACM, New York, 1980, pp. 302-309; extended version has also appeared as Turing machines that take advice, Enseign. Math. (2nd series), 28 (1982), pp. 191-209.
21. R. KARP AND R. LIPTON, Some connections between nonuniform and uniform complexity classes, in Proc. 12th ACM Symposium on Theory of Computing, ACM, New York, 1980, pp. 302-309; extended version has also appeared as Turing machines that take advice, Enseign. Math. (2nd series), 28 (1982), pp. 191-209.
22. K. Ko, Some observations on the probabilistic algorithms and NP-hard problems, Inform. Process. Lett., 14 (1982), pp. 39-43.
23. J. KÖBLER, U. SCHÖNING, S. TODA, AND J. TORÁN, Turing machines with few accepting computations and low sets for PP, J. Comput. System Sci., 44 (1992), pp. 272-286.
24. R. LADNER, N. LYNCH, AND A. SELMAN, A comparison of polynomial time reducibilities, Theoret. Comput. Sci., 1 (1975), pp. 103-124.
25. C. LAUTEMANN, BPP and the polynomial hierarchy, Inform. Process. Lett., 14 (1983), pp. 215-217.
26. T. LONG AND A. SELMAN, Relativizing complexity classes with sparse oracles, J. Assoc. Comput. Mach., 33 (1986), pp. 618-627.
27. A. MEYER AND L. STOCKMEYER, The equivalence problem for regular expressions with squaring requires exponential space, in Proc. 13th IEEE Symposium on Switching and Automata Theory, IEEE, Piscataway, NJ, 1972, pp. 125-129.
28. M. OGIWARA AND L. HEMACHANDRA, A complexity theory for closure properties, J. Comput. System Sci., 46 (1993), pp. 295-325.
29. J. SIMON, On some central problems in computational complexity, Ph.D. thesis, 1975; available as Technical Report TR75-224, Department of Computer Science, Cornell University, Ithaca, NY, Jan. 1975.
30. M. SIPSER, A complexity theoretic approach to randomness, in Proc. 15th ACM Symposium on Theory of Computing, ACM, New York, 1983, pp. 330-335.
31. L. STOCKMEYER, The polynomial-time hierarchy, Theoret. Comput. Sci., 3 (1977), pp. 1-22.
32. L. STOCKMEYER, On approximation algorithms for #P, SIAM J. Comput., 14 (1985), pp. 849-861.
33. S. TODA, PP is as hard as the polynomial-time hierarchy, SIAM J. Comput., 20 (1991), pp. 865-877.
34. S. TODA AND M. OGIWARA, Counting classes are at least as hard as the polynomial-time hierarchy, SIAM J. Comput., 21 (1992), pp. 316-328.
35. N. VERESHCHAGIN, On the power of PP, in Proc. 7th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 138-143.
36. S. ZACHOS, Robustness of probabilistic complexity classes under definitional perturbations, Inform. Comput., 54 (1982), pp. 143-154.
37. S. ZACHOS, Probabilistic quantifiers and games, J. Comput. System Sci., 36 (1988), pp. 433-451.
38. S. ZACHOS AND H. HELLER, A decisive characterization of BPP, Inform. Control, 69 (1986), pp. 125-135.