A scalable group-rekeying scheme using secret mask patterns
by Yaser M. Asem, A. Kara
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 3, No. 5/6, 2005

Abstract: In this paper, we propose a new group-rekeying method for changing the multicast group key matrix-mask-based group-rekeying (MMGR). The main aim of our rekeying method is to solve the rekeying problem that arises when some group members leave the group. In MMGR, the group controller constructs the rekeying message using a numerical matrix, and the group members apply secret bit masks on the matrix to get the group key. MMGR does not need computationally expensive encryption of the group key before transmission and hence eliminates the need to decrypt it after receiving the rekeying message. In MMGR, rekeying message construction and group key retrieval processes need only simple operations. The computational cost of the rekeying server is low, and the computational cost of the group members is low and constant regardless of the rekeying message size.

Online publication date: Fri, 31-Mar-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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