Zero - one law for Boolean privacy

Benny Chor; Eyal Kushilevitz

Zero - one law for Boolean privacy

Benny Chor^*, Eyal Kushilevitz

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A Boolean function f : A₁ × A₂ x...x A_n → {0,1} is t - private if there exists a protocol for computing f so that no coalition of size ≤ t can infer any additional information from the execution, other than the value of the function. Conditions for the privacy of f are obtained. A zero-one law for private distributed computation of Boolean functions is derived. A weaker notion of privacy is also investigated.

Original language	English
Title of host publication	Proc Twenty First Annu ACM Symp Theory Comput
Publisher	Association for Computing Machinery (ACM)
Pages	62-72
Number of pages	11
ISBN (Print)	0897913078
State	Published - 1989
Externally published	Yes
Event	Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing - Seattle, WA, USA Duration: 15 May 1989 → 17 May 1989

Publication series

Name	Proc Twenty First Annu ACM Symp Theory Comput

Conference

Conference	Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing
City	Seattle, WA, USA
Period	15/05/89 → 17/05/89

Cite this

@inproceedings{424a51ceac87437189b4251c4921317c,

title = "Zero - one law for Boolean privacy",

abstract = "A Boolean function f : A1 × A2 x...x An → {0,1} is t - private if there exists a protocol for computing f so that no coalition of size ≤ t can infer any additional information from the execution, other than the value of the function. Conditions for the privacy of f are obtained. A zero-one law for private distributed computation of Boolean functions is derived. A weaker notion of privacy is also investigated.",

author = "Benny Chor and Eyal Kushilevitz",

year = "1989",

language = "אנגלית",

isbn = "0897913078",

series = "Proc Twenty First Annu ACM Symp Theory Comput",

publisher = "Association for Computing Machinery (ACM)",

pages = "62--72",

booktitle = "Proc Twenty First Annu ACM Symp Theory Comput",

address = "ארצות הברית",

note = "null ; Conference date: 15-05-1989 Through 17-05-1989",

}

TY - GEN

T1 - Zero - one law for Boolean privacy

AU - Chor, Benny

AU - Kushilevitz, Eyal

PY - 1989

Y1 - 1989

N2 - A Boolean function f : A1 × A2 x...x An → {0,1} is t - private if there exists a protocol for computing f so that no coalition of size ≤ t can infer any additional information from the execution, other than the value of the function. Conditions for the privacy of f are obtained. A zero-one law for private distributed computation of Boolean functions is derived. A weaker notion of privacy is also investigated.

AB - A Boolean function f : A1 × A2 x...x An → {0,1} is t - private if there exists a protocol for computing f so that no coalition of size ≤ t can infer any additional information from the execution, other than the value of the function. Conditions for the privacy of f are obtained. A zero-one law for private distributed computation of Boolean functions is derived. A weaker notion of privacy is also investigated.

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

M3 - פרסום בספר כנס

AN - SCOPUS:0024860209

SN - 0897913078

T3 - Proc Twenty First Annu ACM Symp Theory Comput

SP - 62

EP - 72

BT - Proc Twenty First Annu ACM Symp Theory Comput

PB - Association for Computing Machinery (ACM)

Y2 - 15 May 1989 through 17 May 1989

ER -

Zero - one law for Boolean privacy

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this