Privacy, Additional Information, and Communication

Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)1930-1943
Number of pages14
JournalIEEE Transactions on Information Theory
Issue number6
StatePublished - Nov 1993
Externally publishedYes


  • Private distributed protocols
  • additional information
  • communication complexity
  • rounds complexity


Dive into the research topics of 'Privacy, Additional Information, and Communication'. Together they form a unique fingerprint.

Cite this