Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Cycles and paths through specified vertices in k-connected graphs
Journal of Combinatorial Theory Series B
Privacy and communication complexity
SIAM Journal on Discrete Mathematics
A communication-privacy tradeoff for modular addition
Information Processing Letters
Private Computations Over the Integers
SIAM Journal on Computing
Secure hypergraphs: privacy from partial broadcast
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Characterizing linear size circuits in terms of privacy
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Randomness-Rounds Tradeoff in Private Computation
SIAM Journal on Discrete Mathematics
Secure computation with honest-looking parties (extended abstract): what if nobody is truly honest?
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A theorem on sensitivity and applications in private computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Randomness in Private Computations
SIAM Journal on Discrete Mathematics
On the Number of Random Bits in Totally Private Computation
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Private Computation - k-Connected versus 1-Connected Networks
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Communications in unknown networks: Preserving the secret of topology
Theoretical Computer Science
A one-round secure message broadcasting protocol through a key sharing tree
Information Processing Letters
On private computation in incomplete networks
Distributed Computing
On private computation in incomplete networks
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Communications in unknown networks: preserving the secret of topology
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
In a distributed network, computing a function privately requires that no participant gains any additional knowledge other than the value of the function. We study this problem for incomplete networks and establish a tradeoff between connectivity properties of the network and the amount of randomness needed. First, a general lower bound on the number of random bits is shown. Next, for every k 驴 2 we design a quite efficient (with respect to randomness) protocol for symmetric functions that works in arbitrary k-connected networks. Finally, for directed cycles that compute threshold functions privately almost matching lower and upper bounds for the necessary amount of randmoness are proven.