Abstract
AbstractIn dynamic peer networks, how to promote the performance of group key management without sacrificing the desired security is a critical and difficult problem. In this paper, a secure, efficient and distributed group key management scheme is presented and its security is proved. The scheme is based on hierarchical key tree and multi-party key agreement, and has the desired properties, suck as key independence and statelessness. The related analysis shows that the ternary key tree is most applicable to group key management, and the corresponding key management scheme is efficient in the computation cost, storage cost and feasibility.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
