On Hiding Information from an Oracle (1989)
Cached
Download Links
- [pa.bell-labs.com]
- [www.research.att.com]
- DBLP
Other Repositories/Bibliography
| Citations: | 119 - 15 self |
BibTeX
@MISC{Abadi89onhiding,
author = {Martín Abadi and Joan Feigenbaum and Joe Kilian},
title = {On Hiding Information from an Oracle},
year = {1989}
}
Years of Citing Articles
OpenURL
Abstract
: We consider the problem of computing with encrypted data. Player A wishes to know the value f(x) for some x but lacks the power to compute it. Player B has the power to compute f and is willing to send f(y) to A if she sends him y, for any y. Informally, an encryption scheme for the problem f is a method by which A, using her inferior resources, can transform the cleartext instance x into an encrypted instance y, obtain f(y) from B, and infer f(x) from f(y) in such a way that B cannot infer x from y. When such an encryption scheme exists, we say that f is encryptable. The framework defined in this paper enables us to prove precise statements about what an encrypted instance hides and what it leaks, in an information-theoretic sense. Our definitions are cast in the language of probability theory and do not involve assumptions such as the intractability of factoring or the existence of one-way functions. We use our framework to describe encryption schemes for some well-known function...







