STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The complexity of Boolean functions
The complexity of Boolean functions
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
A zero-one law for Boolean privacy
SIAM Journal on Discrete Mathematics
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
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
Characterizing linear size circuits in terms of privacy
Journal of Computer and System Sciences
Randomness complexity of private computation
Computational Complexity
Randomness in Private Computations
SIAM Journal on Discrete Mathematics
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
Private Computations in Networks: Topology versus Randomness
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Efficient reliable communication over partially authenticated networks
Distributed Computing - Special issue: PODC 02
Communications in unknown networks: Preserving the secret of topology
Theoretical Computer Science
On private computation in incomplete networks
Distributed Computing
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
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
Multiparty computations in non-private environments
General Theory of Information Transfer and Combinatorics
| Hi-index | 0.00 |
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by private protocols even if the underlying network is 1-connected but not 2-connected. Then we give a complete characterisation of non-degenerate functions that can be computed on non-2-connected networks.Furthermore, a general technique for simulating private protocols on arbitrary networks will be presented. Using this technique every private protocol can be simulated on arbitrary k-connected networks using only a small number of additional random bits.Finally, we give matching lower and upper bounds for the number of random bits needed to compute the parity function on k-connected networks.