The importance of secure communication between only legitimate group members in ad hoc networks has been growing in recent years. Due to the ad hoc nature the scalability on dynamic membership change is a major concern. However, the previous models require at least ) log ( n O communication cost for key update per each membership change, which imposes a heavy burden on the devices. In this paper we present a scalable model that supports communication-efficient membership change in ad hoc

more »

... s by exclusionary keys and RSA functions. The multicast cost for key update is extremely low, that is (1) O , and one-to-one communications occur mostly in neighboring devices.