loading...
A Scalable Group Rekeying Scheme using Secret Mask Patterns
Fukuoka, Japan March 29-March 31
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2004.128390918th International Conference on Adva ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yaser M. Asem, University of Aizu, Japan
A. Kara, University of Aizu, Japan
In this paper, we propose a new group rekeying method for changing the multicast group key: Matrix-Mask based Group Rekeying "MMGR." 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, the computational cost for group rekeying is constant with respect to the number of group members up to the capacity of the matrix used, and the rekeying message construction and the group key retrieval processes require simple logical operations.
Citation:
Yaser M. Asem, A. Kara, "A Scalable Group Rekeying Scheme using Secret Mask Patterns," aina, vol. 1, pp.190, 18th International Conference on Advanced Information Networking and Applications (AINA'04) Volume 1, 2004
Usage of this product signifies your acceptance of the Terms of Use.