Private computations over the integers

Benny Chor, Mihaly Gereb-Graus, Eyal Kushilevitz

Research output: Contribution to journalConference articlepeer-review

Abstract

The possibility of private distributed computations of n-argument functions defined over the integers is considered. A function f is t-private if there exists a protocol for computing f so that no coalition of ≤t participants can infer any additional information from the execution of the protocol. It is shown that certain results for private computation over finite domains cannot be extended to infinite domains. The possibility of privately computing f is shown to be closely related to the communication complexity of f. A complete characterization of t-private Boolean functions over countable domains is given.

Original languageEnglish
Pages (from-to)335-344
Number of pages10
JournalIEEE Transactions on Industry Applications
Volume27
Issue number1 pt 1
StatePublished - Jan 1991
Externally publishedYes
Event1989 Industry Applications Society Annual Meeting - San Diego, CA, USA
Duration: 1 Oct 19895 Oct 1989

Fingerprint

Dive into the research topics of 'Private computations over the integers'. Together they form a unique fingerprint.

Cite this