Andere Kunden interessierten sich auch für
![Secure Group communication in Wireless Sensor Networks]( "Secure Group communication in Wireless Sensor Networks")
Secure Group communication in Wireless Sensor Networks47,99 €![Secure Group Communication Protocols in Wireless Mobile Environment]( "Secure Group Communication Protocols in Wireless Mobile Environment")
Secure Group Communication Protocols in Wireless Mobile Environment24,99 €![Secure Group Communication based on Lagrange Interpolation]( "Secure Group Communication based on Lagrange Interpolation")
Secure Group Communication based on Lagrange Interpolation52,99 €![Authentication Scheme for Dynamic Group Using Threshold Cryptography]( "Authentication Scheme for Dynamic Group Using Threshold Cryptography")
Authentication Scheme for Dynamic Group Using Threshold Cryptography26,99 €![Privacy-preserving and Untraceable Group Data Sharing Scheme in Cloud]( "Privacy-preserving and Untraceable Group Data Sharing Scheme in Cloud")
Privacy-preserving and Untraceable Group Data Sharing Scheme in Cloud29,99 €![Group Key Agreement for Ad Hoc Networks]( "Group Key Agreement for Ad Hoc Networks")
Group Key Agreement for Ad Hoc Networks39,99 €![Centralized Group Aware Duty Cycle Control Protocol for WSNs]( "Centralized Group Aware Duty Cycle Control Protocol for WSNs")
Centralized Group Aware Duty Cycle Control Protocol for WSNs32,99 €
Many emerging applications e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work are based upon a group communications model, i.e., they require packet delivery from one or more authorized senders to a very large number of authorized receivers. As a result, securing group communications i.e., providing confidentiality, integrity, and authenticity of messages delivered between group members will become a critical networking issue. In this paper, we present a novel solution to the scalability problem of group multicast key management. We formalize the notion of a secure group as a triple U; K; R where U denotes a set of users, K a set of keys held by the users, and R a user-key relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely distributing rekey messages after a join leave, and specify protocols for joining and leaving asecure group. The re keying strategies and join leave protocols are implemented in a prototype group key server we have built.