This paper appears in:
Performance, Computing, and Communications Conference, 2005. IPCCC 2005. 24th IEEE International
Date of Conference:
7-9 April 2005
Author(s):
Mehta, M.
Dept. of Comput. Sci. & Electr. Eng., Missouri Univ., Kansas City, MO, USA
Huang, D.
;
Harn, L.
Page(s):
193 - 197
Product Type:
Conference Publications
Abstract
Efficient schemes for key predistribution and shared-key discovery play a vital role in security and efficiency of pairwise key establishment in sensor networks. In this paper, we propose a scheme for key predistribution using hash-chain and subsequent shared-key discovery. We show potential active attacks on sensor networks due to key predistribution which can have severer consequences as compared to attacks described in existing proposals. We also show that as compared to the existing schemes, our scheme is more resilient to these active attacks.
Index Terms
Index Terms are available to subscribers and IEEE members.
On page(s): 193
ISSN : 1097-2641
Print ISBN: 0-7803-8991-3
INSPEC Accession Number: 8613198
Digital Object Identifier : 10.1109/PCCC.2005.1460551
Date of Current Version :
05 July 2005
Issue Date :
7-9 April 2005
Available to subscribers and IEEE members.
Available to subscribers and IEEE members.
