Research Article
Secure Collaborative Key Management for Dynamic Groups in Mobile Networks
Assume that a group is merged into a group where , and the merged | group = . is the master of and is the master of . | Step 1. selects a random number in , computes = mod p, and updates | the locker list into = , , . | (delegation) → : | Step 2. selects random in for new group key and computes key-locks with updated locker list. | : , |
|