Hiding instances in multioracle queries
Abadi, Feigenbaum, and Kilian have considered instance-hiding schemes . Let f be a function for which no randomized polynomial-time algorithm is known; randomized polynomial-time machine A wants to query an oracle B for f to obtain f(x), without telling B exactly what x is. It is shown in  that, if f is an NP-hard function, A cannot query a single oracle B while hiding all but the size of the instance, assuming that the polynomial hierarchy does not collapse. This negative result holds for all oracles B, including those that are non-r.e.
In this paper, we generalize the definition of instance-hiding schemes to allow A to query several oracles B1,..., Bm that are not allowed to communicate. We show that every function f does have a multioracle instance-hiding scheme, thus settling a question of Rivest.
Unable to display preview. Download preview PDF.
- D. Beaver and J. Feigenbaum. Hiding Information from Several Oracles, Harvard University TR-10-89, May 1, 1989.Google Scholar
- D. Beaver and J. Feigenbaum. Encrypted Queries to Multiple Oracles, AT&T Bell Laboratories Technical Memorandum, August 14, 1989.Google Scholar
- D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Cryptographic Applications of Locally Random Reductions, AT&T Bell Laboratories Technical Memorandum, November 15, 1989.Google Scholar
- M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-Prover Interactive Proofs: How to Remove Intractability, Proc. of STOC88.Google Scholar
- M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. of STOC88.Google Scholar
- D. Chaum, C. Crépeau, and I. Damgård. Multiparty Unconditionally Secure Protocols, Proc. of STOC88.Google Scholar
- A. Condon. Space-Bounded Probabilistic Game Automata, Proc. of STRUCTURES88.Google Scholar
- A. Condon and R. J. Lipton. On the Complexity of Space-Bounded Interactive Proofs, Proc. of FOCS89.Google Scholar
- 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.Google Scholar
- S. Goldwasser and M. Sipser. Public Coins vs. Private Coins in Interactive Proof Systems, Proc. of STOC86.Google Scholar
- J. Kilian. Zero-Knowledge with Log-Space Verifiers, Proc. of FOCS88.Google Scholar
- N. Nisan. Private communication, 1988.Google Scholar
- R. Rivest. Workshop on Communication and Computing, MIT, October, 1986.Google Scholar
- A. Shamir. How to Share a Secret, Commun. Assoc. Comput. Machinery 22 (1979), 612–613.Google Scholar
- A. C. Yao. Protocols for Secure Computations, Proc. of FOCS82.Google Scholar