Abstract
Existing key management schemes can secure group communication efficiently, but are failed on protecting the Group Dynamic Information (GDI) that may undermine group privacy. Recently, Sun et al. 1 proposed a scheme to hide the GDI with batch updating and phantom members inserting so that an adversary is not able to estimate the number of group members. In this paper, we first point out that their scheme is only applicable in departure-only group communication instead of the common conference groups. Secondly, we introduce our method of estimating the group size at a higher confidence level given a prior departure probability. Further, to enhance GDI protection and extend the application fields, we propose to protect GDI with two new mechanisms: chameleon member identifications and virtual departure events. The proposed scheme is effective to protect both centralized groups and contributory groups. The simulation shows that our scheme is better on protecting the GDI.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Reference
Yan Sun and K.J. Ray Liu, “Securing Dynamic Membership Information in Multicast Communications,” IEEE Infocom, 2004
A. Fiat and M. Naor, “Broadcast Encryption,” Crypto’ 93, LNCS 773, pp. 480–491, 1993
R. Canetti, J. Garay, G. Itkis, D. Miccianancio, M. Naor and B. Pinkas, “Multicast Security: a Taxonomy and Some Efficient Constructions,” IEEE Infocom, vol. 2, pp. 708–716, 1999.
Yevgeniy Dodis and Nelly Fazio, “Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack,” Public Key Cryptography, LNCS 2567, pp. 100–115, 2003
Yuh-Min Tseng, “A Scalable Key-management Scheme with Minimizing Key Storage for Secure Group Communications,” International Journal of Network Management, pp.419–425, 2003
Jack Snoeyink, Subhash Suri and George Varghese, “A Lower Bound for Multicast Key Distribution,” IEEE Infocom, pp.422–431, 2001
Sandro Rafaeli and David Hutchison, “A Survey of Key Management for Secure Group Communication,” ACM Computing Surveys, 35(3):309–329, 2003
Alan T. Sherman and David A. McGrew, “Key Establishment in Large Dynamic Groups Using One-Way Function Trees,” IEEE Trans. Software Eng. 29(5):444–458, 2003.
D.M. Wallner, E.J. Harder and R.C. Agee, “Key Management for Multicast: Issues and Architectures,” Internet Request for Comments 2627, June, 1999. ftp.ietf.org/rfc/rfc2627.txt
M. Waldvogel, G. Caronni, D. Sun, N. Weiler and B. Plattner, “The VersaKey framework: Versatile Group Key Management,” IEEE Journal on selected areas in communications, 17(9): 1614–1631, 1999.
O. Rodeh, K. Birman and D. Dolev, “Optimized Group Re-key for Group Communication Systems,” Network and Distributed System Security, pp. 39–48, 2000
K. Almeroth and M. Ammar, “Multicast Group Behavior in the Internet’s Multicast backbone (MBone),” IEEE Communications Magazine, 35(6): 124–129, 1997.
S. Acharya, B. Smith and P. Parnes, “Characterizing User Access to Videos on the World Wide Web,” ACM/SPIE Multimedia Computing and Networking, 2000
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Wu, Y., Li, T., Deng, R.H. (2005). Protecting Group Dynamic Information in Large Scale Multicast Groups. In: Sasaki, R., Qing, S., Okamoto, E., Yoshiura, H. (eds) Security and Privacy in the Age of Ubiquitous Computing. SEC 2005. IFIP Advances in Information and Communication Technology, vol 181. Springer, Boston, MA. https://doi.org/10.1007/0-387-25660-1_30
Download citation
DOI: https://doi.org/10.1007/0-387-25660-1_30
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25658-0
Online ISBN: 978-0-387-25660-3
eBook Packages: Computer ScienceComputer Science (R0)