Browse > Article

New Byzantine Resilient Multi-Path Key Establishment Scheme for Wireless Sensor Networks  

Kim, Young-Sik (삼성전자)
Jang, Ji-Woong (UCSD 전기컴퓨터공학부)
Lim, Dae-Woon (동국대학교 정보통신공학과)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.34, no.9C, 2009 , pp. 855-862 More about this Journal
Abstract
The path key establishment phase in the wireless sensor network is vulnerable to Byzantine attack. Huang and Hedhi proposed a Byzantine resilient multi-key establishment scheme using a systematic RS code, which has shortcomings of exposing a part of message symbols and inefficient transmission. In this paper, we propose a new Byzantine resilient multi-path key establishment scheme in which direct message symbols are not exposed to an adversary and are more efficiently transmitted the RS-encoded symbols to the destination node. In the Proposed scheme, a non-systematic RS code is used to transmit a generated indirect secret key and each encoded symbol is relayed through available paths between two sensor nodes. If enough symbols are collected at the destination node, it is possible to reconstruct the secret message through RS decoding.
Keywords
Byzantine attack; multi-path key establishment; perfectly secure message transmission; Reed-Solomon code; wireless sensor network;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Dolev, C. Dwork, O. Waarts, and M. Yung, 'Perfectly Secure Message Transmission,' J. ACM, vol. 40, no. 1, pp. 17-47, Jan. 1993   DOI
2 A. Shiozaki, T. K. Truong, K. M Cheung, and I. S. Reed, 'Fast transform decoding of nonsystematic Reed-Solomon codes,' IEE Proc., vol. 137, no. 2, pp. 139-143, Mar. 1990   DOI   ScienceOn
3 S. Hadim and N. Mohamed, 'Middleware challenges and approaches for wireless sensor networks,' IEEE Distributed Systems Online, vol. 7, no. 3, pp. 1-1, Mar. 2006   DOI   ScienceOn
4 Matthias Fitzi, Matthew Franklin, Juan Garay, and S. Harsha Vardhan, 'Towards optimal and efficient perfectly secure message transmission,' IACR Theory of Cryptography Conference (TCC 2009), LNCS 4392, pp. 311-322, 2007
5 L. Lamport, R. Shostak, and M. Pease, 'The Byzantine Generals Problem,' ACM Trans. Programming Languages and Systems, vol. 4, no. 3, pp. 382-401, July 1982   DOI
6 Y. Wang, G. Attebury, and B. Ramamurthy, 'A survey of security issues in wireless sensor network,' IEEE Commun. Survey & Tutorials, vol. 8, no. 2, pp. 2-23, 2nd Quater 2006   DOI
7 L. Eschenauer and V. D. Gligor, 'A keymanagement scheme for distributed sensor network,' in Proc. 9th ACM Conf Computer, Commun. Security, Nov. 2002, pp. 41-47
8 H. Chan, A. Perrig, and D. Song, 'Random key predistribution scheme for sensor networks,' in Proc. IEEE Symp. Security and Privacy (SP 2003), 11-14 May 2003, pp. 197-213
9 D. Huang and D. Medhi, 'A Byzantine resilient multi-path key establishment scheme and its robustness analysis for sensor network,' in Proc. IEEE IPDPS 2005, 4-8 Apr. 2005