Common use of Merge Protocol Clause in Contracts

Merge Protocol. In the first round of the merge protocol, all sponsors (members associated with topmost leaf node in each tree) exchange their respective key trees containing all blinded session randoms.3 The highest-numbered member of the largest tree becomes the sponsor of the second round in the merge protocol. After refreshing its session random, this sponsor computes every (key, bkey) pair up to the intermediate node just below the root node using the blinded session randoms of the other group members. It then broadcasts the key tree with the bkeys and blinded session randoms to the other members. All members now have the complete set of bkeys, which allows them to compute the new group key. New Node k’6 ,bk6’ r 7, br7 M 7 k’5,bk’5 r 6, br6 M 6 M 1 M 2 k 7 r 5, br5 k 3,bk 3 M 5 k 6,bk 6 r 7, br7 M 7 k 2,bk 2 r 5/k5, br5 / bk5 r 6, br6 r 1/k1, br1 / bk1 r 2, br2 r 3, br3 M 3 k4 k 3,bk 3 k 2,bk 2 r 4, br4 M 4 r 1/k1, br1 / bk1 r 2, br2 r 3, br3 M 3 M 5 M 6 M 1 M 2

Merge Protocol. In the first round of the merge protocol, all sponsors (members associated with topmost leaf node in each tree) exchange their respective key trees containing all blinded session randoms.3 The highest-numbered member of the largest tree becomes the sponsor of the second round in the merge protocol. After refreshing its session random, this sponsor computes every (key, bkey) pair up to the intermediate node just below the root node using the blinded session randoms of the other group members. It then broadcasts the key tree with the bkeys and blinded session randoms to the other members. All members now have the complete set of bkeys, which allows them to compute the new group key. New Node k’6 ,bk6’ r 7, br7 M 7 k’5,bk’5 r 6, br6 M 6 M 1 M 2 k 7 r 5, br5 k 3,bk 3 M 5 k 6,bk 6 r 7, br7 M 7 k 2,bk 2 r 5/k5, br5 / br5/ bk5 r 6, br6 r 1/k1, br1 / br1/ bk1 r 2, br2 r 3, br3 M 3 k4 k 3,bk 3 k 2,bk 2 r 4, br4 M 4 r 1/k1, br1 / br1/ bk1 r 2, br2 r 3, br3 M 3 M 5 M 6 M 1 M 2