Private computations over the integers
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 335-344 vol.1
- https://doi.org/10.1109/fscs.1990.89552
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 <or=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.Keywords
This publication has 10 references indexed in Scilit:
- Lower Bounds On Communication Complexity In Distributed Computer NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Secret Sharing Over Infinite DomainsPublished by Springer Nature ,2001
- A zero-one law for Boolean privacyPublished by Association for Computing Machinery (ACM) ,1989
- Non-cryptographic fault-tolerant computing in constant number of rounds of interactionPublished by Association for Computing Machinery (ACM) ,1989
- Privacy and communication complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988
- Knowledge and common knowledge in a distributed environmentPublished by Association for Computing Machinery (ACM) ,1984
- Multi-party protocolsPublished by Association for Computing Machinery (ACM) ,1983
- Security Proofs for Information Protection SystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Some complexity questions related to distributive computing(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1979