TY - GEN
T1 - Secure multiparty computation of approximations (extended abstract)
AU - Feigenbaum, Joan
AU - Ishai, Yuval
AU - Malkin, Tal
AU - Nissim, Kobbi
AU - Strauss, Martin J.
AU - Wright, Rebecca N.
PY - 2001
Y1 - 2001
N2 - Approximation algorithms can sometimes provide effcient solutions when no effcient 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 necessary. If f̂ is an approximation to f, secure multiparty computation of f̂ allows the parties to compute f̂ without revealing unnecessary information. However, secure computation of f̂ may not be as private as secure computation of f, because the output of f̂ may itself reveal more information than the output of f. In this paper, we present definitions of secure multiparty approximate computations that retain the privacy of a secure computation of f. We present an effcient, sublinear-communication, private approximate computation for the Hamming distance and an effcient private approximation of the permanent.
AB - Approximation algorithms can sometimes provide effcient solutions when no effcient 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 necessary. If f̂ is an approximation to f, secure multiparty computation of f̂ allows the parties to compute f̂ without revealing unnecessary information. However, secure computation of f̂ may not be as private as secure computation of f, because the output of f̂ may itself reveal more information than the output of f. In this paper, we present definitions of secure multiparty approximate computations that retain the privacy of a secure computation of f. We present an effcient, sublinear-communication, private approximate computation for the Hamming distance and an effcient private approximation of the permanent.
UR - http://www.scopus.com/inward/record.url?scp=84879521412&partnerID=8YFLogxK
U2 - 10.1007/3-540-48224-5_75
DO - 10.1007/3-540-48224-5_75
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84879521412
SN - 3540422870
SN - 9783540422877
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 927
EP - 938
BT - Automata, Languages and Programming - 28th International Colloquium, ICALP 2001, Proceedings
A2 - Orejas, Fernando
A2 - Spirakis, Paul G.
A2 - van Leeuwen, Jan
T2 - 28th International Colloquium on Automata, Languages and Programming, ICALP 2001
Y2 - 8 July 2001 through 12 July 2001
ER -