Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

LARK: A Lightweight Authenticated ReKeying Scheme for Clustered Wireless Sensor Networks

LARK: A Lightweight Authenticated ReKeying Scheme for Clustered Wireless Sensor Networks LARK: A Lightweight Authenticated ReKeying Scheme for Clustered Wireless Sensor Networks GIANLUCA DINI and IDA M. SAVINO, University of Pisa Group communication has proven a powerful paradigm for designing applications and services in Wireless Sensor Networks (WSNs). Given the tight interaction between WSNs and the physical world, a security infringement may translate into a safety infringement. Therefore, in order to fully exploit the group communication paradigm we need to secure it. Traditionally, this requirement has been formalized in terms of backward and forward security and ful lled by means of rekeying. In WSNs, group rekeying becomes particularly a complex problem because communication takes place over an easily accessible wireless medium and because sensor nodes have severe limitations in terms of computing, storage, energy, and tamper-resistance capabilities for cost reasons. In this article we present a Lightweight Authenticated ReKeying (LARK) scheme for clustered WSNs. LARK guarantees backward and forward security, is scalable in terms of communication overhead, and ef cient in terms of computing overhead for key authentiticy veri cation. LARK achieves security, ef ciency, and scalability by exploiting two basic well-known mechanisms, namely key graph and key chain, and integrating them in an original way. LARK supports a http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Embedded Computing Systems (TECS) Association for Computing Machinery

LARK: A Lightweight Authenticated ReKeying Scheme for Clustered Wireless Sensor Networks

Loading next page...
 
/lp/association-for-computing-machinery/lark-a-lightweight-authenticated-rekeying-scheme-for-clustered-R0etwn2CWF

References (76)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2011 by ACM Inc.
ISSN
1539-9087
DOI
10.1145/2043662.2043665
Publisher site
See Article on Publisher Site

Abstract

LARK: A Lightweight Authenticated ReKeying Scheme for Clustered Wireless Sensor Networks GIANLUCA DINI and IDA M. SAVINO, University of Pisa Group communication has proven a powerful paradigm for designing applications and services in Wireless Sensor Networks (WSNs). Given the tight interaction between WSNs and the physical world, a security infringement may translate into a safety infringement. Therefore, in order to fully exploit the group communication paradigm we need to secure it. Traditionally, this requirement has been formalized in terms of backward and forward security and ful lled by means of rekeying. In WSNs, group rekeying becomes particularly a complex problem because communication takes place over an easily accessible wireless medium and because sensor nodes have severe limitations in terms of computing, storage, energy, and tamper-resistance capabilities for cost reasons. In this article we present a Lightweight Authenticated ReKeying (LARK) scheme for clustered WSNs. LARK guarantees backward and forward security, is scalable in terms of communication overhead, and ef cient in terms of computing overhead for key authentiticy veri cation. LARK achieves security, ef ciency, and scalability by exploiting two basic well-known mechanisms, namely key graph and key chain, and integrating them in an original way. LARK supports a

Journal

ACM Transactions on Embedded Computing Systems (TECS)Association for Computing Machinery

Published: Nov 1, 2011

There are no references for this article.