Partition Protocol. We assume that a network failure causes a partition of the n-member group. From the viewpoint of each remaining member, this event appears as a simulta- neous leaving of multiple members. The Partition protocol is involves multiple rounds; it runs until all members compute the new group key. In the first round, each remaining member updates its tree by deleting all partitioned members as well as their respective parent nodes and “compacting” the tree. The procedure is summarized in Table 4.
Appears in 1 contract
Sources: Research Paper
Partition Protocol. We assume that a network failure causes a partition of the n-member group. From the viewpoint of each remaining member, this event appears as a simulta- neous leaving of multiple members. The Partition protocol is involves multiple rounds; it runs until all members compute the new group key. In the first first round, each remaining member updates its tree by deleting all partitioned members as well as their respective parent nodes and “compacting” the tree. The procedure is summarized in Table 4.
Appears in 1 contract
Sources: Group Key Agreement