Abstract
The mobile Ad Hoc network is widely used in fields without communication infrastructure. To meet the demand for highly secure and efficient group communication in Ad Hoc network, many contributory group key agreement protocols have been proposed. But most of these proposed protocols focused on security with bilinear pairing calculation, which is a computational-heavy operation. In this paper, a pairing-free certificateless authenticated group key agreement is proposed. By using scalar multiplication of elliptic curves and a binary key tree structure, the proposed protocol reduces computation overhead and meanwhile provides secure services for dynamic groups. The result demonstrates that the protocol is secure, efficient and suitable for Ad Hoc network.
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 callMore From: DEStech Transactions on Computer Science and Engineering
Disclaimer: 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.
