Efficient identity-based multicast scheme from bilinear pairing

In a multicast communication system, when the membership changes, the group key must be refreshed securely and efficiently. The efficiency of the group key refreshment is critical, especially in a dynamic and large group since the size of deleted or added members may be quite large. An efficient identity-based multicast scheme based on pairings is proposed. It has distinct advantages in secure service over the existing schemes in the sense of dynamic group key management. The scheme satisfies forward secrecy and backward secrecy. A solution is also presented to the source authentication and data integrity services without introducing additional computation. In this scheme, the member can be a stateless receiver, who does not need to update his/her state from session to session.