Abstract
This paper describes ongoing work on the task of encrypting problem instances, also known as computing with encrypted data. A problem is specified by a function f and an instance by a value x in the domain of f. The scenario involves two people, A and B. A has instances {x i} of f to which she needs answers, but she lacks the resources to compute them. We use the term resources completely generally-she may be lacking time, space, algorithmic knowledge, or appropriate hardware, or she may simply be too lazy to implement a solution that she knows others have already implemented. B has the resources to compute f(x) and is willing to let A use them, i.e., he is willing to send her f(x) if she sends him x. She would like to take advantage of his generosity without having to trust him, i.e., she does not want to reveal any more about her data than she must in order to enable him to compute the correct answer. Intuitively, we say that f is encryptable if A can easily transform instance x into instance x′, obtain f(x′) from B, and easily compute f(x) from f(x′) in such a way that B cannot infer x from x′.
The author did some of this work while at AT&T Bell Laboratories for the summer. During the academic year, she is funded by a Xerox Corporation Fellowship and a grant from the AT&T Bell Laboratories Graduate Research Program for Women.
Chapter PDF
6. References
Berman, Len and Juris Hartmanis. “On Isomorphisms and Density of NP-and other Complete Sets”, SIAM J. on Comput., 6(2), 1977, 305–322.
Coppersmith, Don and Joan Feigenbaum. “Finite Graphs with Two Inequivalent Factorizations Under the Composition Operator”, IBM Research Report RC11149, 1985, submitted to Journal of Combinatorial Theory, Series B.
Feigenbaum, Joan and Alejandro A. Schäffer, “Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism”, to appear in SIAM J. on Comput.
Mahaney, Stephen R. “On the Number of p-isomorphism Classes of NP-complete Sets”, Proc. 22nd Annual IEEE Symposium on the Foundations of Computer Science, 22, 1981, 271–278.
Plaisted, David. “Some Polynomial and Integer Divisibility Problems are NP-hard”, Proc. 17th Annual IEEE Symposium on the Foundations of Computer Science, 17, 1976, 264–267.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feigenbaum, J. (1986). Encrypting Problem Instances. In: Williams, H.C. (eds) Advances in Cryptology — CRYPTO ’85 Proceedings. CRYPTO 1985. Lecture Notes in Computer Science, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39799-X_38
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16463-0
Online ISBN: 978-3-540-39799-1
eBook Packages: Springer Book Archive