Communication complexity of secure computation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Direct product results and the GCD problem, in old and new communication models
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
The authors study the direct sum problem with respect to communication complexity: Consider a function f: D to (0, 1), where D contained in (0, 1)/sup n/*(0, 1)/sup n/. The amortized communication complexity of f, i.e. the communication complexity of simultaneously computing f on l instances, divided by l is studied. The authors present, both in the deterministic and the randomized model, functions with communication complexity Theta (log n) and amortized communication complexity O(1). They also give a general lower bound on the amortized communication complexity of any function f in terms of its communication complexity C(f).