By Topic

How to break LU matrix based key predistribution schemes for Wireless Sensor Networks

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

4 Author(s)
Bo Zhu ; Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200240 China ; Yanfei Zheng ; Yaowei Zhou ; Kefei Chen

A key predistribution scheme for wireless sensor networks was proposed by Choi and Youn in 2005, which is based on LU decomposition of symmetric matrix. After that, several key predistribution schemes were designed on the basis of Choi and Youn's original scheme. In this paper, we carefully investigate a mathematical theorem about symmetric matrix, by following which adversaries could easily obtain the secret keys deployed via Choi and Youn's scheme. We also analyze all the schemes derived from Choi and Youn's and point out their vulnerabilities. In addition, we propose a revised scheme avoiding the security flaw.

Published in:

2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems

Date of Conference:

12-15 Oct. 2009