CGST: Provably Secure Lightweight Certificateless Group Signcryption Technique Based on Fractional Chaotic Maps
Author | Meshram, Chandrashekhar |
Author | Imoize, Agbotiname Lucky |
Author | Jamal, Sajjad Shaukat |
Author | Alharbi, Adel R. |
Author | Meshram, Sarita Gajbhiye |
Author | Hussain, Iqtadar |
Available date | 2022-05-30T05:34:02Z |
Publication Date | 2022-01-01 |
Publication Name | IEEE Access |
Identifier | http://dx.doi.org/10.1109/ACCESS.2022.3165565 |
Citation | C. Meshram, A. L. Imoize, S. S. Jamal, A. R. Alharbi, S. G. Meshram and I. Hussain, "CGST: Provably Secure Lightweight Certificateless Group Signcryption Technique Based on Fractional Chaotic Maps," in IEEE Access, vol. 10, pp. 39853-39863, 2022, doi: 10.1109/ACCESS.2022.3165565. |
Abstract | In recent years, there has been a lot of research interest in analyzing chaotic constructions and their associated cryptographic structures. Compared with the essential combination of encryption and signature, the signcryption scheme has a more realistic solution for achieving message confidentiality and authentication simultaneously. However, the security of a signcryption scheme is questionable when deployed in modern safety-critical systems, especially as billions of sensitive user information is transmitted over open communication channels. In order to address this problem, a lightweight, provably secure certificateless technique that uses Fractional Chaotic Maps (FCM) for group-oriented signcryption (CGST) is proposed. The main feature of the CGST-FCM technique is that any group signcrypter may encrypt data/information with the group manager (GM) and have it sent to the verifier seamlessly. This implies the legitimacy of the signcrypted information/data is verifiable using the public conditions of the group, but they cannot link it to the conforming signcrypter. In this scenario, valid signcrypted information/data cannot be produced by the GM or any signcrypter in that category alone. However, the GM is allowed to reveal the identity of the signcrypter when there is a legal conflict to restrict repudiation of the signature. Generally, the CGST-FCM technique is protected from the indistinguishably chosen ciphertext attack (IND-CCA). Additionally, the computationally difficult Diffie-Hellman (DH) problems have been used to build unlinkability, untraceability, unforgeability, and robustness of the projected CGST-FCM scheme. Finally, the security investigation of the presented CGST-FCM technique shows appreciable consistency and high efficiency when applied in real-time security applications. |
Language | en |
Publisher | Institute of Electrical and Electronics Engineers |
Subject | authentication Certificateless group signcryption scheme (CGSS) Diffie-Hellman (DH) problem fractional chaotic maps (FCM) provably secure scheme wireless security networks |
Type | Article |
Pagination | 39853-39863 |
Volume Number | 10 |
ESSN | 2169-3536 |
Files in this item
This item appears in the following Collection(s)
-
Mathematics, Statistics & Physics [726 items ]