ACM Home Page
Please provide us with feedback. Feedback
A ROM-friendly secure code update mechanism for WSNs using a stateful-verifier τ-time signature scheme
Full text PdfPdf (687 KB)
Source
Conference On Wireless Network Security archive
Proceedings of the second ACM conference on Wireless network security table of contents
Zurich, Switzerland
SESSION: Sensor Network Security (I) table of contents
Pages 29-40  
Year of Publication: 2009
ISBN:978-1-60558-460-7
Authors
Osman Ugus  NEC Laboratories Europe, Heidelberg, Germany
Dirk Westhoff  NEC Laboratories Europe, Heidelberg, Germany
Jens-Matthias Bohli  NEC Laboratories Europe, Heidelberg, Germany
Sponsors
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 26,   Downloads (12 Months): 130,   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/1514274.1514279
What is a DOI?

ABSTRACT

Several mechanisms have been proposed to efficiently authenticate multicast of finite data streams as needed for code image updates in wireless sensor networks (WSNs). They involve either a public-key digital signature or loose time synchronization between the sender and the receivers. What usually does not get any attention is the program memory (ROM) occupied by these mechanisms which do not fulfill the primary task of a sensor network.

An optimized implementation of the elliptic curve digital signature scheme occupies up to 25% of the ROM of a TelosB node; the same or even more is needed for time synchronization schemes. Therefore, if sensor networks do not need public-key operations or time synchronization for their primary task, these SCU mechanism are not suitable for coexistence with the application code on the sensor nodes. This work contributes in two directions. Firstly, we propose a stateful-verifier T-time signature scheme based on Merkle's one-time signature. Secondly, we propose a protocol exploiting our signature scheme for securing existing code image update protocols for WSNs minimizing ROM overhead to 1% on TelosB motes.


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
TinyOS: An open-source operating system designed for wireless embedded sensor networks, 2007. http://www.tinyos.net/.
 
2
3
 
4
Ran Canetti, Juan Garay, Gene Itkis, Daniele Micciancio, Moni Naor, and Benny Pinkas. Multicast security: A taxonomy and some efficient constructions. In Proc. IEEE INFOCOM'99, volume 2, pages 708{716, New York, NY, March 1999. IEEE.
5
6
7
 
8
Christian Gehrmann and Mats Näslund. ECRYPT Yearly Report on Algorithms and Keysizes (2006), D.SPA.21 Rev. 1.1, January 2007.
 
9
10
 
11
 
12
Markus Jakobsson, Tom Leighton, Silvio Micali, and Michael Szydlo. Fractal merkle tree representation and traversal. In Topics in Cryptology - CT-RSA 2003: The Cryptographers' Track at the RSA Conference 2003, pages 314--326. Springer, 2003.
 
13
 
14
 
15
An Liu and Peng Ning. TinyECC: Elliptic Curve Cryptography for Sensor Networks (Version 1.0), 2007 2007.
 
16
 
17
 
18
19
 
20
Michael Szydlo. Merkle tree traversal in log space and time. In Advances in Cryptology - EUROCRYPT'04, pages 541--554. Springer, 2004.
21
 
22
O. Ugus, D. Westhoff, R. Laue, A. Shoufan, and S.A. Huss. Optimized implementation of elliptic curve based additive homomorphic encryption for wireless sensor networks. In 2nd Workshop on Embedded Systems Security, WESS'2007, 2007.

Collaborative Colleagues:
Osman Ugus: colleagues
Dirk Westhoff: colleagues
Jens-Matthias Bohli: colleagues