A subtree-based cryptographic protocol for secure group communication
Ismail BahkaliIbahkali@kau.edu.saDepartment of Information ScienceKing Abdulaziz UniversityJeddah, 21589, Saudi Arabia0000-0002-3603-4259View full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Dec 2025
- Published Online:
- 29 Aug 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2733
- Pages:
- 1–20
Abstract
In the current study we introduce an improved identity-based cryptographic (IBC) scheme that aims at addressing the weaknesses of existing frameworks. In further extension of the approach of Meshram, Meshram, and Zhang [21], who formulated an IBC method based on integer-factorization problems and generalized discrete-logarithm without reference to bilinear pairings, this paper determines and removes the stalemate of their construction. Though the scheme proposed by Meshram, Meshram, and Zhang [21] offers protection of data and adversarial resistance, the confidentiality of the encryption mechanism is still on a condition of secret data available in the key authentication center, which is the resource that cannot be accessed by the end users. To overcome this drawback, we present an enhanced subtree-based cryptographic protocol of secure group communication which uses partial discrete logarithms in finite fields. This plan not only removes the problem of the deadlock but also provides security improvement to the solution of Pang, Li, and Wang [31] whose work was undermined by the lack of full security analysis. The scheme proposed incorporates a strong key-distribution design and is more robust to any attack that might occur and thus enhances the security and trustworthiness of identity-based cryptographic schemes.
Keywords
Subject Classifications
References
[1] Abhishek Das and Asoke Adhikari, “An efficient IND-CCA2 secure Paillier-based cryptosystem,” Information Processing Letters, vol. 112, pp. 885–888 (2012).
[2] Adi Shamir, “Identity-based cryptosystem and signature scheme,” in Advances in Cryptology – Proceedings of CRYPTO’84, Lecture Notes in Computer Science, vol. 196. Berlin, Germany: Springer, pp. 47–53 (1984).
[3] Adi Shamir, “Private communication” (Jun. 1988).
[4] Ben Lynn, “Authenticated ID-based encryption,” Cryptology ePrint Archive, Report 2002/072 (2002).
[5] Brent Waters, “Efficient identity-based encryption without random oracles,” in Advances in Cryptology – CRYPTO 2005, Lecture Notes in Computer Science, vol. 3494. Berlin, Germany: Springer, pp. 114–127 (2005).
[6] Clifford Cocks, “An identity-based encryption scheme based on quadratic residues,” in International Conference on Cryptography and Coding (Proceedings of IMA), Lecture Notes in Computer Science, vol. 2260. Berlin, Germany: Springer, pp. 360–363 (2001).
[7] Craig Gentry and Alice Silverberg, “Hierarchical ID-based cryptography,” in Advances in Cryptology – ASIACRYPT 2002, Lecture Notes in Computer Science, vol. 2501. Berlin, Germany: Springer, pp. 548–566 (2002).
[8] Chandrashekhar Meshram, “An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem,” Information Processing Letters, vol. 115, no. 2, pp. 351–358 (2015).
[9] Chandrashekhar Meshram, Chin-Chen Lee, Chien-Ta Li, and Chin-Laung Chen, “A secure key authentication scheme for cryptosystems based on GDLP and IFP,” Soft Computing, vol. 21, no. 24, pp. 7285–7291 (2017).
[10] Chandrashekhar Meshram, Chin-Chen Lee, Chien-Ta Li, and Sarita G. Meshram, “An efficient online/offline ID-based short signature procedure using extended chaotic maps,” Soft Computing, vol. 23, no. 3, pp. 747–753 (2019).
[11] Chandrashekhar Meshram, Chin-Chen Lee, Sarita G. Meshram, and Mohammad Khurram Khan, “An identity-based encryption technique using subtree for fuzzy user data sharing under cloud computing environment,” Soft Computing, vol. 23, no. 24, pp. 13127–13138 (2019).
[12] Chandrashekhar Meshram, Chin-Chen Lee, Sarita G. Meshram, and Ankur Meshram, “OOS-SSS: An efficient online/offline subtree-based short signature scheme using Chebyshev chaotic maps for wireless sensor networks,” IEEE Access, vol. 8, no. 1, pp. 80063–80073 (2020).
[13] Chandrashekhar Meshram, Chin-Chen Lee, Abhay S. Ranadive, Chien-Ta Li, Sarita G. Meshram, and Jitendra V. Tembhurne, “A subtree-based transformation model for cryptosystem using chaotic maps under cloud computing environment for fuzzy user data sharing,” International Journal of Communication Systems, vol. 33, no. 7, p. e4307 (2020).
[14] Chandrashekhar Meshram, Chin-Chen Lee, Shyam Gupta Meshram, and Chin-Chen Lee, “An IND-IDCPA secure ID-based cryptographic protocol using GDLP and IFP,” Informatica, vol. 28, no. 3, pp. 471–484 (2017).
[15] Chandrashekhar Meshram and Sarita G. Meshram, “An identity-based beta cryptosystem,” in Proc. 7th IEEE Int. Conf. Information Assurance and Security (IAS 2011), pp. 298–303 (2011).
[16] Chandrashekhar Meshram and Sarita G. Meshram, “An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem,” Information Processing Letters, vol. 113, no. 10–11, pp. 375–380 (2013).
[17] Chandrashekhar Meshram and Sarita G. A. Meshram, “Some modification in ID-based cryptosystem using IFP and DDLP,” International Journal of Advanced Computer Science and Applications, vol. 2, no. 8, pp. 25–29 (2011).
[18] Chandrashekhar Meshram, Sarita G. A. Meshram, and Daya Gupta, “An ID-based beta cryptosystem using generalized discrete logarithm problem and integer factorization problem,” Journal of Information Assurance & Security, vol. 7, no. 5, pp. 275–283 (2012).
[19] Chandrashekhar Meshram, Sarita G. A. Meshram, and Chandra Ram, “Constructing identity-based cryptographic scheme for beta cryptosystem,” International Journal of Applied Mathematics, vol. 25, no. 5, pp. 609–624 (2012).
[20] Chandrashekhar Meshram and Sarita G. A. Meshram, “Constructing new an ID-based cryptosystem for IFP and GDLP based cryptosystem,” Journal of Discrete Mathematical Sciences & Cryptography, vol. 20, no. 5, pp. 1121–1134 (2017).
[21] Chandrashekhar Meshram, Sarita G. Meshram, and Min Zhang, “An ID-based cryptographic mechanism based on GDLP and IFP,” Information Processing Letters, vol. 112, no. 19, pp. 753–758 (2012).
[22] Chandrashekhar Meshram, Sarita G. Meshram, and Chin-Chen Lee, “Constructing provably secure ID-based beta cryptographic scheme in random oracle,” International Journal of Network Security, vol. 20, no. 3, pp. 568–574 (2018).
[23] Chandrashekhar Meshram and Mohammad S. Obaidat, “An ID-based quadratic-exponentiation randomized cryptographic scheme,” in Proc. IEEE Int. Conf. Computer, Information, and Telecommunication Systems (CITS 2015), pp. 1–5 (2015).
[24] Chandrashekhar Meshram, Mohammad S. Obaidat, Cheng-Chi Lee and Sarita Gajbhiye Meshram, “An efficient key authentication procedure for IND-CCA2 secure Paillier-based cryptosystem,” Soft Computing, vol. 24, no. 12, pp. 6531–6537 (2020).
[25] Chandrashekhar Meshram, Mohammad S. Obaidat, Bilal Sadoun, and Augustine L. Imoize, “A secure and efficient subtree-based authentication scheme for telemedicine information systems,” in Proc. IEEE Int. Conf. Communications, Computing, Cybersecurity, and Informatics (ICC CI 2025), pp. 127–132 (2025).
[26] Chandrashekhar Meshram, Mohammad S. Obaidat, Bilal Sadoun, Augustine L. Imoize, and Vishesh P. Gaikwad, “A robust subtree-based authentication scheme for TMIS using chaotic hash function,” in Proc. IEEE Int. Conf. Computer, Information, and Telecommunication Systems (CITS 2024), pp. 1–7 (2024).
[27] Dan Boneh and Xavier Boyen, “Efficient selective-ID secure identity-based encryption without random oracles,” in Advances in Cryptology – EUROCRYPT 2004, Lecture Notes in Computer Science, vol. 3027. Berlin, Germany: Springer, pp. 223–238 (2004).
[28] Dan Boneh and Matthew K. Franklin, “Identity-based encryption from the Weil pairing,” SIAM Journal of Computing, vol. 32, no. 3, pp. 586–615 (2003).
[29] Don Coppersmith, “Cryptography,” IBM Journal of Research and Development, vol. 31, no. 2, pp. 244–248 (1987).
[30] Kiyoshi Nakamura, Eiji Okamoto, Koji Tanaka, and Satoshi Miura, “Private communication,” (Aug. 1987).
[31] Liang Pang, Hongwei Li, and Yong Wang, “nMIBAS: A novel multi-receiver ID-based anonymous signcryption with decryption fairness,” Computing and Informatics, vol. 32, no. 3, pp. 441–460 (2013).
[32] Mohamed Ramadan, Yao Liao, Fenghua Li, Shouhuai Zhou, and Hassan Abdalla, “IBEET-RSA: Identity-based encryption with equality test over RSA for wireless body area networks,” Mobile Networks and Applications, vol. 25, pp. 223–233 (2020).
[33] Nusrat Farjana, Sajal Roy, Md. Jahidul N. Mahi, and Mohammad Whaiduzzaman, “An identity-based encryption scheme for data security in fog computing,” in Proc. Int. Joint Conf. Computational Intelligence, pp. 215–226 (2020).
[34] Pascal Paillier, “Public key cryptosystem based on discrete logarithm residues,” in EUROCRYPT 99, Lecture Notes in Computer Science, vol. 1592. Berlin, Germany: Springer, pp. 223–238 (1999).
[35] Shigeo Tsujii and Toshiya Itoh, “An ID-based cryptosystem based on the discrete logarithm problem,” IEEE Journal on Selected Areas in Communications, vol. 7, no. 4, pp. 467–473 (1989).
[36] Taher ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, vol. 31, pp. 469–472 (1995).
[37] Weiran Liu, Jianwei Liu, Qianhong Wu, Bo Qin, David Naccache and Houda Ferradi, “Efficient subtree-based encryption for fuzzy-entity data sharing,” Soft Computing, vol. 22, no. 23, pp. 7961–7976 (2018).
