TGDH is a distributed protocol, it requires no centralized entity to transport secret keys.
The following figures describes the proposed algorithm shows GDH subgroups organized in TGDH.
The Combined GDH and TGDH has been proposed which can enhance the secure group sharing using secret keys among group members.
A series of figures will now be presented to describe GK generation in the TGDH protocol.
In spite of the computational advantages of the TGDH protocol, two shortcomings exist.
A second shortcoming is that TGDH uses a tree structure for GK generation.
To resolve the first shortcoming for TGDH, the Enhanced TGDH (ETGDH)  was proposed.
Efficiency gains in GK generation over TGDH can be realized if GKs are generated by a protocol that: (1) determines which members are high-performance and which are low-performance, (2) prioritizes the generation of GKs for high-performance users, and (3) generates those GKs in descending order from the highest-performance member to the lowest.
Both TGDH and STR use a binary tree to compute the GK.
If a network fault is detected in ETGDH and TGDH, each remaining member updates its tree by deleting all partitioned members as well as their respective parent nodes.
15 shows that the overhead of TGDH while managing the tree structure increases until half of the group has been partitioned, after which it decreases.
For ETGDH and TGDH, the current group size is irrelevant.