An Efficient Pairing-Free Certificateless Signcryption Without Secure Channel Communication During Secret Key Issuance ☆

Karati, Arijit; Fan, Chun-I; Huang, Jheng-Jia

doi:10.1016/j.procs.2020.04.012

Cited by 9 publications

(25 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rastegari et al [28], and Karati et al [29], as shown in Table 2. The existing schemes utilize exponential operations, pairing, and elliptic curve point multiplication, which are costlier options.…”

Section: Computational Costmentioning

confidence: 92%

“…Additionally, the schemes do not meet securit requirements such as anonymity. Finally, Karati et al [29] implemented a successful pair ing-free certificateless signcryption scheme without a secure channel. The findings show that, in terms of communication overhead, the scheme is better than the relevant existin schemes and could be a better option for the Internet of Things (IoT) following the imple mentation of a proper revocation mechanism.…”

Section: Hyperelliptic Curvementioning

confidence: 99%

“…In this subsection, the proposed approach is compared, in terms of communication cost, with the schemes presented by Zhou [25], Cao and Ge [26], Luo and Ma [27], Rastegari et al [28], and Karati et al [29]. In Table 3, the comparative analysis is provided for communication cost, which is also illustrated in Figure 3.…”

Section: Communication Costmentioning

confidence: 99%

“…Caixue Zhou [25] |m|+ 5| G| 6144 Cao and Ge [26] |m|+ 2|q| 1344 Luo and Ma [27] |m|+ 2|q| 1344 Rastegari et al [28] |m|+ 4| G| 5120 Karati et al [29] |m|+…”

Section: Schemes Communication Cost Total (In Bits)mentioning

confidence: 99%

“…h y hash offers a valid scramble text during q us and its probability as q y/2 σ • O 1 needs ϕ to perform Un-Signcryption Query (q us ) during the attack process, the decryption success probability of ϕ as ω us = ω − q us q y /2 σ • During the guess phase the probability for requirements such as anonymity. Finally, Karati et al [29] implemented a successful pairing-free certificateless signcryption scheme without a secure channel. The findings show that, in terms of communication overhead, the scheme is better than the relevant existing schemes and could be a better option for the Internet of Things (IoT) following the implementation of a proper revocation mechanism.…”

mentioning

confidence: 99%

See 4 more Smart Citations

An Anonymous Certificateless Signcryption Scheme for Secure and Efficient Deployment of Internet of Vehicles

et al. 2021

View full text Add to dashboard Cite

Internet of Vehicles (IoV) is a specialized breed of Vehicular Ad-hoc Networks (VANETs) in which each entity of the system can be connected to the internet. In the provision of potentially vital services, IoV transmits a large amount of confidential data through networks, posing various security and privacy concerns. Moreover, the possibility of cyber-attacks is comparatively higher when data transmission takes place more frequently through various nodes of IoV systems. It is a serious concern for vehicle users, which can sometimes lead to life-threatening situations. The primary security issue in the provision of secure communication services for vehicles is to ensure the credibility of the transmitted message on an open wireless channel. Then, receiver anonymity is another important issue, i.e., only the sender knows the identities of the receivers. To guarantee these security requirements, in this research work, we propose an anonymous certificateless signcryption scheme for IoV on the basis of the Hyperelliptic Curve (HEC). The proposed scheme guarantees formal security analysis under the Random Oracle Model (ROM) for confidentiality, unforgeability, and receiver anonymity. The findings show that the proposed scheme promises better security and reduces the costs of computation and communication.

show abstract

Section: Computational Costmentioning

confidence: 92%

Section: Hyperelliptic Curvementioning

confidence: 99%

Section: Communication Costmentioning

confidence: 99%

“…Caixue Zhou [25] |m|+ 5| G| 6144 Cao and Ge [26] |m|+ 2|q| 1344 Luo and Ma [27] |m|+ 2|q| 1344 Rastegari et al [28] |m|+ 4| G| 5120 Karati et al [29] |m|+…”

Section: Schemes Communication Cost Total (In Bits)mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

An Anonymous Certificateless Signcryption Scheme for Secure and Efficient Deployment of Internet of Vehicles

et al. 2021

View full text Add to dashboard Cite

show abstract

Efficient and anonymous multi‐message and multi‐receiver electronic health records sharing scheme without secure channel based on blockchain

Yang

et al. 2021

Trans Emerging Tel Tech

View full text Add to dashboard Cite

The sharing of electronic health records (EHR) helps the patients increase the accuracy of treatment, while promoting the development of the hospital and the research of medical field compared to traditional paper-based medical records.However, due to the sensitivity of medical data and the difference of the standard about EHR, it is likely to lead to some security problems such as the leakage of patient's privacy and the difficulty of data sharing. To accomplish the secure storage and effective sharing of EHR, we propose an efficient and anonymous multi-message and multi-receiver EHR sharing scheme without secure channel based on blockchain (BEAMMRS). We use blockchain technology and cloud server to store EHR together, which ensures the security and immutability.Moreover, we combine certificateless public key cryptography and elliptic curve cryptography (ECC) to solve the certificate management burden and key escrow problems. Our scheme utilizes multi-message and multi-receiver signcryption algorithm to enable medical data providers to send different messages to multiple data requesters by executing one signcryption operation, which satisfies the multi-message sending requirements of the data providers in the communication environment. Meanwhile, the key generation center (KGC) sends the pseudo partial private key to the data user through the public channel. Only the authorized data user can successfully find out the real partial private key, which avoids the key leakage and economic cost caused by the secure channel. Security analysis and performance evaluation demonstrate that the proposed BEAMMRS scheme meets stronger security and higher computational efficiency than other similar schemes.

show abstract

An Anonymous and Efficient Multimessage and Multireceiver Certificateless Signcryption Scheme for VANET

Zhou,

Xu,

Qiao

et al. 2023

IEEE Internet Things J.

View full text Add to dashboard Cite

An Efficient Pairing-Free Certificateless Signcryption Without Secure Channel Communication During Secret Key Issuance ☆

Cited by 9 publications

References 20 publications

An Anonymous Certificateless Signcryption Scheme for Secure and Efficient Deployment of Internet of Vehicles

An Anonymous Certificateless Signcryption Scheme for Secure and Efficient Deployment of Internet of Vehicles

Efficient and anonymous multi‐message and multi‐receiver electronic health records sharing scheme without secure channel based on blockchain

An Anonymous and Efficient Multimessage and Multireceiver Certificateless Signcryption Scheme for VANET

Contact Info

Product

Resources

About