Iolus

Abstract

As multicast applications are deployed for mainstream use, the need to secure multicast communications will become critical. Multicast, however, does not fit the point-to-point model of most network security protocols which were deaigned with unicast communications in mind. As we will show, securing multicast (or group) communications is fundamentally different from securing unicast (or paired) communications. In turn, these differences can result in scalability problems for many typical applications.In this paper, we examine and model the differences between unicast and multicast security and then propose Iolus: a novel framework for scalable secure multicasting.Protocols based on 101~s can be used to achieve a variety of securjty objectives and may be used either to directly secure multicast communications or to provide a separate group key management service to other "security-aware" applications, We describe the architecture and operation of Iolus in detail and also describe our experience with a protocol based on the 101~s framework.

A Group Key Management Scheme for WSN Based on Lagrange Interpolation Polynomial Characteristic

“…The most representative of this class scheme is CLIQUES [24], in which the key transmission delay is ( ) O N , the computation cost for group key updating is ( ) 2 O N , and the communication cost for group key updating is ( ) 2 O N , where the N is the size of group, so the CLIQUES scalability is poor. [25][26][27][28] The clustered group key management scheme combines the characteristics of the centralized and the distributed schemes. In this scheme, group members are divided into several subgroups and each sub group has one control node, in which there are two layers structure consisting of a management layer by the control nodes and a member layer by the member nodes.…”

The Research of Security Network Group Key Management

“…To these kinds of ideas about the group key agreement, all the users can participate in the group key agreement and updating impartially, then every node member need to save and maintain the whole key tree framework, that is, supposing the member of nodes is N, the complexity for saving key data is O(N), which can lead to vast saving cost and communication overhead, also can confine the extensibility for distributed secure group communication. To the Iolus scheme designed in paper [7] , communication overhead and calculation cost can be decreased to O(N/n) by the idea of all the nodes being divided into several sub-group, where, n denotes the amount of sub-group.…”

A New Groups Key Distribution for Secure Wireless Multicast

“…Each of them is controlled by a manager. There are several scheme have been proposed, such as Iolus [4]. It also raises another issue that communication overhead across the subgroups is heavy.…”