Title | ||
---|---|---|
CGST: Provably Secure Lightweight Certificateless Group Signcryption Technique Based on Fractional Chaotic Maps |
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. |
Year | DOI | Venue |
---|---|---|
2022 | 10.1109/ACCESS.2022.3165565 | IEEE ACCESS |
Keywords | DocType | Volume |
Security, Chebyshev approximation, Chaotic communication, Fractals, Encryption, Licenses, Authentication, Certificateless group signcryption scheme (CGSS), fractional chaotic maps (FCM), provably secure scheme, authentication, Diffie-Hellman (DH) problem, wireless security networks | Journal | 10 |
ISSN | Citations | PageRank |
2169-3536 | 0 | 0.34 |
References | Authors | |
0 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Chandrashekhar Meshram | 1 | 13 | 4.56 |
Agbotiname Lucky Imoize | 2 | 0 | 1.69 |
Sajjad Shaukat Jamal | 3 | 13 | 7.30 |
Adel R. Alharbi | 4 | 0 | 1.69 |
Sarita Gajbhiye Meshram | 5 | 0 | 0.34 |
Iqtadar Hussain | 6 | 3 | 6.46 |