A new scheme for establishing pairwise keys for wireless sensor networks
Contribuinte(s) |
Chaudhuri, S Das, SR Paul, HS Tirthapura, S |
---|---|
Data(s) |
2006
|
Resumo |
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. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/30512/1/fulltext.pdf 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. |
Publicador |
Springer |
Relação |
http://www.springerlink.com/content/tl3243378766573l/ http://eprints.iisc.ernet.in/30512/ |
Palavras-Chave | #Electronic Systems Engineering (Formerly, (CEDT) Centre for Electronic Design & Technology) |
Tipo |
Conference Paper PeerReviewed |