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 analysing 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 such schemes is questionable when deployed in modern safety-critical systems, especially as billions of sensitive user information is transmitted over open communication channels. To address this limitation, a lightweight, provably secure certificateless technique that uses Fractional Chaotic Maps (FCM) for group-oriented signcryption (CGST) is presented. 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. They can verify the legitimacy of the signcrypted information/data 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. The GM is allowed to reveal the identity of the signcrypter when there is a legal conflict to restrict repudiation of the signature. The CGST-FCM technique is found to be protected from the indistinguishably chosen ciphertext attack (IND-CCA). The computationally difficult problem has been used to build unlinkability, traceability, robust security, and unforgeability. The security investigation of the presented CGST-FCM technique shows commendable consistency and very high efficiency when used in real-time security applications.

Bernstein Vazirani deep neural perceptron based certificateless signcryption for secured data communication in cloud

“…In this section, the efficiency of proposed BVDNP-CSmethod is analyzed withthe above-said metrics using the table and graphical representation. The comparison ismade with the BVDNP-CSmethod and existing methods namely, CGST-FCM [1] and HBRSS [2].…”

“…The dataset istaken from Personal Cloud Datasets: NEC Personal Cloud Trace (http://cloudspaces.eu/results/datasets). Experimental evaluation of proposed DMPPALCS technique and two existing algorithmsnamely Fractional Chaotic Maps (FCM) for Group-oriented Signcryption (CGST) CGST-FCM [1], Homomorphic Block Ring Security System -HBRSS [2] are simulatedusing the different metrics such as execution time, overhead and data confidentiality.…”

“…The execution time was found to be '3.75 ms' using the BVDNP-CS'5.5 ms' using CGST-FCM [1] and '7.5 ms' using HBRSS [2] respectively.The execution time involved in ensuring secure data communication between cloud users was found to belesser using BVDNP-CSmethod when compared to [1] and [2]. Figure 5 inferred that the overhead of the BVDNP-CSmethod is found to be minimized than the existing methods.…”

“…Finally, table 3 given below illustrates the experimental results of data confidentialityrate for 250 different cloud user data. A comparison of the BVDNP-CSmethod is madewith the two existing methods, namely, CGST-FCM [1] and HBRSS [2] respectively. The results confirm that the BVDNP-CSmethod achieves better performancein terms of good data confidentiality rate than the traditional methods.…”

“…A lightweight, provably securecertifcateless model that utilizes Fractional Chaotic Maps (FCM) for Group-oriented Signcryption (CGST) called, CGST-FCM was proposed in [1]. The main characteristic of the CGST-FCM method was any group signcrypter may encrypt the data via the Group Manager (GM) and have to send it to the verifier in a seamless manner.…”