Secure distributed top-k aggregation
2012 (English)In: Communications (ICC), 2012 IEEE International Conference on, IEEE , 2012, 804-809 p.Conference paper (Refereed)
In-network aggregation is an efficient and scalable distributed approach to global state approximation. However, security remains an open problem in such systems, especially when we consider dynamic network effects, such as mobility, packet loss and churn. In this paper, we consider the reseilience of the top-k aggregate to manipulation by active insider adversaries. Unfortunately, this versatile aggregation function is inherently insecure. We propose a simple, low-overhead solution to the problem of preserving aggregate integrity which leverages the principles of trusted systems. The solution we propose is generally applicable, even to the challenging problem of securing distributed aggregation in a dynamic network.
Place, publisher, year, edition, pages
IEEE , 2012. 804-809 p.
, IEEE International Conference on Communications, ISSN 1550-3607
Distributed systems, secure in-network aggregation, top-k aggregation, trusted systems
IdentifiersURN: urn:nbn:se:kth:diva-112848DOI: 10.1109/ICC.2012.6364049ScopusID: 2-s2.0-84871976102ISBN: 978-145772052-9OAI: oai:DiVA.org:kth-112848DiVA: diva2:587557
2012 IEEE International Conference on Communications, ICC 2012; Ottawa, ON; 10 June 2012 through 15 June 2012
QC 201301162013-01-142013-01-142013-01-16Bibliographically approved