Hierarchical key derivation scheme for group-oriented communication systems Online publication date: Thu, 16-Sep-2010
by Shiuh-Jeng Wang, Yuh-Ren Tsai, Chien-Chih Shen, Pin-You Chen
International Journal of Information Technology, Communications and Convergence (IJITCC), Vol. 1, No. 1, 2010
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information Technology, Communications and Convergence (IJITCC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook