Paper 2000/030
Secure Multiparty Computation of Approximations
Joan Feigenbaum, Jessica Fong, Martin Strauss, and Rebecca N. Wright
Abstract
Approximation algorithms can sometimes be used to obtain efficient
solutions where no efficient exact computation is known. In
particular, approximations are often useful in a distributed setting
where the inputs are held by different parties and are extremely
large. Furthermore, for some applications, the parties want to
cooperate to compute a function of their inputs without revealing more
information than they have to.
Suppose the function
Note: See Cryptology ePrint Archive: Report 2001/024 for a major revision of this papers.
Metadata
- Available format(s)
- -- withdrawn --
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- secure multiparty computationapproximation algorithms
- Contact author(s)
- rwright @ research att com
- History
- 2001-03-16: withdrawn
- 2000-06-15: received
- See all versions
- Short URL
- https://ia.cr/2000/030
- License
-
CC BY