Abstract
AbstractFor group-oriented applications, designing secure and efficient group key management schemes is a major problem. We present a group key management scheme for dynamic peer networks, which supports join, leave, merge and partition events. In the scheme, the numbers of rounds and messages are close to the lower bounds of those for dynamic group key management, and the length of messages and computation costs are less than those of the existing schemes. Furthermore, this scheme provides forward secrecy, backward secrecy and key independence.
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.
