Hiding instances in multioracle queries

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

Volumn 415 LNCS, Issue , 1990, Pages 37-48

  Beaver, Donald ^a   Feigenbaum, Joan ^b  

^a HARVARD UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

NP-HARD; POLYNOMIAL HIERARCHIES; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS;

POLYNOMIALS;

EID: 33745511846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-52282-4_30     Document Type: Conference Paper

References (19)

1. M. Abadi, J. Feigenbaum, and J. Kilian. On Hiding Information from an Oracle, J. Comput. System Sci. 39 (1989), 21-50.
2. L. Babai and S. Moran. Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes, J. Comput. System Sci. 36 (1988), 254-276.
3. D. Beaver and J. Feigenbaum. Hiding Information from Several Oracles, Harvard University TR-10-89, May 1, 1989.
4. D. Beaver and J. Feigenbaum. Encrypted Queries to Multiple Oracles, ATandT Bell Laboratories Technical Memorandum, August 14, 1989.
5. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Cryptographic Applications of Locally Random Reductions, ATandT Bell Laboratories Technical Memorandum, November 15, 1989.
6. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-Prover Interactive Proofs: How to Remove Intractability, Proc. of STOC88.
7. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. of STOC88.
8. D. Chaum, C. Crépeau, and I. Damgård. Multiparty Unconditionally Secure Protocols, Proc. of STOC88.
9. A. Condon. Space-Bounded Probabilistic Game Automata, Proc. of STRUCTURES88.
10. A. Condon and R. J. Lipton. On the Complexity of Space-Bounded Interactive Proofs, Proc. Of FOCS89.
11. C. Dwork and L. Stockmeyer. Interactive Proof Systems with Finite State Verifiers, IBM Research Report RJ 6262 (61659), May 26, 1988. Extended Abstract in Proc. of CRYPTO88.
12. S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems, SIAM J. Comput. 18 (1989), 186-208.
13. S. Goldwasser and M. Sipser. Public Coins vs. Private Coins in Interactive Proof Systems, Proc. Of STOC86.
14. J. Kilian. Zero-Knowledge with Log-Space Verifiers, Proc. of FOCS88.
15. N. Nisan. Private communication, 1988.
16. R. Rivest. Workshop on Communication and Computing, MIT, October, 1986.
17. A. Shamir. How to Share a Secret, Commun. Assoc. Comput. Machinery 22 (1979), 612-613.
18. A. C. Yao. Protocols for Secure Computations, Proc. Of FOCS82.
19. C. Yap. Some Consequences of Nonuniform Conditions on Uniform Classes, Theor. Comput. Sci. 26 (1983), 287-300.