A new scheme for establishing pairwise keys for wireless sensor networks

Gupta, Abhishek and Kuri, Joy and Nuggehalli, Pavan (2006) A new scheme for establishing pairwise keys for wireless sensor networks. In: 8th International Conference on Distributed Computing and Networking,, Dec 27-30, 2006, Guwahati, India, pp. 522-533.

PDF fulltext.pdf - Published Version Restricted to Registered users only Download (299kB) | Request a copy

Abstract

This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key predistribution technique. Inspired by the recent proxy-based scheme in [1] and [2], we introduce a fiiend-based scheme for establishing pairwise keys securely. We show that the chances of finding friends in a neighbourhood are considerably more than that of finding proxies, leading to lower communication overhead. Further, we prove that the friendbased scheme performs better than the proxy-based scheme in terms of resilience against node capture.

Item Type:	Conference Paper
Series.:	LECTURE NOTES IN COMPUTER SCIENCE
Publisher:	Springer
Additional Information:	Copyright of this article belongs to Springer.
Department/Centre:	Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited:	01 Sep 2010 05:59
Last Modified:	19 Sep 2010 06:12
URI:	http://eprints.iisc.ac.in/id/eprint/30512

Actions (login required)

View Item