NDLI: Privacy and Communication Complexity

Please wait, while we are loading the content...

Privacy and Communication Complexity

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Kushelvitz, Eyal
Copyright Year	1992
Abstract	Each of two parties $P_\mathcal{X} $ and $P_\matcal{Y} $ holds an n-bit input, x and y, respectively. They wish to privately compute the value of $f( x,y )$. That is, $P_\mathcal{X} $ should not learn any additional information about y (in the information-theoretic sense) other than what follows from its input x and the function value $f ( x,y )$, and similarly, $P_\mathcal{Y} $ should not learn any additional information about x.In this paper, the two following basic questions in the theory of private computations are considered: 1. Which functions can be privately computed? 2. What is the communication complexity of protocols that privately compute a function f (in the case that such protocols exist)?A complete combinatorial characterization of privately computable functions is given. This characterization is used to derive tight bounds on the rounds complexity of any privately computable function and to design optimal private protocols that compute these functions.It is shown that for every $1 \leq g ( n ) \leq 2\cdot ( 2^n - 1)$ there are functions that can be privately computed with $g( n )$-rounds of communication, but not with $( g ( n ) - 1 )$-rounds of communication. This implies that the communication costs of private protocols can be exponentially higher than the communication costs of nonprivate protocols.Interestingly, randomization helps neither to increase the set of privately computable functions, nor to improve the rounds complexity of these functions.
Starting Page	273
Ending Page	284
Page Count	12
File Format	PDF
ISSN	08954801
DOI	10.1137/0405021
e-ISSN	10957146
Journal	SIAM Journal on Discrete Mathematics (SJDMEC)
Issue Number	2
Volume Number	5
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2006-08-08
Access Restriction	Subscribed
Subject Keyword	communication complexity Combinatorics Cryptography private distributed computations Information theory, general
Content Type	Text
Resource Type	Article
Subject	Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Private Computations over the Integers

A Zero-One Law for Boolean Privacy

Private computations over the integers

Randomness in Private Computations

Amortizing Randomness in Private Multiparty Computations

A Randomness-Rounds Tradeoff in Private Computation

Private information retrieval

Preserving Sparsity and Privacy in Straggler-Resilient Distributed Matrix Computations

Multi-Party Protocols, Information Complexity and Privacy

Privacy and Communication Complexity

Similar Documents

Private Computations over the Integers

A Zero-One Law for Boolean Privacy

Private computations over the integers

Randomness in Private Computations

Amortizing Randomness in Private Multiparty Computations

A Randomness-Rounds Tradeoff in Private Computation

Private information retrieval

Preserving Sparsity and Privacy in Straggler-Resilient Distributed Matrix Computations

Multi-Party Protocols, Information Complexity and Privacy

Privacy and Communication Complexity