Group-Key Generation through Ternary Tree Based Rebuild Algorithm
V.Srinadh1, P.V. Nageswara Rao2
1V.Srinadh, P.V., Assistant professor of Computer Science and Engineering at GMRIT, Rajam, Andhra Pradesh.
2Nageswara Rao, Professor, Department of CSE, GITAM University, Visakhapatnam.
Manuscript received on 03 August 2019. | Revised Manuscript received on 07 August 2019. | Manuscript published on 30 September 2019. | PP: 7474-7478 | Volume-8 Issue-3 September 2019 | Retrieval Number: C5811098319/2019©BEIESP | DOI: 10.35940/ijrte.C5811.098319
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Security plays essential role in any correspondence framework particularly in Group oriented correspondence. In Group oriented correspondence, entire correspondence will occur with the help of one secret key which is called Group Key. This gathering key must be changed at whatever point another part joins into the gathering just as a current part leaves from the gathering; which is known as rekeying. This gathering correspondence can be spoken to utilizing key tree. In case we utilize ternary tree, tallness of the tree will be expanded if the group members are more, so that rekeying activity takes additional time. Rather than ternary tree on the off chance that we use quad tree, so that the tree stature will be less, so that rekeying activity takes less time. So the correspondence will be increasingly secure and quicker. In this paper we are going to implement Ternary tree based Rebuild Algorithm.
Key-Words: Group Key, Rekeying, Backward Confidentiality, Forward Confidentiality, Security, Ternary Tree
Scope of the Article: Next Generation Internet & Web Architectures