Name
Abstract | ||
|---|---|---|
How to discover a captured node and to resist node capture attack is a challenging task in Wireless Sensor Networks (WSNs). In this paper, we propose a node capture resistance and key refreshing scheme for mobile WSNs which is based on the Chinese remainder theorem. The scheme is able of providing forward secrecy, backward secrecy and collusion resistance for diminishing the effects of capture attacks. By implementing our scheme on a Sun SPOT based sensor network testbed, we demonstrate that the time for updating a new group key varies from 56 ms to 546 ms and the energy consumption is limited to 16.5 -- 225 mJ, depending on the length of secret keys and the number of sensors in a group. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/LCN.2011.6115207 | LCN |
Keywords | Field | DocType |
sun spot,collusion resistance,node capture resistance,capture attack,sensor capture resistance,new group key,secret key,mobile wsns,chinese remainder theorem,forward secrecy,key refreshing scheme,sun,mobile communication,security,resistance,mobile computer,wireless sensor networks,mobile computing,sensor network,wireless sensor network | Group key,Mobile computing,Key distribution in wireless sensor networks,Computer science,Sun SPOT,Computer network,Testbed,Forward secrecy,Wireless sensor network,Mobile telephony | Conference |
ISSN | Citations | PageRank |
0742-1303 | 2 | 0.39 |
References | Authors | |
13 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yi Ren | 1 | 62 | 17.07 |
| Vladimir Oleshchuk | 2 | 66 | 7.91 |
| Frank Y. Li | 3 | 316 | 42.69 |
| Selo Sulistyo | 4 | 12 | 6.38 |