ACM Home Page
Please provide us with feedback. Feedback
Security model and framework for information aggregation in sensor networks
Full text PdfPdf (494 KB)
Source
ACM Transactions on Sensor Networks (TOSN) archive
Volume 5 ,  Issue 2  (March 2009) table of contents
Article No. 13  
Year of Publication: 2009
ISSN:1550-4859
Authors
Mark Manulis  Technische Universität Darmstadt, Darmstadt, Germany
Jörg Schwenk  Ruhr-Universität Bochum, Bochum, Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 54,   Downloads (12 Months): 390,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1498915.1498919
What is a DOI?

ABSTRACT

Information aggregation is an important operation in wireless sensor networks (WSNs) executed for the purpose of monitoring and reporting environmental data. Due to the performance constraints of sensor nodes the in-network form of the aggregation is especially attractive since it allows saving expensive resources during frequent network queries. Easy accessibility of networks and nodes and almost no physical protection against corruptions raise high security challenges. Protection against attacks aiming to falsify the aggregated result is considered to be of prime importance.

In this article we design the first general framework for secure information aggregation in WSNs focusing on scenarios where aggregation is performed by one of its nodes. The framework achieves security against node corruptions and is based solely on the symmetric cryptographic primitives that are more suitable for WSNs in terms of efficiency. We analyze performance of the framework and unlike many previous approaches increase confidence in it by a rigorous proof of security within the specially designed formal security model.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
4
 
5
 
6
7
8
 
9
 
10
Perrig, A., Canetti, R., Tygar, J. D., and Song, D. 2002. The TESLA broadcast authentication protocol. RSA CryptoBytes 5, Summer.
11
12
 
13
 
14
Shoup, V. 2006. Sequences of games: A tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004/332. http://eprint.iacr.org/2004/332.pdf.
 
15
Sirivianos, M., Westhoff, D., Armknecht, F., and Girao, J. 2007. Non-manipulable aggregator node election protocols for wireless sensor networks. In International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt). IEEE Computer Society. http://www.ics.uci.edu/~msirivia/publications/sane-fullpaper.pdf.
 
16

Collaborative Colleagues:
Mark Manulis: colleagues
Jörg Schwenk: colleagues