Zero - one law for Boolean privacy

Benny Chor*, Eyal Kushilevitz

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProc Twenty First Annu ACM Symp Theory Comput
PublisherAssociation for Computing Machinery (ACM)
Pages62-72
Number of pages11
ISBN (Print)0897913078
StatePublished - 1989
Externally publishedYes
EventProceedings of the Twenty First Annual ACM Symposium on Theory of Computing - Seattle, WA, USA
Duration: 15 May 198917 May 1989

Publication series

NameProc Twenty First Annu ACM Symp Theory Comput

Conference

ConferenceProceedings of the Twenty First Annual ACM Symposium on Theory of Computing
CitySeattle, WA, USA
Period15/05/8917/05/89

Fingerprint

Dive into the research topics of 'Zero - one law for Boolean privacy'. Together they form a unique fingerprint.

Cite this