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

}