Abstract
We consider the problem of group key agreement among n parties communicating over an insecure ad hoc network. Firstly, we analyze the state and the problem of existing group key management schemes, and then present a secure, efficient and contributory group key management scheme, which is based on elliptic curve cryptosystems (ECC). The security of our scheme relies on the hardness of elliptic curve discrete logarithm problem (ECDLP). Compared to existing approaches, our scheme attaches more importance to cost fairness among group members. With this protocol, it takes less computation cost as well as communication cost to construct a secure group key, the low memory cost is also a virtue of our scheme.
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.
