By Topic

Securing Communication Trees in Ad Hoc Sensor Networks with Polynomial-Based Key Pre-Distribution

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jan Nikodem ; Institute of Computer Science, Control and Robotics, Wroc¿aw University of Technology, 27 Wybrze¿e Wyspia¿skiego Street, 54-370 Wroc¿aw, POLAND. jan.nikodem@pwr.wroc.pl ; Maciej Nikodem

There are many applications of ad hoc sensor networks that have to ensure immunity to adversaries. One challenge is how to bootstrap secure communication among nodes. In this paper we propose a novel key pre-distribution scheme based on polynomials. The properties of our scheme are the same as a scheme presented by Blom, but we propose to use a different technique that can be easily extended if we get rid of a node's computation constrains. By using polynomial-based key pre-distribution, we can reduce the storage requried at receivers down to O(t) where t is a system and security parameter. Moreover using only this information, pairwise keys can be established efficiently for each pair of nodes which enable secure construction of the communication tree.

Published in:

Computers and Communications, 2007. ISCC 2007. 12th IEEE Symposium on

Date of Conference:

1-4 July 2007