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.
Original language | English |
---|---|
Pages (from-to) | 1930-1943 |
Number of pages | 14 |
Journal | IEEE Transactions on Information Theory |
Volume | 39 |
Issue number | 6 |
DOIs | |
State | Published - Nov 1993 |
Externally published | Yes |
Keywords
- Private distributed protocols
- additional information
- communication complexity
- rounds complexity