Privacy, Additional Information, and Communication

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

doi:10.1109/18.265501

Privacy, Additional Information, and Communication

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

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1109/18.265501
State	Published - Nov 1993
Externally published	Yes

Keywords

Private distributed protocols
additional information
communication complexity
rounds complexity

Access to Document

10.1109/18.265501

Cite this

@article{6342aa17726545b38f10e803084756c8,

title = "Privacy, Additional Information, and Communication",

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.",

keywords = "Private distributed protocols, additional information, communication complexity, rounds complexity",

author = "Reuven Bar-Yehuda and Benny Chor and Eyal Kushilevitz and Alon Orlitsky",

note = "Funding Information: Manuscript received December 6, 1990; revised January 8, 1993. The work of B. Chor and E. Kushilevitz was supported in part by US-Israel Grant 88-00282. Part of B. Chor's work was done while visiting AT & T Bell Laboratories, Murray Hill, NJ. This paper was presented in part at the 5th IEEE Structure in Complexity Theory Conference, Barcelona, Spain, July 1990.",

year = "1993",

month = nov,

doi = "10.1109/18.265501",

language = "אנגלית",

volume = "39",

pages = "1930--1943",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

T1 - Privacy, Additional Information, and Communication

AU - Bar-Yehuda, Reuven

AU - Chor, Benny

AU - Kushilevitz, Eyal

AU - Orlitsky, Alon

N1 - Funding Information: Manuscript received December 6, 1990; revised January 8, 1993. The work of B. Chor and E. Kushilevitz was supported in part by US-Israel Grant 88-00282. Part of B. Chor's work was done while visiting AT & T Bell Laboratories, Murray Hill, NJ. This paper was presented in part at the 5th IEEE Structure in Complexity Theory Conference, Barcelona, Spain, July 1990.

PY - 1993/11

Y1 - 1993/11

N2 - 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.

AB - 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.

KW - Private distributed protocols

KW - additional information

KW - communication complexity

KW - rounds complexity

UR - http://www.scopus.com/inward/record.url?scp=0027695921&partnerID=8YFLogxK

U2 - 10.1109/18.265501

DO - 10.1109/18.265501

M3 - מאמר

AN - SCOPUS:0027695921

VL - 39

SP - 1930

EP - 1943

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

ER -

Privacy, Additional Information, and Communication

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this