Efficient Conditional Privacy-preserving Authentication Scheme Research Articles

Efficient Conditional Privacy-Preserving Authentication Scheme for Safety Warning System in Edge-Assisted Internet of Things

With the advent of smart cities, the significance of the Internet of Things (IoT) is gaining greater prominence. At the same time, the safety early warning system in the IoT has a significant impact on real-time monitoring and the response to potential risks. Despite the advancements made in edge-assisted IoT deployments, several challenges and constraints persist. Given the potential threat to life posed by safety-related messages, ensuring the authenticity of messages in the edge-assisted IoT safety warning system is crucial. However, considering the identity privacy of devices participating in the edge-assisted Internet of Things system, directly verifying the identity of the sending device is undesirable. To address this issue, in this work, we design a linkable group signature scheme that allows devices to anonymously send safety-related messages to edge nodes, defending against Sybil attacks while ensuring the traceability of malicious device identities. Then, we present a high-efficiency conditional privacy-preserving authentication (CPPA) scheme based on the designed group signatures for the safety warning system in edge-assisted IoT. This scheme effectively protects device identity privacy while providing a reliable authentication mechanism to ensure the credibility and traceability of alert messages. The proposed scheme contributes to the field of safety warning systems in the context of edge-assisted IoT, providing a robust solution for privacy preservation and authentication.

An efficient conditional privacy-preserving authentication scheme with scalable revocation for VANETs

In Vehicular Ad Hoc Networks (VANETs), secure information sharing between vehicles is critical for improving traffic efficiency and driving safety. However, existing identity-based communication protocols for VANETs face problems of over-reliance on ideal Tamper-Proof Devices (TPDs) and the efficiency of verifying multiple messages in areas of high traffic density. Besides, many existing authentication schemes suffer from the heavy workload of revoking malicious vehicles when they misbehave. For addressing these problems, we propose an efficient Identity-Based conditional privacy-preserving authentication protocol, which does not rely on the ideal TPD. In our scheme, the System Secret Key (SSK) is not directly preloaded with the TPD, thus avoiding a system crash when a vehicle is corrupted. To revoke malicious vehicles’ identity, we propose an efficient key updating method based on Shamir’s secret sharing algorithm, which improves key-update efficiency from linear to logarithmic in the number of unrevoked vehicles. Moreover, our scheme is based on Elliptic Curves Cryptosystem and avoids bilinear pairing operation while supporting batch verification, enabling faster verification even when the number of signatures is increasing. According to the results of exhaustive comparative analysis, our proposed scheme is secure against key leakage attack and efficient in overhead of computation and communication compared to related schemes.

SE-CPPA: A Secure and Efficient Conditional Privacy-Preserving Authentication Scheme in Vehicular Ad-Hoc Networks.

Communications between nodes in Vehicular Ad-Hoc Networks (VANETs) are inherently vulnerable to security attacks, which may mean disruption to the system. Therefore, the security and privacy issues in VANETs are entitled to be the most important. To address these issues, the existing Conditional Privacy-Preserving Authentication (CPPA) schemes based on either public key infrastructure, group signature, or identity have been proposed. However, an attacker could impersonate an authenticated node in these schemes for broadcasting fake messages. Besides, none of these schemes have satisfactorily addressed the performance efficiency related to signing and verifying safety traffic-related messages. For resisting impersonation attacks and achieving better performance efficiency, a Secure and Efficient Conditional Privacy-Preserving Authentication (SE-CPPA) scheme is proposed in this paper. The proposed SE-CPPA scheme is based on the cryptographic hash function and bilinear pair cryptography for the signing and verifying of messages. Through security analysis and comparison, the proposed SE-CPPA scheme can accomplish security goals in terms of formal and informal analysis. More precisely, to resist impersonation attacks, the true identity of the vehicle stored in the tamper-proof device (TPD) is frequently updated, having a short period of validity. Since the MapToPoint hash function and a large number of cryptography operations are not employed, simulation results show that the proposed SE-CPPA scheme outperforms the existing schemes in terms of computation and communication costs. Finally, the proposed SE-CPPA scheme reduces the computation costs of signing the message and verifying the message by 99.95% and 35.93%, respectively. Meanwhile, the proposed SE-CPPA scheme reduces the communication costs of the message size by 27.3%.

An Efficient Conditional Privacy-Preserving Authentication Scheme for the Prevention of Side-Channel Attacks in Vehicular Ad Hoc Networks

Several group signature or identity schemes have been proposed for addressing the issues of security in a vehicular ad hoc network (VANET). Nonetheless, none of these schemes suitably cope with the performance efficient during the signing and verifying safety-messages. Furthermore, adversaries could acquire sensitive data stored in a tamper-proof device (TPD) by utilizing side-channel attacks. An efficient conditional privacy-preserving authentication scheme is proposed for the prevention of side-channel attacks and reducing the performance efficiency of the system in this paper. Moreover, to resist side-channel attacks, critical data stored in the TPD is frequently and periodically updated. Lastly, due to our work employs the one-way hash function and the elliptic curve cryptography, its performance evaluation has lower computation and communication cost compared to other schemes.

An efficient CPPA scheme for intelligent transportation networks

To defend intelligent transportation networks’ security and privacy, existing standards employ the Public Key Infrastructure (PKI) authentication framework. However, the high associated PKI computation and communication overheads break ground for utilizing an alternative candidate, the Identity-based Cryptographic (IBC) authentication. Most of the underlined calculations of the IBC approaches rely on the elliptic curves’ pairing operation. Since the pairing function is a complex and computation intensive operation, several studies have developed pairingless IBC authentications and applied the hardware security of tamper-proof devices to secure the cryptographic parameters at user-end. Motivated by this trend, we compose a Pairingless Modified Efficient Conditional Privacy-Preserving Authentication Scheme (PME-CPPAS). Our scheme omits the utilization of the complex pairing operation as well as the demand for expensive tamper-proof devices. When analyzing the performance of the presented design, its effectiveness, in comparison to the available pairing-based and pairingless approaches, is proved in terms of computation complexity, communication overhead, and storage overhead. PME-CPPAS achieves less signing computational cost and comparable verification computational performance.

NECPPA: A novel and efficient conditional privacy-preserving authentication scheme for VANET

Vehicular Ad-hoc Networks (VANETs) are growing in recent decades providing real-time communication between vehicles for a safer and more comfortable driving. The main idea of VANET is the fact that vehicles can broadcast ad-hoc messages such as traffic incidents and emergency events. The security of such networks is quite critical. This paper firstly reviews and analyzes the main authentication schemes in VANET to compare their pros and cons. We then propose a new authentication scheme which provides secure communications in VANET. Our proposed scheme is a combination of Road Side Unit Based (RSUB) and Tamper Proof Device Based (TPDB) schemes. A novel idea in NECPPA is to let the keys and the main parameters of the system be stored in the Tamper Proof Device (TPD) of Road Side Units (RSUs). Since, there is always a secure and fast communicational link between TA and RSU, inserting TPD in RSUs is much more efficient than inserting them in OBUs. It also should be noted that due to the fact that in NECPPA scheme, the main key of TA (master secret key) is not stored in all OBUs, the compromise or hacking a single OBU does not threaten the whole network despite what happens in TPDB scheme which makes the whole vehicles re-register and change their secret keys. In addition, our proposed scheme is much more cost efficient compare to other on-line RSUB schemes, as it does not need the establishment of on-line RSUs in the whole roads. We also prove the security of our scheme with formal proof and ProVerif automatic analysis tool. The simulation results show that the efficiency and performance of our proposed scheme in VANETs have improved compare to other schemes.

ECPB: Efficient Conditional Privacy-Preserving Authentication Scheme Supporting Batch Verification for VANETs

In this paper, we introduce an efficient Conditional Privacy-Preserving authentication scheme (ECPB) based on group signature for vehicular ad hoc networks (VANETs). Although group signature is widely used in VANETs for security requirements, the existing schemes based on group signatures suffer longer computational delays in the certificate revocation list (CRL) checking and in the signature verification process, leading to lower verification efficiency. In our scheme, membership validity (a validity period) is required when a vehicle applies for a group member and this validity is used to check whether the vehicle is still a group member or not, which can be used as a substitute for the CRL checks. Neglecting the CRL checks will sharply decrease the costs incurred in the signatures verification. In addition, our proposed scheme also supports batch verification. Experimental analysis proves that our proposed scheme exhibit improved efficiency over the existing schemes, in terms of verification delay and average delay.