Secure group key agreement protocol with elliptic curve secret sharing for authentication in distributed environments

Sairise, Raju M.; Limkar, Suresh; Deokate, Sarika T.; Shirkande, Shrinivas T.; Mahajan, Rupali Atul; Kumar, Anil

doi:10.47974/JDMSC-1825

Open Access Research Article

Secure group key agreement protocol with elliptic curve secret sharing for authentication in distributed environments

Raju M. Sairisersairise566@gmail.comYadavrao Tasgaonkar College of Engineering and Management KarjatDepartment of Electronics and Telecommunication Yadavrao Tasgaonkar College of Engineering & ManagementBardi, Maharashtra, IndiaView full profile → , ^*Suresh LimkarCorresponding authorsureshlimkar@gmail.comDepartment of Artificial Intelligence & Data Science AISSMS Institute of Information TechnologyPune, Maharashtra, IndiaView full profile → , Sarika T. Deokatesarikajaankar2017@gmail.comPimpri Chinchwad College of Engineering NigdiDepartment of Computer Engineering Pimpri Chinchwad College of Engineering NigdiPune, Maharashtra, IndiaView full profile → , Shrinivas T. Shirkandeshri.shirkande8@gmail.comDepartment of Computer and Incharge Principal S. B. Patil College of Engineering IndapurDepartment of Computer Engineering S. B. Patil College of Engineering IndapurPune, Maharashtra, 413106, IndiaView full profile → , Rupali Atul Mahajanrupali.mahajan@viit.ac.inDepartment of Computer Engineering Vishwakarma Institute of Information Technology PuneDepartment of CSE (Data Science Department) Vishwakarma Institute of Information TechnologyPune, Maharashtra, IndiaView full profile → , Anil Kumaranilkumar@poornima.orgDepartment of Artificial Intelligence & Data Science Poornima Institute of Engineering & TechnologyDepartment of Computer Engineering Poornima Institute of Engineering & TechnologyJaipur, Rajasthan, 302022, IndiaView full profile →

* Corresponding author · click or hover a name for details

pp. 1569–1583Vol. 26Issue 5August 2023DOI: 10.47974/JDMSC-1825 Crossmark XML

Published Online:: 09 Sep 2023
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-1825
Pages:: 1569–1583

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.

Keywords

Key agreement protocol Elliptic curve Authentication Security Cryptography

Subject Classifications

Primary 68T07 Secondary 68M25

References

[1] J.-M. Bohli, “A framework for robust group key agreement,” in Proc. Int. Conf. Comput. Sci. Appl. (ICCSA), in Lecture Notes in Computer Science, vol. 3982, pp. 355–364 (2006).
[2] E. Bresson, O. Chevassut, and D. Pointcheval, “Provably-secure authenticated group Diffie–Hellman key exchange,” ACM Trans. Inf. Syst. Secur., vol. 10, no. 3, pp. 255–264 (2007).
[3] J. Katz and M. Yung, “Scalable protocols for authenticated group key exchange,” J. Cryptol., vol. 20, no. 1, pp. 85–113 (Jan. 2007).
[4] T. Brecher, E. Bresson, and M. Manulis, “Fully robust tree-Diffie–Hellman group key exchange,” in Proc. 8th Int. Conf. Cryptol. Netw. Secur. (CANS), in Lecture Notes in Computer Science, vol. 5888, pp. 478–497 (2009).
[5] S. Jarecki, J. Kim, and G. Tsudik, “Flexible robust group key agreement,” IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 5, pp. 879–886 (May 2011).
[6] A. Joux, “A one round protocol for tripartite Diffie–Hellman,” in Proc. ANTS, in Lecture Notes in Computer Science, vol. 1838, pp. 385–394 (2000).
[7] Anil Kumar & Sandeep Kumar Sharma. Information cryptography using cellular automata and digital image processing, Journal of Discrete Mathematical Sciences and Cryptography, 25:4, 1105-1111 (2022), DOI: 10.1080/09720529.2022.2072437.
[8] Sapkal, Vinod, Gupta, Praveen & Khan, Aboo Bakar. Deep learning based phishing website identification system using CNN-LSTM classifier, Journal of Information and Optimization Sciences, 44:3, 315–330 (2023), DOI: 10.47974/JIOS-1343
[9] S. Ajani and M. Wanjari, “An Efficient Approach for Clustering Uncertain Data Mining Based on Hash Indexing and Voronoi Clustering,” 2013 5th International Conference and Computational Intelligence and Communication Networks, pp. 486-490 (2013), doi: 10.1109/CICN.2013.106.
[10] K.-A. Shim, “A round-optimal three-party ID-based authenticated key agreement protocol,” Inf. Sci., vol. 186, no. 1, pp. 239–248 (Mar. 2012).
[11] Khetani, V. ., Gandhi, Y. ., Bhattacharya, S., Ajani, S. N. ., & Limkar, S. Cross-Domain Analysis of ML and DL: Evaluating their Impact in Diverse Domains. International Journal of Intelligent Systems and Applications in Engineering, 11(7s), 253–262 (2023). Retrieved from https://ijisae.org/index.php/IJISAE/article/view/2951.
[12] X. Gu, Y. Zhao, and J. Yang, “Reducing rekeying time using an integrated group key agreement scheme,” J. Commun. Netw., vol. 14, no. 4, pp. 418–428 (Aug. 2012).
[13] D. Liu, D. Huang, P. Luo, and Y. Dai, “New schemes for sharing points on an elliptic curve,” Comput. Math. Appl., vol. 56, no. 6, pp. 1556–1561 (Sep. 2008).
[14] V. P. Binu and A. Sreekumar, “Threshold multi secret sharing using elliptic curve and pairing,” (Mar. 2016), arXiv:1603.09524.
[15] Y. Liu, Q. Sun, Y. Wang, L. Zhu, and W. Ji, “Efficient group authentication in RFID using secret sharing scheme,” Cluster Comput., vol. 22, no. S4, pp. 8605–8611 (Jul. 2019).

Views: 363Downloads: 5Citations: 11