Abstract
Group key agreement protocols are crucial for achieving secure group communications. They are designed to provide a lot of users with a shared secret for cryptographic purpose. In wireless mobile net works, low-power group members may join and leave the group frequently. Dynamic key agreement protocol is in need. It is desirable to minimize the number of rounds and the amount of computation of each member. In this paper, a dynamic authenticated group key agreement protocol for mobile networks is presented. It needs at most two rounds to establish or refresh a session key. When membership changes, the session key is refreshed efficiently and securely. By using members' previous values, computation and communication costs are reduced in Join and Leave algorithms. Furthermore, there is no message exchange in Leave algorithm. Its security is proved under Decisional Bilinear Dime-Hellman (DBDH) assumption in standard model and thus provides better security guarantees than previous results in random oracle model.
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.
