Efficient Certificateless Multi-Signcryption Scheme for Secure Group Communications

Swapna, Gurram; Gayathri, N.B.; Thumbur, Gowri; Nageswara Rao, T. Siva

doi:10.22042/isecure.2026.518405.1223

Efficient Certificateless Multi-Signcryption Scheme for Secure Group Communications

Document Type : Research Article

Authors

Gurram Swapna ¹

N.B. Gayathri ²

Gowri Thumbur ³

T. Siva Nageswara Rao ¹

¹ Department of Mathematics, Vallorapalli Nageswara Rao Vignana Jyothi Institute of Engineering and Technology, Hyderabad, India

² Department of Mathematics and Computer Science, Sri Sathya Sai Institute of Higher Learning, Anantapur, India

³ Department of Electronics and Communication Engineering, Gitam University, Andhra Pradesh, India

10.22042/isecure.2026.518405.1223

Abstract

Confidentiality, unforgeability, and public verifiability are essential for secure multi-party communications. These communications play a vital role in real-world applications such as decentralized financial transactions, e-commerce, cloud computing, and web services, where authentication and privacy preservation are very important. In conventional cryptosystems, individual signcryption performed by each participant significantly increases the unsigncryption cost for the receiver. Multi-signcryption offers an efficient alternative by allowing multiple signers to jointly signcrypt a single message. This paper proposes a novel certificateless multi-signcryption scheme that eliminates the certificate management problem of traditional public key infrastructures and avoids the key escrow problem of identity-based cryptography. To reduce the computational cost associated with bilinear pairings over elliptic curves, the proposed scheme is designed in a pairing-free environment. This scheme achieves constant-time verification in the unsigncryption phase and is independent of the number of signers. Security is formally proven under the hardness assumptions of the Elliptic Curve Computational Diffie–Hellman Problem (ECCDHP) and the Elliptic Curve Discrete Logarithm Problem (ECDLP). The proposed scheme ensures confidentiality, unforgeability, and public verifiability, and it attains significantly lower computational costs than existing schemes. Hence, the proposed scheme can be used for secure group communications in resource-constrained environments where high performance is essential.

Keywords

Multi-Signcryption

Certificateless Signcryption

Public Verifiability

Elliptic Curve

ECCDHP

ECDLP

[1] Yuliang Zheng. Digital signcryption or how to achieve cost(signature + encryption) ¡ cost(signature) + cost(encryption). In Advances in Cryptology - CRYPTO ’97, pages 165–179. Springer, Berlin, Heidelberg, 1997.

[2] Joonsang Baek, Jan Newmarch, Reihaneh SafaviNaini, and Willy Susilo. A survey of identitybased cryptography. In In Proc. of the 10th Annual Conference for Australian Unix User Group, pages 95–102, 2004.

[3] Adi Shamir. Identity-based cryptosystems and signature schemes. In Advances in Cryptology: Proceedings of CRYPTO 84, pages 47–53. Springer, Berlin, Heidelberg, 1985.

[4] Chandana Gamage, Yuliang Zheng, and Jussipekka Leiwo. An efficient scheme for secure mesasage transmission using proxy-signcryption. In In Proc. 22nd Australasian Computer Science Conference (ACSC), pages 420–431, Auckland, New Zealand, 1999.

[5] Fagen Li, Yong Yu, Xudong Luo, and Feng Huang. A survey of identity-based signcryption. IETE Technical Review, 28(3):265–272, 2011.

[6] John Malone-Lee. Identity-based signcryption. Cryptology ePrint Archive, Report 2002/098, 2002.

[7] Padmalaya Nayak, P. Vasudeva Reddy, and G Swapna. Security issues in iot applications using certificateless aggregate signcryption schemes: An overview. Internet of Things, 21:100641, 2023.

[8] Jianhong Zhang, Yixian Yang, and Xinxin Niu. A novel identity-based multi-signcryption scheme. Computer communications, 32(1):14–18, 2009.

[9] S. S. D Selvi, G. P. Sarathy, and S. Sarath Kumar. Breaking and fixing of an identity-based multi-signcryption scheme. In Provable Security: Second International Conference, ProvSec 2008, Guiyang, China, October 15-17, 2008. Proceedings, pages 61–75. Springer, Berlin, Heidelberg, 2009.

[10] G. Swapna and P. Vasudeva Reddy. Efficient identity based multi-signcryption scheme with public verifiability. Journal of Discrete Mathematical Sciences and Cryptography, 17(2):181– 190, 2014.

[11] Yu Zhou, Zeng Li, Feng Hu, and Fagen Li. Identity-based combined public key schemes for signature, encryption, and signcryption. In P Chandra, D Giri, F Li, S Kar, and D Jana, editors, Information Technology and Applied Mathematics, Advances in Intelligent Systems and Computing, volume 699, pages 1–10. Springer, Singapore, 2019.

[12] SSD Selvi, SS Vivek, J Shriram, S Kalaivani, and CP Rangan. Identity based aggregate signcryption schemes. In B Roy and N Sendrier, editors, Progress in Cryptology – INDOCRYPT 2009, LNCS, volume 5922, pages 378–397. Springer, Berlin, Heidelberg, 2009.

[13] Y Sun, Cong Xu, Fagen Li, and Yong Yu. Identity based multi-proxy multi-signcryption scheme for electronic commerce. In Proc. of the 2009 Fifth International Conference on Information Assurance and Security, pages 281–284, Xi’an, China, 2009.

[14] Shruti Khullar, V Richhariya, and Vandana Richhariya. An efficient identity based multi-receiver signcryption scheme using ecc. International Journal of Advancements in Research & Technology, 2(4):189–194, Apr 2013.

[15] Z H Qi, H C Yang, and H Huang. An efficient identity-based multi-signcryption scheme. In Proc. of the International Conference on Computer Information Systems and Industrial Applications, pages 308–310. Atlantis Press, 2015.

[16] Sunil Tanwar and Ashwani Kumar. Extended identity based multi-signcryption scheme with public verifiability. Journal of Information and Optimization Sciences, 39(2):503–517, 2018.

[17] Yu Zhao, Yan Wang, Yixi Liang, Haiyang Yu, and Yang Ren. Identity-based broadcast signcryption scheme for vehicular platoon communication. IEEE Transactions on Industrial Informatics, 19(6):7814–7824, Jun 2023.

[18] T Singh, R Ali, and Varsha Tyagi. An efficient identity based multi-proxy multi-signcryption scheme for electronic commerce using bilinear pairing. Procedia Computer Science, 259:1592– 1601, 2025.

[19] Samad S Al-Riyami and Kenneth G Paterson. Certificateless public key cryptography. In Proc. Adv. Cryptol. (ASIACRYPT), volume 2894, pages 452–473, 2003.

[20] Ya Ding. Certificateless multi-signcryption scheme without pairing. Applied Mechanics and Materials, 599-601:1435–1438, 2014.

[21] Xiangdong Wu, Min Zhang, and Shengjie Zhu. Certificateless multi-signcryption scheme in standard model. International Journal of Grid and Utility Computing, 9(2):120–127, 2018.

[22] G Swapna, G Naga Malleswari, Gowri Thumbur, and T Kusuma. Efficient certificateless multisigncryption scheme using elliptic curves. Journal of Computational Analysis and Applications (JoCAAA), 33(08):2207–2216, 2024.

[23] W Long, Li Deng, Junjie Zeng, Yang Gao, and Tingyi Lu. An efficient certificateless anonymous signcryption scheme for wban. Sensors, 24(15):4899, 2024.

[24] Gang Xu, X Yin, and Xiang Li. Lightweight and secure multi-message multi-receiver certificateless signcryption scheme for the internet of vehicles. 2024.

[25] Neal Koblitz, Alfred J Koblitz, and Alfred J Menezes. Elliptic curve cryptography: The serpentine course of a paradigm shift. Journal of Number Theory, 131(5):781–814, 2011.

[26] G. Swapna, K.A. Ajmath, and Gowri Thumbur. An efficient pairing-free certificateless signcryption scheme with public verifiability. Journal of Mathematical and Computer Science, 11:24–43, 2021.

[27] Kun Ren, Wenjing Zhang, Feng Zhang, Ting He, Chan Kim, and Kiseok Lee. On broadcast authentication in wireless sensor networks. IEEE Transactions on Wireless Communications, 6(11):4136–4144, 2007.

[28] Xi Cao and Zhen-Guo Cao. A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges. Information Sciences, 180(15):2895–2903, 2010.

[29] Song-Yong Tan, Meng-Chow Lim, and MingTheng Chia. Java implementation for pairingbased cryptosystems. In Computational Science and Its Applications – ICCSA 2010: 10th International Conference, Fukuoka, Japan, March 2326, 2010. Proceedings, Part IV, volume 6016 of Lecture Notes in Computer Science, pages 188– 198. Springer, Berlin, Heidelberg, 2010.