Certificateless Aggregate Signature Research Articles

Correction to: Certificate-less Aggregate Signature Authentication Scheme (CLASAS) for secure and efficient data transmission in Wireless Sensor Networks (WSNs)

Correction to: Certificate-less Aggregate Signature Authentication Scheme (CLASAS) for secure and efficient data transmission in Wireless Sensor Networks (WSNs)

On The Security Of A Novel Construction Of Certificateless Aggregate Signature Scheme For Healthcare Wireless Medical Sensor Networks

On The Security Of A Novel Construction Of Certificateless Aggregate Signature Scheme For Healthcare Wireless Medical Sensor Networks

Certificate-less Aggregate Signature Authentication Scheme (CLASAS) for secure and efficient data transmission in Wireless Sensor Networks (WSNs)

Certificate-less Aggregate Signature Authentication Scheme (CLASAS) for secure and efficient data transmission in Wireless Sensor Networks (WSNs)

IPCAS: An improved conditional privacy-preserving certificateless aggregate signature scheme without bilinear pairing for VANETs

Recently, Gong et al. proposed a Certificateless Aggregate Signature (CLAS) scheme (shorted by PCAS) with conditional privacy-preserving without bilinear pairing for Vehicular Ad-hoc Networks (VANETs). Unfortunately, after analyzing security, the PCAS scheme fails to satisfy the necessary unlinkability in VANETs and is vulnerable to the public key replacement forgery attack of the Type-I adversary. Subsequently, this article analyzes the causes of these two security issues in detail and proposes an improved CLAS scheme for VANETs (called IPCAS). Through security analysis, this article proves that the IPCAS is existentially unforgeable under the adaptive chosen message attacks against Type-I and Type-II adversaries in the random oracle model, and satisfies the necessary security and privacy requirements in VANETs, including unlinkability. Finally, the performance analysis results show that compared to PCAS for single message and n aggregate messages (n=1000), the computational overhead of IPCAS is reduced by 20.01% and 49.08% respectively, and the communication overhead is reduced by 18.75% and 28.14% respectively. Therefore, IPCAS not only makes up for the security vulnerabilities of PCAS but also has better performance.

A quantum-secure certificateless aggregate signature protocol for vehicular ad hoc networks

Vehicular ad hoc networks (VANETs) have revolutionized communication between vehicles and infrastructure, notably enhancing traffic management and passenger safety. However, VANETs are vulnerable to security threats, especially regarding data authenticity. Aggregate signature is a powerful technique that reduces computational and communication burdens by aggregating multiple signatures from different signers into a single signature. Traditional aggregate signature schemes, based on large prime number decomposition and the discrete logarithm problem, cannot effectively resist quantum attacks. This paper introduces a novel quantum secure certificateless aggregate signature (QSCLAS) scheme designed to enhance data security and privacy in VANETs. Our proposed scheme employs the number theory research unit (NTRU) algorithm. As a lattice-based cryptographic algorithm, NTRU is renowned for its security against quantum computer attacks, making it an essential component of our quantum-secure solution. By eliminating the need for expensive bilinear pairing operations, our proposed scheme achieves high efficiency and practicality in resource-limited VANETs environments. The security analysis demonstrates our scheme's resilience against both Type-I and Type-II adversaries in the random oracle model under the small integer solution (SIS) problem on the NTRU lattice. Furthermore, compared with existing approaches, the results illustrate that our proposed scheme offers significant advantages in signature generation and verification cost, as well as lower transmission overhead than other lattice-based schemes, thereby making it highly suitable for VANETs environments.

A Blockchain-Assisted Security Protocol for Group Handover of MTC Devices in 5G Wireless Networks.

In the realm of the fifth-generation (5G) wireless cellular networks, renowned for their dense connectivity, there lies a substantial facilitation of a myriad of Internet of Things (IoT) applications, which can be supported by the massive machine-type communication (MTC) technique, a fundamental communication framework. In some scenarios, a large number of machine-type communication devices (MTCD) may simultaneously enter the communication coverage of a target base station. However, the current handover mechanism specified by the 3rd Generation Partnership Project (3GPP) Release 16 incurs high signaling overhead within the access and core networks, which may have negative impacts on network efficiency. Additionally, other existing solutions are vulnerable to malicious attacks such as Denial of Service (DoS), Distributed Denial of Service (DDoS) attacks, and the failure of Key Forward Secrecy (KFS). To address this challenge, this paper proposes an efficient and secure handover authentication protocol for a group of MTCDs supported by blockchain technology. This protocol leverages the decentralized nature of blockchain technology and combines it with certificateless aggregate signatures to mutually authenticate the identity of a base station and a group of MTCDs. This approach can reduce signaling overhead and avoid key escrow while significantly lowering the risk associated with single points of failure. Additionally, the protocol protects device anonymity by encrypting device identities with temporary anonymous identity markers with the Elliptic Curve Diffie-Hellman (ECDH) to abandon serial numbers to prevent linkage attacks. The resilience of the proposed protocol against predominant malicious attacks has been rigorously validated through the application of the BAN logic and Scyther tool, underscoring its robust security attributes. Furthermore, compared to the existing solutions, the proposed protocol significantly reduces the authentication cost for a group of MTCDs during handover, while ensuring security, demonstrating commendable efficiency.

DRCLAS: An efficient certificateless aggregate signature scheme with dynamic revocation in vehicular ad-hoc networks

The emergence of the Vehicular Ad-hoc Networks (VANETs) has greatly enhanced the efficiency and safety of transportation systems. However, due to the dynamicness and openness of vehicular networks, it is vulnerable for VANETs to confront various security threats. The dissemination of disinformation and the occurrence of attacks within these networks can result in severe damage and compromise the overall security of transportation systems. To mitigate such challenges, this paper presents an efficient certificateless aggregate signature scheme with dynamic revocation in VANETs. Taking use of the early-stopping factorial bitwise divisions (EFBD) algorithm, it achieves the invalid signatures tracking, and revokes the malicious vehicles dynamically. In addition, by combining the fingerprint counting bloom filter (FP-CBF), the trust assessment mechanism and the cloud server, it enables the vehicle to remedy its incorrect signatures. At last, through the comprehensive security and performance analysis, it demonstrates that this protocol enjoys improved communication security and computational efficiency.

An NTRU-Based Certificateless Aggregate Signature Scheme for Underwater Acoustic Communication

An NTRU-Based Certificateless Aggregate Signature Scheme for Underwater Acoustic Communication

Cryptanalysis of Two Conditional Privacy Preserving Authentication Schemes for Vehicular Ad Hoc Networks

Conditional Privacy Preserving Authentication (CPPA) schemes are an effective way of securing communications in vehicular ad hoc networks (VANETs), as well as ensuring user privacy and accountability. Cryptanalysis plays a crucial role in pointing out the vulnerabilities in existing schemes to enable the development of more resilient ones. In 2019, Zhang proposed a CPPA scheme for VANET security (PA-CRT), based on identity batch verification (IBV) and Chinese Remainder Theorem (CRT). In this paper, we cryptanalyze Zhang’s scheme and point out its vulnerability to impersonation and repudiation attacks. In 2023, Zhang’s scheme was cryptanalyzed by Tao; however, we point out flaws in Tao’s cryptanalysis due to invalid assumptions; hence, we propose countermeasures to Tao’s attacks. Furthermore, in 2021, Xiong proposed a Certificateless Aggregate Signature (CLAS) scheme which is also cryptanalyzed in this paper. Finally, we analyze the causes and countermeasures by pointing out the vulnerabilities in each scheme that enabled us to launch successful attacks and proposing changes that would fortify these schemes against similar attacks in the future.

Certificateless Aggregate Signature Scheme With Security Proofs in the Standard Model Suitable for Internet of Vehicles

Certificateless Aggregate Signature Scheme With Security Proofs in the Standard Model Suitable for Internet of Vehicles

Cryptanalysis of Compact Certificateless Aggregate Signature Schemes for HWMSNs and VANETs

Cryptanalysis of Compact Certificateless Aggregate Signature Schemes for HWMSNs and VANETs

Comments on “A Conditional Privacy-Preserving Certificateless Aggregate Signature Scheme in the Standard Model for VANETs”

Comments on “A Conditional Privacy-Preserving Certificateless Aggregate Signature Scheme in the Standard Model for VANETs”

An efficient and secure certificateless aggregate signature scheme

In recent years, the Internet of Things (IoT) has been developing rapidly and popularizing the world. Smart home is one of its important applications, the devices and household appliances are connected together through the network to provide intelligent services. However, malicious attacks often occur during the transmission of data information, resulting in data leakage or data changes. Therefore, it is necessary to ensure the integrity and availability of data. Based on this, we propose a new pairing-free certificateless aggregate signature (CLAS) scheme, which achieves efficient authentication of multiple messages and improves the verification rate. In addition, we demonstrate its security based on the hardness of the elliptic curve discrete logarithm problem in the random oracle model. Comparison with other CLAS schemes proves that our scheme has better security and higher efficiency through performance analysis.

A lattice-based unordered certificateless aggregate signature scheme for cloud medical health monitoring system

A lattice-based unordered certificateless aggregate signature scheme for cloud medical health monitoring system

RelCLAS: A Reliable Malicious KGC-Resistant Certificateless Aggregate Signature Protocol for Vehicular Ad Hoc Networks

Vehicular ad hoc network (VANET) enables a more efficient and secure traffic environment by integrating several emerging technologies. The technology of certificateless aggregate signature (CLAS) is widely utilized to guarantee secure communications in VANET. However, the legitimation of vehicles’ public keys cannot be verified effectively in existing CLAS protocols for VANET. Thus, a malicious key generation center (KGC) can masquerade as any vehicle and generate legitimate signatures. In this paper, a reliable malicious KGC-resistant CLAS protocol, called RelCLAS, is proposed to eradicate this problem. RelCLAS solves the key escrow problem owning to the combination of registration-based encryption (RBE) and CLAS. Partial public keys selected by vehicles are stored in a key accumulator to prevent malicious KGC from forging valid signatures. Formal security proof demonstrates that RelCLAS satisfies the fundamental security requirements of VANET. Extensive simulations illustrate that RelCLAS is efficient, reliable, and feasible.

A Blockchain-Based Certificateless Aggregate Signature Scheme for Fog-Enabled Smart Grid Environment

The smart grid-based power grid systems face many challenges like-higher computational power requirements, higher latency, security and privacy issues, and single point of failure. In the power grid systems, multiple distribution centers are responsible for supplying electricity in an area. Thus, to address the issues such as single point of failure and higher latency, this paper integrates fog computing and blockchain into the smart grid utilizing distribution centers as blockchain peers and proposes a distributed smart grid environment. Moreover, to address the security and privacy issues, the existing signature schemes face issues like-certificate management, key escrow, higher computational cost, etc. Therefore, this paper employs a certificateless approach and proposes a blockchain-based certificateless aggregate signature scheme that provides authentication, integrity, and privacy in the proposed smart grid environment. Next, a thorough security analysis has been done to prove the security strength of proposed scheme against different types of attackers and attacks. Finally, the performance analysis based on Hyperledger Fabric and cryptography libraries proves the computational and communication efficiency of the proposed scheme.

A full privacy-preserving distributed batch-based certificate-less aggregate signature authentication scheme for healthcare wearable wireless medical sensor networks (HWMSNs)

AbstractThe dynamic connectivity and functionality of sensors has revolutionized remote monitoring applications thanks to the combination of IoT and wireless sensor networks (WSNs). Wearable wireless medical sensor nodes allow continuous monitoring by amassing physiological data, which is very useful in healthcare applications. These text data are then sent to doctors via IoT devices so they can make an accurate diagnosis as soon as possible. However, the transmission of medical text data is extremely vulnerable to security and privacy assaults due to the open nature of the underlying communication medium. Therefore, a certificate-less aggregation-based signature system has been proposed as a solution to the issue by using elliptic curve public key cryptography (ECC) which allows for a highly effective technique. The cost of computing has been reduced by 93% due to the incorporation of aggregation technology. The communication cost is 400 bits which is a significant reduction when compared with its counterparts. The results of the security analysis show that the scheme is robust against forging, tampering, and man-in-the-middle attacks. The primary innovation is that the time required for signature verification can be reduced by using point addition and aggregation. In addition, it does away with the reliance on a centralized medical server in order to do verification. By taking a distributed approach, it is able to fully preserve user privacy, proving its superiority.

A Security-Enhanced Certificateless Conditional Privacy-Preserving Authentication Scheme for Vehicular Ad Hoc Networks

By adopting advanced Internet of Things (IoT) technology to sense and collect traffic-related information to improve traffic safety and efficiency, the vehicular ad hoc network (VANET) is becoming a prominent application that changes human driving experiences in the current era. Because frequent data exchange occurs in open environments, VANETs are inherently vulnerable to security and privacy attacks. In history, many certificateless aggregate signature (CLAS) schemes with conditional privacy-preserving (CPP) have been proposed to ensure the authenticity and integrity of the exchanged data and protect users’ privacy. However, we reveal that the state-of-the-art schemes cannot be deployed in practical VANET applications by proposing concrete signature forgery attacks. To this end, we propose a new CLAS-based authentication scheme with CPP for VANETs. The rigorous security proofs based on the standard cryptographic assumption show that the scheme has enhanced security. Moreover, theoretical analysis and experimental evaluation illustrate the practicality of our design.

A Security-Enhanced Pairing-Free Certificateless Aggregate Signature for Vehicular Ad-Hoc Networks

As self-organizing, highly heterogeneous and multi-interactive networks, vehicular ad-hoc networks (VANETs) are rapidly improving the efficiency of modern traffic. This promising technology is significant for supporting current intelligent transportation by cooperative data sharing and processing. Considering requirements for secure interactions and the limitation of resources in VANETs, protecting data authenticity while enhancing computational efficiency has become the main challenge. A certificateless aggregate signature (CLAS) can not only ensure data security, but also reduce communication costs, which is suitable for a resource-constrained environment. However, most existing CLAS schemes either own serious security vulnerabilities or result in tremendous computational overhead. In this article, we propose an efficient, privacy-preserving, and pairing-free CLAS scheme with enhanced security. We prove that it is existentially unforgeable against adaptive chosen message attacks in the random oracle model. Performance evaluation illustrates that our proposed scheme is more appropriate to the VANETs scenario.

A redesigned secure and efficient data transaction protocol for mobile payment system

Generally, the secure protocol was proposed from the certificateless signature (CLS) scheme to provide the corresponding security for the actual application. However, for the previous application protocols, most of the underlying CLS schemes cannot have their claimed security, because some proposals cannot resist forgery attacks or the master secret key can be captured by the probabilistic polynomial time adversary. To further address the above problems, we take several previous CLS schemes as instances to make a detailed analysis of the causes of the above security flaws and point out that, in a secure CLS scheme, we should appropriately publish the public parameters. Based on the above analysis, we design an efficient and secure CLS scheme in this paper, and the unforgeability is proved based on the hardness of discrete logarithm complexity assumption through the Forking lemma. Compared with the existing constructions, our new proposal has advantages in communication and computation efficiency but also has higher security. Furthermore, a concrete construction of a certificateless aggregate signature (CLAS) scheme is designed with the above basic CLS scheme to realize efficient verification of multiple signatures. Finally, we further improve the key conditions that need to be paid attention to design a secure CLS scheme.