TY - JOUR
T1 - Secure multiparty computation of approximations
AU - Feigenbaum, Joan
AU - Ishai, Yuval
AU - Malkin, T. A.L.
AU - Nissim, Kobbi
AU - Strauss, Martin J.
AU - Wright, Rebecca N.
PY - 2006
Y1 - 2006
N2 - Approximation algorithms can sometimes provide efficient solutions when 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 may be extremely large. Furthermore, for some applications, the parties want to compute a function of their inputs securely without revealing more information than necessary. In this work, we study the question of simultaneously addressing the above efficiency and security concerns via what we call secure approximations. We start by extending standard definitions of secure (exact) computation to the setting of secure approximations. Our definitions guarantee that no additional information is revealed by the approximation beyond what follows from the output of the function being approximated. We then study the complexity of specific secure approximation problems. In particular, we obtain a sublinear-communication protocol for securely approximating the Hamming distance and a polynomial-time protocol for securely approximating the permanent and related #P-hard problems.
AB - Approximation algorithms can sometimes provide efficient solutions when 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 may be extremely large. Furthermore, for some applications, the parties want to compute a function of their inputs securely without revealing more information than necessary. In this work, we study the question of simultaneously addressing the above efficiency and security concerns via what we call secure approximations. We start by extending standard definitions of secure (exact) computation to the setting of secure approximations. Our definitions guarantee that no additional information is revealed by the approximation beyond what follows from the output of the function being approximated. We then study the complexity of specific secure approximation problems. In particular, we obtain a sublinear-communication protocol for securely approximating the Hamming distance and a polynomial-time protocol for securely approximating the permanent and related #P-hard problems.
KW - Distributed data processing
KW - Privacy
KW - Sublinear communication
UR - http://www.scopus.com/inward/record.url?scp=33748996753&partnerID=8YFLogxK
U2 - 10.1145/1159892.1159900
DO - 10.1145/1159892.1159900
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:33748996753
SN - 1549-6325
VL - 2
SP - 435
EP - 472
JO - ACM Transactions on Algorithms
JF - ACM Transactions on Algorithms
IS - 3
ER -