Tree Management. Modular exponentiation is the most computationally expensive operation in TGDH. The number of exponentiations for a membership event depends on the current tree structure and distance between the sponsor node and the root node. We can find good examples in join and leave operations. If the distance between the sponsor and the root node is , the join and leave protocol requires modular exponentiations. Therefore, sponsor has to be chosen as near as possible to the root node. Another important goal of tree management policy is to maintain the key tree as balanced as possible. If key tree is not well-balanced, future leave (partition) event may require many modular exponentiations. In summary, our goal for the tree management policy is to: <0,0> <0,0> New Intermediate node <0,0> <1,0> <1,1> <1,0> M6 ▇▇ M7 <1,0> <1,1> M1 <2,1> ▇▇ <▇,▇> <2,0> <2,1> <2,2> <2,3> M5 Sponsor M3 M4 <3,0> <3,1> <3,2> <3,3> <3,4> <3,5> M1 M2 M6 M7 M3 M4 Tree T2 Tree T7 Tree T2 Current members new members
Appears in 2 contracts
Sources: Group Key Agreement, Group Key Agreement