Authors: Shiuh-Jeng Wang, Yuh-Ren Tsai, Chien-Chih Shen, Pin-You Chen
Addresses: Department of Information Management, Central Police University, TaoYuan, 33304, Taiwan. ' Institute of Communications Engineering, National Tsing Hua University, Hsinchu, 30013, Taiwan. ' Institute of Communications Engineering, National Tsing Hua University, Hsinchu, 30013, Taiwan. ' Institute of Communications Engineering, National Tsing Hua University, Hsinchu, 30013, Taiwan
Abstract: In recent years, the ubiquity of communication networks speeds up the development of wireless network and the internet applications. In addition to the common service provided by the telecommunication enterprise, how to connect some distinct users to form a network which allow them to deal with their own works is a popular topic that many scholars engage in (Eskeland and Oleshchuk, 2007; Sun and Liu, 2007; Tzeng, 2006). When constructing the network, the key management is the most important problem that each system has to solve. There are many key agreement protocols which are non-hierarchical. However, the hierarchy is ubiquitous in our real life. In this paper, we have achieved a verifiable hierarchical key derivation scheme using the elliptic curve cryptography and the bilinear mapping function which can achieve the same security level but use less bit number when comparing to the RSA system.
Keywords: key agreement; hierarchical key derivation; group-oriented communications; elliptic curve cryptography; bilinear mapping function; network security.
International Journal of Information Technology, Communications and Convergence, 2010 Vol.1 No.1, pp.66 - 76
Published online: 16 Sep 2010 *Full-text access for editors Access for subscribers Purchase this article Comment on this article