A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Near-optimal private approximation protocols via a black box transformation

2011
*
Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11
*

We show the following transformation: any two-party protocol for outputting a (1 + ε)-approximation to f (x, y) = n j=1 g(xj, yj) with probability at least 2/3, for any nonnegative efficienty computable function g, can be transformed into a two-party private approximation protocol with only a polylogarithmic factor loss in communication, computation, and round complexity. In general it is insufficient to use secure function evaluation or fully homomorphic encryption on a standard, non-private

doi:10.1145/1993636.1993733
dblp:conf/stoc/Woodruff11
fatcat:laimykqhozcxjorxnvzcdrl7ga