In this paper we propose a secure group communication
model with low communication complexity using multiplicative one-way
functions and exclusive keys. When totally n users are in the group, it
reduces the complexity of multicast message required in join or leave
operation from O(log n) to O(1) keeping other complexities comparable.
Therefore, it is very applicable to a wide area network environment or a
low-bandwidth channel such as ad hoc network.