Abstract
Abadi, Feigenbaum, and Kilian have considered instance-hiding schemes [1]. 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 [1] 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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Abadi, J. Feigenbaum, and J. Kilian. On Hiding Information from an Oracle, J. Comput. System Sci. 39 (1989), 21–50.
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.
D. Beaver and J. Feigenbaum. Hiding Information from Several Oracles, Harvard University TR-10-89, May 1, 1989.
D. Beaver and J. Feigenbaum. Encrypted Queries to Multiple Oracles, AT&T Bell Laboratories Technical Memorandum, August 14, 1989.
D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Cryptographic Applications of Locally Random Reductions, AT&T Bell Laboratories Technical Memorandum, November 15, 1989.
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-Prover Interactive Proofs: How to Remove Intractability, Proc. of STOC88.
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. of STOC88.
D. Chaum, C. Crépeau, and I. Damgård. Multiparty Unconditionally Secure Protocols, Proc. of STOC88.
A. Condon. Space-Bounded Probabilistic Game Automata, Proc. of STRUCTURES88.
A. Condon and R. J. Lipton. On the Complexity of Space-Bounded Interactive Proofs, Proc. of FOCS89.
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.
S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems, SIAM J. Comput. 18 (1989), 186–208.
S. Goldwasser and M. Sipser. Public Coins vs. Private Coins in Interactive Proof Systems, Proc. of STOC86.
J. Kilian. Zero-Knowledge with Log-Space Verifiers, Proc. of FOCS88.
N. Nisan. Private communication, 1988.
R. Rivest. Workshop on Communication and Computing, MIT, October, 1986.
A. Shamir. How to Share a Secret, Commun. Assoc. Comput. Machinery 22 (1979), 612–613.
A. C. Yao. Protocols for Secure Computations, Proc. of FOCS82.
C. Yap. Some Consequences of Nonuniform Conditions on Uniform Classes, Theor. Comput. Sci. 26 (1983), 287–300.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beaver, D., Feigenbaum, J. (1990). Hiding instances in multioracle queries. In: Choffrut, C., Lengauer, T. (eds) STACS 90. STACS 1990. Lecture Notes in Computer Science, vol 415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52282-4_30
Download citation
DOI: https://doi.org/10.1007/3-540-52282-4_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52282-9
Online ISBN: 978-3-540-46945-2
eBook Packages: Springer Book Archive