In this paper we propose a novel security model for the aggregation process based on the well-established cryptographic techniques, focusing on the scenario with the single aggregator node. In order to show soundness and feasibility of our definitions we describe a generic practical approach that achieves security against node corruptions during the aggregation process in a provable cryptographic way based solely on the symmetric cryptographic primitives. To the best of our knowledge this is the first paper which aims to combine the paradigm of provable security in the cryptographic sense with the task of information aggregation in WSNs.
Category / Keywords: cryptographic protocols / aggregation, sensor networks, provable security Publication Info: ICCSA 2007 Date: received 24 Jul 2007, last revised 14 Oct 2008 Contact author: mark manulis at nds rub de Available format(s): PDF | BibTeX Citation Note: A shorter version is published at "Computational Science and Its Applications (ICCSA 2007)", pp.603-621, LNCS 4705, Springer.A full version appears uner the title "Security Model and Framework for Information Aggregation in Sensor Networks" in ACM Transactions on Sensor Networks (ACM TOSN), in volume 5, issue 2, in 2009.
Version: 20081014:115018 (All versions of this report) Short URL: ia.cr/2007/283 Discussion forum: Show discussion | Start new discussion