Change search
ReferencesLink to record
Permanent link

Direct link
The Security Properties of In-Network Aggregation
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
2013 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

In-network aggregation is an important paradigm for current and future networked systems, enabling efficient cooperate processing of aggregate information, while providing sub-linear scalability properties. However, security of this important class of algorithms has to date not been sufficiently addressed.

In this dissertation, we focus on the integrity properties of in-network aggregation algorithms, with emphasis on the sub-goals of correctness and completeness. We propose an efficient solution that provides strong correctness guarantees by ensuring individual node integrity a priori by applying the principles of trusted systems. To this end, we propose dedicated trusted sensor and aggregator modules. Trusted modules, in conjunction with cryptographic authentication and transport protocols, are applied to construct trusted aggregation overlays, giving strong guarantees in terms of correctness. We support our findings by a proof-of-concept prototype in a single aggregator model, as well as a design for a hierarchical in-network aggregation system.

Completeness is a more elusive goal than correctness, if only for the fact that drops and message corruptions are a fact of life in distributed systems. Hence, it may not be possible to distinguish between benign and malicious losses. Building on the trusted systems solution for correctness, we propose a protocol that decreases the adversarial influence in a tree-based aggregation network. We exploit the fact that a secure protocol can be executed over a trusted overlay, enabling per-edge fault detection and dissemination of edge ratings. Simulation-based trials suggest that the presented protocol achieves significant reduction in the potential impact an adversary can have on the completeness of aggregate results.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2013. , vi, 145 p.
Trita-CSC-A, ISSN 1653-5723 ; 2013:02
National Category
Engineering and Technology
URN: urn:nbn:se:kth:diva-118773ISBN: 978-91-7501-673-3OAI: diva2:610522
Public defence
2013-03-27, F3, Lindstedtsvägen 26, KTH, Stockholm, 10:00 (English)

QC 20130312

Available from: 2013-03-12 Created: 2013-02-26 Last updated: 2013-03-13Bibliographically approved

Open Access in DiVA

fulltext(2612 kB)952 downloads
File information
File name FULLTEXT01.pdfFile size 2612 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Jonsson, Kristjan Valur
By organisation
Theoretical Computer Science, TCS
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 952 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 354 hits
ReferencesLink to record
Permanent link

Direct link