Batch Verification Research Articles

AC-SDVN: An Access Control Protocol for Video Multicast in Software Defined Vehicular Networks

The way to use limited bandwidth resources to achieve high-quality video services in vehicular networks is an important research topic. A large number of studies have shown that the fast-growing field of software defined networking (SDN) can provide solutions to the problems encountered by traditional IP networks when implementing video multicasting. However, there is no research addressing the security issues for this scenario. In this paper, we explore the application scenarios of video multicast in software defined vehicular networks (SDVN), and propose a secure and effective access control protocol to solve multicast security issues. This protocol realizes the authentication of multicast video requesting vehicles and RSUs. According to the authentication results, the SDN controller constructs multicast paths that only reach legitimate RSUs and vehicles, and only the vehicle passing the authentication can obtain video decryption keys. The protocol resists common attacks and satisfies the security requirements in vehicular networks. In addition, the scheme supports batch verification, which reduces the time cost of authentication, and adopts broadcast encryption technology to effectively reduce the communication load. Compared with related schemes, our protocol performs better in terms of computation and communication cost, packet loss rate, and time delay.

Lightweight Privacy and Security Computing for Blockchained Federated Learning in IoT

The development of Internet of Things (IoT) makes human life more intelligent, and the interconnection of all things has become a reality. However, the surge in the number of devices and centralized management brings severe challenges to IoT, such as single point of failure, poor security, privacy leakage, and low reliability. Due to the decentralization, verifiability and privacy protection of blockchain federated learning, some blockchain federated learning schemes have been proposed to solve these problems, but bring new challenges, such as device privacy leakage and heavy security computing load. In this paper, we propose a new decentralized, secure and verifiable consortium blockchain federated learning privacy protection scheme, named LPBFL, which realizes lightweight computing while ensuring the privacy of the local model and dataset of the device. To achieve lightweight privacy protection, LPBFL adopts the Paillier encryption and the newly designed lightweight digital signature and batch verification algorithm. Additionally, considering that devices upload invalid or even toxic local models intentionally or unintentionally, we design a device reputation selection mechanism to make blockchain federated learning more efficient. Finally, the theoretical analysis proves the security of LPBFL and verifies the unforgeability of the proposed digital signature. Comprehensive comparisons and extensive experiments demonstrate that our LPBFL has significant advantages in multiple aspects.

Blockchain-Based Decentralized and Lightweight Anonymous Authentication for Federated Learning

Federated learning (FL) is a promising technology for achieving privacy-preserving edge intelligence and has attracted extensive attention from industry and academia. However, in the FL training process, the server directly aggregates local models from mobile devices, which poses serious privacy and security threats. The identity authentication mechanism can provide FL with local model integrity and source authentication. However, the existing schemes are centralized, and most of them are computationally expensive, resulting in limited performance. To address these issues, this paper proposes a decentralized and lightweight anonymous FL identity authentication scheme, namely DAFL. In our scheme, we first design a decentralized and simplified storage FL authentication framework by combining the directed acyclic graph (DAG) blockchain and accumulator. Then, we propose a lightweight digital signature algorithm that supports batch verification for authentication. Finally, nodes interact through pseudonyms to achieve anonymous communication, and the trusted authority (TA) can track and recover the real identities of nodes when malicious behavior occurs. We theoretically prove the security of the proposed DAFL. The extensive experiments demonstrate that DAFL achieves lower authentication overhead and better convergence performance compared to existing authentication schemes and vanilla FL systems.

Faster verification of V2X basic safety messages via Message Chaining

Vehicular-to-Everything (V2X) communications enable vehicles to exchange messages with other entities, including nearby vehicles and pedestrians. V2X is, thus, essential for establishing an Intelligent Transportation System (ITS), where vehicles use information from their surroundings to reduce traffic congestion and improve safety. To avoid abuse, V2X messages should be digitally signed using valid digital certificates. Messages sent by unauthorized entities can then be discarded, while misbehavior can lead to the revocation of the corresponding certificates. One challenge in this scenario is that messages must be verified shortly after arrival (e.g., within centiseconds), whereas vehicles may receive thousands of them per second. To handle this issue, some solutions propose prioritization or delayed-verification mechanisms, while others involve signature schemes that support batch verification. In this manuscript, we discuss two mechanisms, one based on Message Authentication Codes, and one based on hash chaining, that complement such proposals, enabling the authentication of a sequence of messages from the same source with one single signature verification. Our analysis shows that the technique can reduce the number of verified signatures and computational costs by around 90% for reliable communication channels, and by more than 65% for a maximum packet loss rate of 20%.

MCPAP: A MSIS-based conditional privacy-preserving authentication protocol for smart grids

The smart grid is considered a promising second-generation power grid because electricity service companies can use it to store energy more securely and deliver energy more efficiently. To protect the reliability of power consumption information and the privacy of users’ identity information in a smart grid, many conditional privacy-preserving authentication protocols have been proposed in the last decade. However, these protocols are vulnerable to attacks from the quantum computer because of the large integer factorization problem or the discrete logarithm problem embedded in these protocols. To solve this problem, a security-enhanced conditional privacy-preserving authentication protocol is designed in this paper by using the module small integer solution problem. Besides, we show that our protocol has superior security in the random oracle model. The potential utility of this protocol in the smart grid is also demonstrated through our detailed performance analysis. Moreover, our protocol can use the batch verification method to improve its efficiency significantly.

LSKA-ID: A lightweight security and key agreement protocol based on an identity for vehicular communication

Recently, a huge effort has been pushed to the wireless broadcasting nature in the open area. However, the vehicular ad hoc network (VANET) is disposed to various kinds of attacks. Hence, keeping the security in VANET is the most critical issue because of the VANET network related to human life. Thus, we propose a robust and lightweight security and key agreement-based identity protocol LSKA-ID for vehicular communication. Our protocol utilizes the elliptic curve cryptography, Chinese reminder theorem, and identity (ID)-based cryptosystem to resolve the issues found in the previously proposed schemes, in which our protocol can resolve the key escrow issues accompanied in most ID-based schemes. Also, it does not need batch verification operations, which cause some problems to the verifier in case the batch beacons have one or more illegal beacons. Moreover, the LSKA-ID protocol addresses the dependency on the trusted authority (TA) during the high frequent handover between the groups that may cause a bottleneck problem on the TA. The security analysis proves the correctness of the LSKA-ID protocol by using the random oracle model and has shown to be effective in a performance evaluation.

Cryptanalysis of Two Privacy-Preserving Authentication Schemes for Smart Healthcare Applications

Ensuring the secure sharing of privacy-sensitive healthcare data is attracting considerable interest from researchers. Recently, Ogundoyin et al. designed a lightweight privacy-preserving authentication scheme named PAASH for smart health applications. Benil et al. proposed a public verification and auditing scheme named ECACS for securing e-health systems. Ogundoyin et al. and Benil et al. proposed an efficient certificateless aggregate signature (CLAS) scheme as their respective foundation signature schemes. They declared that their constructions were provably secure under the hardness assumption of cryptographic problems. In this work, we disprove their claim by analyzing the correctness and security of their underlying CLAS schemes. We first show that the batch verification process of n signatures for the CLAS scheme in PAASH is incorrect, and any public-key replacement attacker can easily break the scheme. We analyze the reasons for our attack and propose an improved scheme, named PAASH+. We then show that the CLAS scheme in ECACS fails to achieve correctness, an essential property that a cryptographic scheme should provide. As a result, it is impractical to deploy the designed PAASH and ECACS constructions in any real smart health applications.

Provably Secure and Anonymous V2I and V2V Authentication Protocol for VANETs

Vehicular Ad-hoc Networks (VANETs) enable the connection and information exchange between vehicles and transportation infrastructure (V2I), vehicle and vehicle (V2V) to improve the safety and efficiency of the transportation system. In previous protocols, V2I and V2V authentication protocols based on bilinear pairings or identity-based cryptography are computationally heavy or difficult to protect the user’s identity and privacy. In addition, lightweight authentication protocols have not achieve both V2I and V2V authentication, and may suffer from Onboard Unit (OBU) intrusion attacks, Roadside Unit (RSU) captured attacks, and difficult to track malicious vehicles. Therefore, a lightweight and anonymous V2I and V2V authentication protocol with batch verification based on Elliptic Curves Cryptography (ECC) is proposed. We use Physical Unclonable Function (PUF) and biological key to avoid RSU captured attacks and OBU intrusion attacks, design a feature embedding strategy with dynamic pseudo-identity to recover the malicious vehicle’s identity by the Trusted Authority (TA). In the application test simulating the actual scenario, our protocol is more efficient because of lower overhead and batch authentication strategy. The semantic security of the protocol is formally proved under the random oracle model. The comparative analysis and security proof results show that our protocol is more superior to others.

Algebraic Signature-Based Public Data Integrity Batch Verification for Cloud-IoT

With the rapid development of Internet of Things, the related data are growing explosively. However, IoT devices have limited storage and computing capabilities so that they cannot deal with massive data storage and computing locally. The integration of IoT and cloud is regarded as an effective solution to the above issue, i.e., IoT devices outsource collected data to cloud to enjoy powerful storage and computing resources. Because the data stored in cloud are out of the control of IoT users, some security risks need to be addressed in advance. In this paper, we propose a public data integrity verification scheme, called AIVCI, to check the data integrity for Cloud-IoT scenarios. Firstly, based on algebraic signature and homomorphic hash function, AIVCI can efficiently complete data auditing. Secondly, AIVCI adopts blind technology to prevent the privacy leakage of IoT data and further protect the privacy of IoT users. Thirdly, batch auditing is implemented to improve auditing efficiency and meet realistic demands for Cloud-IoT scenarios. And a new data structure named Improved Divide and Conquer Table (ID&CT) is designed to realize efficient data dynamics. Finally, the security and performance analysis demonstrates that AIVCI is more secure and efficient.

CPAHP: Conditional Privacy-Preserving Authentication Scheme With Hierarchical Pseudonym for 5G-Enabled IoV

As a representative application scenario of the Internet of Things (IoT), the Internet of Vehicles (IoV) plays an important function in the area of intelligent transportation. However, data traffic exchanged in IoV is usually correlated with plenty of sensitive information, thus leading to privacy leakage. Nevertheless, if all personal data about vehicles are completely protected, it will be hard to trace the real identities of malicious vehicles, which also raises other security issues in IoV. In addition, existing schemes are not fully suitable for 5G-enabled IoV due to their complex structure and high computation requirements. In order to realize more efficient communication and anonymous authentication of vehicles with superior security, we propose a conditional privacy-preserving authentication scheme with hierarchical pseudonyms (CPAHP) in 5G-enabled IoV, which is based on the elliptic curve Diffie-Hellman (ECDH) problem. Through the hierarchical pseudonym mechanism, CPAHP can protect the real identities and movement tracks of vehicles. Whereas, if vehicles have malicious behaviors, their real identities can be recovered through the corresponding pseudonyms. Furthermore, by taking advantage of a batch verification method, receivers can easily cope with a huge influx of messages in a short space of time. Moreover, by introducing blockchain technology, traffic information can be shared smoothly among all vehicles. Through the security analysis and performance evaluation, it is demonstrated that CPAHP can not only meet the security requirements but also provide higher computational efficiency.

Blockchain-Based Distributed Computing Consistency Verification for IoT Mobile Applications

The maturation of wireless connectivity, blockchain (distributed ledger technologies), and intelligent systems has fostered a comprehensive ecosystem for the Internet of Things (IoT). However, the growing volume of data generated by IoT devices creates substantial pressure on blockchain storage and computation capabilities, impeding the further development of the IoT ecosystem. Decentralizing data storage across multiple chains and utilizing cross-chain technology for data exchange eliminates the need for expensive centralized infrastructure, lowers data transfer costs, and improves accessibility. Hence, the issue of computational and storage pressure in blockchain can be improved. Nonetheless, the data of IoT devices are constantly updating, and ensuring consistency for dynamic data across heterogeneous chains remains a significant challenge. To address the aforementioned challenge, we propose a blockchain-based distributed and lightweight data consistency verification model (BDCA), which leverages a batch verification dynamic Merkle hash tree (BV-MHT) and an advanced gamma multi-signature scheme (AGMS) to enable consistent verification of dynamic data while ensuring secure and private data transmission. The AGMS scheme is reliable and robust based on security analysis while the dependability and consistency of BDCA are verified through inductive reasoning. Experimental results indicate that BDCA outperforms CPVPA and Fortress in communication and computation overhead for data preprocessing and auditing in a similar condition, and the AGMS scheme exhibits superior performance when compared to other widely adopted multi-signature schemes such as Cosi, BLS, and RSA. Furthermore, BDCA provides up to 99% data consistency guarantees, demonstrating its practicality.

Schnorr-based conditional privacy-preserving authentication scheme with multisignature and batch verification in VANET

During both Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communications, authentication process is necessary to protect Vehicular Ad Hoc Network (VANET) from cyberattacks. In this paper, an efficient Conditional Privacy Preserving Authentication (CPPA) scheme is proposed which does not require a certificate and overcomes the escrow problem during the authentication process. The proposed scheme uses Elliptic Curve cryptography and avoids Map-to-Hash function and bilinear pairing. In this regard, we call our scheme Schnorr-CPPA since it allows to implement Schnorr algorithm and aggregate signatures into a short signature during the authentication process in VANET. When a roadside unit receives the same message from multiple vehicles, it can verify and aggregate the signatures into one aggregate signature using a multisignature feature and transmit the aggregate signature to a traffic control center for networking management. In addition, a roadside unit can verify different messages coming from vehicles by using a batch verification feature and aggregate the signatures into one signature, and then can transmit the result to a traffic control center. During both the multisignature and batch verification process, our Schnorr-CPPA is resistant against the rogue attack since the roadside unit should check the possession of proof (POP) as a proof that each signer possesses the private key. Additionally, a security proof is given and shows that our scheme is secure in the random oracle. Plus, our simulation proves that Schnorr-CPPA has better performance when compared with several research works regarding time cost for one and multiple messages during the authentication process.

IoT-based interaction design of smart home products for elderly families

Abstract A LoRa (Long Range Radio) based smart home product interaction system for the elderly is designed to solve the problem of reliability communication in the collection and information transmission of smart home environment parameters, device status parameters and the complex layout of communication lines inside smart devices. A privacy-preserving data aggregation scheme without a trusted authority center is proposed to address the privacy protection problem in the process of Internet of things (IoT) data collection. Firstly, without relying on the trusted authority center, the key exchange algorithm is used to generate shared secret keys and construct encryption keys among terminal devices to ensure the privacy of reported data; secondly, a fault tolerance mechanism is designed according to Carmichael’s theorem, so that the control center can still aggregate the received data when the terminal device fails or the network connection is wrong; in addition, the batch In addition, the integrity of the reported data is ensured by means of batch verification. Finally, the theoretical analysis proves the correctness and security of the scheme in this paper. The performance experiments show that the required computational overhead is lower compared to existing schemes, while some communication overhead is increased in order to have fault tolerance and to improve the verification efficiency of digital signatures. The application of this system will highlight the main position of the elderly, so that they can truly experience and accept the benefits of smart home for their lives and improve their quality of life.

Secure and efficient authenticated group key agreement protocol for AI-based automation systems

Automation systems are soaring due to the innovation of artificial intelligence (AI) technologies. In this paper, we mainly concentrate on the security and efficiency of data transmission in AI-based automation systems, especially, for data sharing in a group manner in distributed networks. To this end, an authenticated group key agreement protocol is proposed for secure data transmission in AI-based automation systems. In order to release the computational overhead of distributed nodes, a semi-trusted authority (STA) is introduced to enable precomputation operations. Moreover, to overcome the predominantly distributed denial of service (DDoS) attack, a dynamic batch verification mechanism is devised. The presented dynamic batch verification mechanism guarantees that the proposed protocol can be run properly among legitimate nodes regardless of the existence of nodes who suffered from the DDoS attack. Finally, the session key security of the proposed protocol is proved and the performance is evaluated.

A secure access control scheme with batch verification for VANETs

When an onboard unit (OBU) moves into the area of a roadside unit (RSU), authentication occurs. In areas with heavy traffic, e.g., intersections, an RSU may receive thousands of requests in a short period . Verifying each request separately can lead to wasted resources and cause RSU service bottlenecks. Because these requests have stringent real-time requirements, if they are not processed in time, vehicles may not be able to change their driving status and could encounter large-scale congestion or even dangerous areas. To improve efficiency, this study investigated a secure access control scheme with batch verification for vehicular ad hoc networks . The proposed method requires only two bilinear pairing operations to verify n requests, which is the same number for a single verification. Through a performance analysis, it was confirmed that the proposed scheme has a lower computation cost and the least communication overhead among existing schemes. Furthermore, extensive simulations demonstrated that the scheme has the lowest processing delay, and as the number of batch verifications increases, its processing delay growth range also diminishes. A detailed security analysis shows that the scheme achieves collusion resistance, signature unforgeability, and replaying resistance.

SRAKN: Secure Roaming Authentication and Key Negotiation protocol for Space Information Network

Nowadays, the Space Information Network (SIN) with global signal coverage, large capacity, bandwidth-on-demand flexibility, and multiple services has attracted more and more users to enjoy real-time services without geographical restrictions. However, due to the openness of the satellite-to-ground wireless link, users are vulnerable to various attacks when accessing SIN and obtaining subscription services, which may pose security threats to user privacy, message integrity and confidentiality. Although many authentication protocols have been proposed to protect the security of access and data transmission, most of them are only applicable to the authentication scenarios in the home domain, without considering the security threats of roaming authentication in foreign domains. Moreover, the existing roaming authentication protocols still have some defects such as security vulnerabilities, long authentication delay, and high communication overhead. Therefore, in this paper, we propose a new secure roaming authentication and key negotiation protocol based on elliptic curve cryptography (ECC) for SIN, namely the SRAKN protocol, which also supports conditional anonymity and batch verification. In the roaming authentication phase, not only fast and low-overhead mutual authentication between the roaming user, satellite node and the foreign terrestrial control station (FTCS) is realized, but also a secure session key is jointly negotiated by the roaming user and FTCS to protect the subscription service transmission. The results of security analysis and performance comparison show that the SRAKN protocol is not only secure and resistant to various known attacks, but also has shorter roaming authentication delay, lower batch authentication overhead and communication overhead, making it more suitable for roaming users to access SIN in foreign domains.

PEPA: Paillier cryptosystem-based efficient privacy-preserving authentication scheme for VANETs

The use of the Internet of Things is increasing dramatically, creating a network of objects from sensors to smart appliances, such as smart vehicles. Vehicular Ad-hoc Networks (VANETs), as a special network, enables connected vehicles to communicate with other entities and provide a variety of stable communication services by infrastructures on both sides of the road for vehicles. However, the open-medium nature of communications and the high-speed mobility of vehicles may bring several potential security and privacy issues. To solve the issues, this paper proposes a Paillier cryptosystem-based efficient privacy-preserving authentication scheme (PEPA) for VANETs. The proposed PEPA supports batch verification of presentation tokens and allows users to interact with other entities without disclosing any sensitive information. In addition to this, multiple authorities are adopted to reveal the real identities of malicious users via cooperation. PEPA is more feasible than other schemes since it relies on a realistic tamper-proof device rather than an ideal one. System analysis demonstrates that the proposed PEPA achieves strong and verifiable privacy-preserving authentication and satisfies the common security and privacy requirements, such as unlinkability, accountability, and so on. Performance analysis and simulation demonstrate that the proposed PEPA offers better performance compared with traditional ones.

PCAS: Cryptanalysis and improvement of pairing-free certificateless aggregate signature scheme with conditional privacy-preserving for VANETs

Certificateless aggregate signature (CLAS) is an effective approach for the multiple authentications in multi-users and multi-information environments like the vehicular ad hoc networks (VANETs), which can address the certificate management issue in the traditional public key cryptography (PKC) and solve the key escrow problem in identity-based cryptography (IBC). In recent years, a new CLAS mechanism (LICLAS) is presented for the authentication of sensors in healthcare wireless medical sensor networks (HWMSNs). In this paper, we make an analysis and prove that LICLAS is not able to against forgery attacks. Thus, we present an improved CLAS scheme (PCAS) for vehicle authentication in VANETs, which satisfies the privacy and security requirements. PCAS constructs the signature algorithm based on Elliptic Curve Cryptography (ECC) to avoid bilinear pairing and Map-to-Hash function operations. In order to further improve security and efficiency of PCAS, the vehicle key generation and signature algorithm is revised. The pseudonym mechanism is also adopted to achieve conditional privacy preservation. Besides, PCAS allows to execute a batch verification of messages, where RSUs may verify the aggregated signatures from vehicles to reduce time overhead. Under the assumption that the elliptic curve discrete logarithm problem (ECDLP) is hard, PCAS is proved to be existentially unforgeable against adaptive chosen message attacks in the random oracle model. Through the performance analysis, under the same time complexity, PCAS is shown to more effective. Compared with LICLAS, for a single message and 2000 messages, the transmission overhead of PCAS is reduced by 25% and 25% respectively, and the computation overhead is reduced by 16.56% and 25.34% respectively.

A linkable signature scheme supporting batch verification for privacy protection in crowd-sensing

The maturity of 5G technology has enabled crowd-sensing services to collect multimedia data over wireless network, so it has promoted the applications of crowd-sensing services in different fields, but also brings more privacy security challenges, the most commom which is privacy leakage. As a privacy protection technology combining data integrity check and identity anonymity, ring signature is widely used in the field of privacy protection. However, introducing signature technology leads to additional signature verification overhead. In the scenario of crowd-sensing, the existing signature schemes have low efficiency in multi-signature verification. Therefore, it is necessary to design an efficient multi-signature verification scheme while ensuring security. In this paper, a batch-verifiable signature scheme is proposed based on the crowd-sensing background, which supports the sensing platform to verify the uploaded multiple signature data efficiently, so as to overcoming the defects of the traditional signature scheme in multi-signature verification. In our proposal, a method for linking homologous data was presented, which was valuable for incentive mechanism and data analysis. Simulation results showed that the proposed scheme has good performance in terms of security and efficiency in crowd-sensing applications with a large number of users and data.

A study on improving bounds for batch verification of DNA synthesis using concurrent ZKP

A study on improving bounds for batch verification of DNA synthesis using concurrent ZKP