Abstract
Secure communication is crucial in today’s increasingly interconnected world, especially in distributed contexts where several parties must cooperate while maintaining confidentiality and authenticity. In order to overcome these difficulties, this work introduces a novel Secure Group Key Agreement Protocol (SGKAP) strengthened with Elliptic Curve Secret Sharing (ECSS).The proposed SGKAP uses the strength of elliptic curve cryptography to provide a shared secret key across participants, assuring data transmission confidentiality. Contrary to conventional methods, SGKAP integrates ECSS as a second layer of security to verify participant identity, thus boosting the protocol’s resistance to malevolent adversaries.To create a shared group key, members exchange their elliptic curve public keys at the start of the protocol. During this stage, ECSS is used, and participants create distinctive authentication tokens using their personal secrets. Participants exchange and verify these tokens among themselves, ensuring that only those with the proper permissions have access to the group key.In addition to guaranteeing data confidentiality, SGKAP also verifies the group members’ participation. Furthermore, by mandating secret-sharing-based authentication, ECSS strengthens the protocol’s resistance to insider attacks.We carried out a comprehensive set of simulations and experiments in various distributed contexts to assess the performance and security of SGKAP with ECSS.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Discrete Mathematical Sciences and Cryptography
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.