Communication complexity
On data structures and asymmetric communication complexity
Journal of Computer and System Sciences
Abstraction-based intrusion detection in distributed environments
ACM Transactions on Information and System Security (TISSEC)
Probabilistic Alert Correlation
RAID '00 Proceedings of the 4th International Symposium on Recent Advances in Intrusion Detection
Malware characterization through alert pattern discovery
LEET'09 Proceedings of the 2nd USENIX conference on Large-scale exploits and emergent threats: botnets, spyware, worms, and more
| Hi-index | 5.23 |
We consider an instance of the following problem: Parties P"1,...,P"k each receive an input x"i, and a coordinator (distinct from each of these parties) wishes to compute f(x"1,...,x"k) for some predicate f. We are interested in one-round protocols where each party sends a single message to the coordinator; there is no communication between the parties themselves. What is the minimum communication complexity needed to compute f, possibly with bounded error? We prove tight bounds on the one-round communication complexity when f corresponds to the promise problem of distinguishing sums (namely, determining which of two possible values the {x"i} sum to) or the problem of determining whether the {x"i} sum to a particular value. Similar problems were studied previously by Nisan and in concurrent work by Viola. Our proofs rely on basic theorems from additive combinatorics, but are otherwise elementary.