By Topic

Privacy, additional information, and communication

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bar-Yehuda, R. ; Dept. of Comput. Sci., Technion-Israel, Haifa, Israel ; Chor, Benny ; Kushilevitz, E.

Two parties which hold n-b inputs x and y , respectively, wish to cooperate in computing a predetermined function f(x,y). For most functions f, this task cannot be accomplished privately, namely, without revealing some additional information to at least one of the parties. The authors initiate a quantitative study of T(f), the minimum amount of additional information revealed in any computation of f. This quantity is formally defined, and a combinatorial characterization which determines the value T(f) (up to a multiplicative factor of 2) is found. This enables the authors to give tight lower and upper bounds on the amount of additional information required for computing various (explicit and random) functions. It is shown that additional information is a resource which can be traded for communication complexity

Published in:

Structure in Complexity Theory Conference, 1990, Proceedings., Fifth Annual

Date of Conference:

8-11 July 1990