Secure Data Aggregation Through Proactive Defense

Authors: Shuo Chen, Guillaume Pierre and Chi-Hung Chi.
Source: In Proceedings of the 2nd IEEE Workshop on Grid and P2P Systems and Applications (GridPeer), August 2010.


Gossip based aggregation protocols are a promising approach to monitoring large-scale decentralized IT infrastructures. Compared to traditional approaches they exhibit good properties of scalability, tolerance of churn, and communication overhead. Gossip-based protocols can compute statistical aggregates such as the average, sum or statistical distribution of an attribute across a large system. However, such protocols are extremely vulnerable to malicious attacks, and even a small number of attackers in the system can largely undermine aggregation results. This paper presents a secure protocol for computing attribute averages. In this system, each node autonomously judges whether its neighbors are malicious, and may subsequently stop any interaction with them. A node appearing malicious to its neighbors quickly gets excluded from the system. Instead of defining malicious behavior (and excluding nodes that follow the definition of maliciousness), our system defines correct behavior (and excludes any node that behaves differently). This allows in principle our system to address arbitrary types of attacks. Simulations based on real-world attribute data demonstrate that our system offers good resistance against four different types of attacks.


  • The paper, in PDF (131,342 bytes)

Bibtex Entry

  author = 	 {Shuo Chen and Guillaume Pierre and Chi-Hung Chi},
  title = 	 {Secure Data Aggregation Through Proactive Defense},
  booktitle =    {Proceedings of the 2nd IEEE Workshop on Grid and P2P Systems and Applications (GridPeer)},
  year = 	 {2010},
  month = 	 aug