Given a network of interconnected nodes, each with its own value (such as a measurement, position, vote, or other data), we develop a distributed strategy that enables some or all of the nodes to calculate any arbitrary function of the node values, despite the actions of malicious nodes in the network. Our scheme assumes a broadcast model of communication (where all nodes transmit the same value to all of their neighbors) and utilizes a linear iteration where, at each time-step, each node updates its value to be a weighted average of its own previous value and those of its neighbors. We consider a node to be malicious or faulty if, instead of following the predefined linear strategy, it updates its value arbitrarily at each time-step (perhaps conspiring with other malicious nodes in the process). We show that the topology of the network completely characterizes the resilience of linear iterative strategies to this kind of malicious behavior. First, when the network contains 2 f  or fewer vertex-disjoint paths from some node  xj  to another node  xi  , we provide an explicit strategy for  f  malicious nodes to follow in order to prevent node  xi  from receiving any information about  xj 's value. Next, if node  xi  has at least 2 f +1 vertex-disjoint paths from every other (non-neighboring) node, we show that  xi  is guaranteed to be able to calculate any arbitrary function of all node values when the number of malicious nodes is  f  or less. Furthermore, we show that this function can be calculated after running the linear iteration for a finite number of time-steps (upper bounded by the number of nodes in the network) with almost any set of weights (i.e., for all weights except for a set of measure zero).
['Shreyas Sundaram', 'Christoforos N. Hadjicostis']
Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents