An efficient certificateless group signcryption scheme using Quantum Chebyshev Chaotic Maps in HC-IoT environments

Authors : Chandrashekhar Meshram, Rabha W. Ibrahim, Preecha Yupapin, Ismail Bahkali, Agbotiname Lucky Imoize & Sarita Gajbhiye Meshram

Abstract :

Signcryption is a highly efficient approach to simultaneously achieving message confidentiality and authentication in Human-Centered IoT (HC-IoT) systems. HCIoT is a new field of study that links various aspects of life such as smart cards, business, e-commerce, healthcare, and sensitive private data. A number of intelligent systems favor human intervention to start automated tasks. A number of smart devices have a social effect in that they should be capable of changing their functional model based on the behavior of different humans. It has boosted the development of information exchange over the IoT and enabled networks. It encompasses cellular, vehicular, and human healthcare by utilizing middleware. Currently, group signcryption schemes are gaining widespread popularity in HC-IoT environments. HC-IoT is useful in electronic cash systems, lightweight devices, multi-server networks, and more. However, most signcryption schemes use bilinear pairing that is computationally intensive, and there is a need for more efficient signcryption schemes. In order to solve this issue, this paper introduces an efficient Certificateless Group-oriented Signcryption (CGS) scheme using Quantum Chebyshev Chaotic Maps (QCCM) without employing bilinear pairing. The proposed QCCM-CGS scheme’s standout feature is that any group signcrypter can signcrypt a text/information with the group manager (GM) and then present it to the verifier for verification. By using the public conditions of the group, the verifier approves the validity of the signcrypted text and cannot connect the signcrypted text to the conforming signcrypter. However, a legitimate signcrypted text cannot be generated even by the GM or any signcrypter of that group unaccompanied. In situations where there is a legal disagreement, such as non-repudiation of the signature, the GM can reveal the identity of the signcrypter. The presented scheme is adequately secured from the indistinguishably chosen ciphertext attack. The computationally challenging problem, QCCM, is used as the foundation for the construction of traceability, unforgeability, unlinkability, and security. Lastly, the security review of the projected scheme clearly shows significant consistency, and it can be easily deployed in vulnerable security applications.