Computer Science – Cryptography and Security
Scientific paper
2011-03-22
Computer Science
Cryptography and Security
The extended version of a paper that will appear at WiOpt 2011. Additional parts may later be reported elsewhere
Scientific paper
In the context of wireless sensor networks, the pairwise key distribution scheme of Chan et al. has several advantages over other key distribution schemes including the original scheme of Eschenauer and Gligor. However, this offline pairwise key distribution mechanism requires that the network size be set in advance, and involves all sensor nodes simultaneously. Here, we address this issue by describing an implementation of the pairwise scheme that supports the gradual deployment of sensor nodes in several consecutive phases. We discuss the key ring size needed to maintain the secure connectivity throughout all the deployment phases. In particular we show that the number of keys at each sensor node can be taken to be $O(\log n)$ in order to achieve secure connectivity (with high probability).
Makowski Armand M.
Yagan Osman
No associations
LandOfFree
On the gradual deployment of random pairwise key distribution schemes (Extended Version) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the gradual deployment of random pairwise key distribution schemes (Extended Version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the gradual deployment of random pairwise key distribution schemes (Extended Version) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-440434