Abstract
In distributed ad hoc sensor networks, scalable group key agreement protocol plays an important role. They are designed to provide a group of users with a shared secret key such that the users can securely communicate with each other over a public network. In most of previous group key agreement protocols, the number of messages sent by all users increases with the number of all participants. In this paper, a dynamic authenticated group key agreement protocol is presented using pairing for ad hoc networks. In $Join$ algorithm, the number of transmitted messages does not increase with the number of all group members, which makes the protocol more practical. The protocol is provably secure. Its security is proved under Decisional Bilinear Diffie-Hellman assumption. The protocol also provides many other security attributes.
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.
