DocumentCode
2455414
Title
How to break LU matrix based key predistribution schemes for Wireless Sensor Networks
Author
Zhu, Bo ; Zheng, Yanfei ; Zhou, Yaowei ; Chen, Kefei
Author_Institution
Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., Shanghai, China
fYear
2009
fDate
12-15 Oct. 2009
Firstpage
237
Lastpage
245
Abstract
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.
Keywords
cryptography; matrix decomposition; wireless sensor networks; LU matrix decomposition; cryptographic keys; key predistribution schemes; mathematical theorem; wireless sensor networks; Ad hoc networks; Communication system security; Computer science; Fabrics; Mobile ad hoc networks; Mobile computing; Public key; Routing protocols; Wireless networks; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Mobile Adhoc and Sensor Systems, 2009. MASS '09. IEEE 6th International Conference on
Conference_Location
Macau
Print_ISBN
978-1-4244-5113-5
Type
conf
DOI
10.1109/MOBHOC.2009.5336993
Filename
5336993
Link To Document