| Summary: | 碩士 === 元智大學 === 資訊工程學系 === 90 === According to improve secure multicasting obtaining a strictly secure mechanism, using in large group and highly dynamic joining and leaving, we use the more important key exchanging protocol, called Diffie-Hellman algorithm, and build up the tree-based key efficiently to adapt group key management.
In this article, we maintain the tree-based key suitable for renewing key. We define that leaves should be the all members; reminded nodes should be the positions of prim exponentiation; root should be the group key. As far as I know, the height of leaf’s position in tree key will be the most important element, which is operating cost. We have had researched a lot of algorithm for cost down, but we prefer to combine all new members into sub-tree and to keep approximated balanced group join, so we can be the best method which others have never done before.
Consequently, we are proud of our performance improvement. It is the most significant feature that we do insert new node near root and make joining group in balanced tree. All what we do are perfect solutions to get the limited cost threshold.
|
|---|
