Abstract
Group key establishment is one of the basic building blocks in securing group communication. In this paper, motivated by Desmedt's BD-II protocol, we propose a secure ID-Based group key establishment protocol which has a constant number of rounds and requires only computation and communication. Our scheme achieves key negotiate by scalar multiplication other than using pairing computation which requires expensive computation cost. Moreover, we have adapted aggregate signature technique verifying the validity of transcripts simultaneously, which greatly improves the computational efficiency. We have proved the security of protocol under the intractability of DDH problem in the RO model.
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.
