We present and analyze a new algorithm for establishing shared cryptographic keys in large, dynamically changing groups. Our algorithm is based on a novel application of one-way function trees. In comparison with previously published methods, our algorithm achieves a new minimum in the number of bits that need to be broadcast to members in order to re-key after a member is added or evicted. The number of keys stored by group members, the number of keys broadcast to the group when new members are added or evicted, and the computational e orts of group members, are logarithmic in the number of group members. Our algorithm provides complete forward and backwards security: newly admitted group members cannot read previous messages, and evicted members cannot read future messages, even with collusion by arbitrarily many evicted members. This algorithm o ers a new scalable method for establishing group session keys for secure large-group applications such as electronic conferences, multicast sessions, and military command and control.
Sherman and McGrew REF proposed one-way function trees for efficient key generation.
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
Computer Science