loading...
Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast
Kauai, Hawaii January 04-January 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HICSS.2006.143Proceedings of the 39th Annual Hawaii ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
M. H. Heydari, James Madison University
L. Morales, Texas A&M University-Commerce
I. H. Sudborough, University of Texas at Dallas
Secure multicast has a variety of applications in e-commerce, e-banking, command and control, video-on-demand, and other internet-based services. In this paper, we present algorithms to improve on the number of re-keying messages (overhead) needed to add and delete sets of users to a secure multicast group. We present upper and lower bounds on the number of re-keying bits to add or delete groups of users from secure multicast groups. We also show how to amortize the cost of group re-keying over time to avoid long periods of system overhead that can potentially block the transmission of desired data at times when large numbers of users simultaneously join or leave multicast sessions.
Index Terms:
Secure multicast, secure multicast re-keying multicasting, group key management, security, tree-based system, re-key complexity, batch re-keying
Citation:
M. H. Heydari, L. Morales, I. H. Sudborough, "Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast," hicss, vol. 9, pp.218b, Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06) Track 9, 2006
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions