Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR05-117 | 17th September 2005 00:00

Polylogarithmic Private Approximations and Efficient Matching



A private approximation of a function f is defined to be another function F that approximates f in the usual sense, but does not reveal any information about the input x other than what can be deduced from f(x). We give the first two-party private approximation of the Euclidean distance with polylogarithmic communication. This, in particular, resolves the main open question of Feigenbaum et al [FIMNSW01].

We then look at the private near neighbor problem in which Alice has a query point in {0,1}^d and Bob a set of n points in {0,1}^d, and Alice should privately learn the point closest to her query. We improve upon existing protocols, resolving several open questions. Then, we relax the problem by defining the private approximate near neighbor problem, which requires introducing a notion of secure computation of approximations for functions that return sets of points rather than values. For this problem we give several protocols with sublinear communication.

ISSN 1433-8092 | Imprint