Protecting Group Dynamic Information in Large Scale Multicast Groups
نویسندگان
چکیده
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. 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.
منابع مشابه
Title of Dissertation : MULTI - USER SECURITY FOR MULTICAST COMMUNICATIONS
Title of Dissertation: MULTI-USER SECURITY FOR MULTICAST COMMUNICATIONS Yan Sun, Doctor of Philosophy, 2004 Dissertation directed by: Professor K. J. Ray Liu Department of Electrical and Computer Engineering The ubiquity of communication networks is facilitating the development of wireless and Internet applications aimed at allowing users to communicate and collaborate amongst themselves. In th...
متن کاملTackling Group-Tree Matching in Large Scale Group Communications
As a mechanism to support group communications, multicasting faces a serious state scalability problem when there are large numbers of groups in the network: lots of resources (e.g., memory to maintain group state information) and control overhead (e.g., multicast tree setup and maintenance) are required to manage the groups. Recently, an efficient solution called aggregated multicast is propos...
متن کاملA Study of Group-Tree Matching in Large Scale Group Communications
As a mechanism to support group communications, multicasting faces a serious state scalability problem when there are large numbers of groups in the network: lots of resources (e.g., memory to maintain group state information) and control overhead (e.g., multicast tree setup and maintenance) are required to manage the groups. Recently, an efficient solution called aggregated multicast is propos...
متن کاملMulticast Architecture with Adaptive Dual-state
Multicast is an approach that uses network and server resources efficiently to distribute information to groups. As networks evolve to become information-centric, users will increasingly demand publish-subscribe based access to finegrained information, and multicast will need to evolve to (i) manage an increasing number of groups, with a distinct group for each piece of distributable content; (...
متن کاملIssues in Designing a Communication Architecture for Large-Scale Virtual Environments
This paper describes the issues in designing a communication architecture for large-scale virtual environments on the Internet. We propose an approach at the transport-layer, using multiple multicast groups and multiple agents. Our approach involves the dynamic partitioning of the virtual environment into spatial areas and the association of these areas with multicast groups. In our work, we de...
متن کامل