Research Article
Secure Collaborative Key Management for Dynamic Groups in Mobile Networks
Assume that a current group is partitioned into two groups, () and (= ∖ ). | The master of is and the master of is () | Step 1. generate = from . | (delegation) → : | Step 2. and select random , in respectively and compute key-locks with their locker list. | : 1, , ≠ | : , ≠ |
|