Abstract

Two parties, each holding one input of a two-variable function, communicate in order to determine the value of the function. Each party wants to expose as little of its input as possible to the other party. We prove tight bounds on the minimum amount of information about the individual inputs that must be revealed in the computation of most functions and of some specific ones, and show that a computation that reveals little information about the individual inputs may require many more message exchanges than a more revealing computation. Key words: Private distributed protocols, additional-information, communication-complexity, rounds-complexity. 1 Introduction Let f be a function of two n-bit inputs, x and y. Two honest parties, PX holding x and P Y having y, each with unlimited computing power, communicate to determine f(x; y). Each party wants to keep as much of its input secret from the other party. For some privately computable functions this can be done without revealing any mo...

Citations