Batch Verification Research Articles

PSEEMV: Provably secure and efficient emergency message verification scheme based on ECC and CRT for Space Information Network

With the rapid development of satellite computing and communication capabilities, Space Information Network (SIN) makes it possible for users to obtain subscription services anywhere and anytime. Especially for environmental monitoring, emergency rescue and disaster warning in remote areas, the deployed device cannot rely on traditional ground networks but can only transmit data and delay-sensitive emergency messages through satellite nodes of SIN. However, because of the openness of the satellite-to-ground link, it is vulnerable to various forms of attacks, which poses threats to data, emergency messages and user privacy. Existing mutual authentication schemes are not suitable for the transmission and verification of time-sensitive emergency messages due to high delay and computational overhead. Therefore, in this paper, we propose a provably secure and efficient emergency message verification scheme based on ECC and CRT, namely the PSEEMV scheme. The PSEEMV scheme not only uses the conditional privacy-preserving pseudo-identity to ensure privacy and accountability, but also supports confidential transmission and batch verification of emergency messages. Security proof and analysis prove that the PSEEMV scheme can resist forgery signature attacks based on the random oracle model, and meet the security and privacy requirements. Furthermore, performance analysis and comparison shows that the PSEEMV scheme has higher security, lower signaling, computational and communication overhead, and is more suitable for the transmission and verification of emergency message in the resource-constrained SIN.

SEMDA: Secure and Efficient Multidimensional Data Aggregation in Smart Grid without a Trusted Third Party

Smart grids are a combination of traditional power system engineering as well as information and communications technology. Smart grid terminals provide convenient services to users by aggregating their data in real time. However, terminals can derive user privacy information from real-time data on smart devices. Therefore, security data aggregation has been widely studied in the field of smart grid. Most existing schemes are one-dimensional data aggregation or rely on a trusted third party. In reality, multidimensional data (such as a user’s electricity consumption or user’s main usage time, etc.) makes sense for terminals to flexibly adjust supply and demand strategies. In this paper, we propose an efficient and secure multidimensional data aggregation scheme that supports batch validation without a trusted third party. Firstly, we apply the Chinese remainder theorem to encode the user’s multidimensional data and realize the independence of each dimension in terminal decryption. Secondly, we adopt a secure key negotiation protocol that does not require a trusted third party. Finally, based on paillier homomorphic encryption and bilinear pairing, we construct an encryption scheme that can reuse the key and blind factor and support batch verification. The analysis results show that our scheme is secure for users’ privacy protection. Experimental results show that, compared with existing 1 dimensional aggregation schemes, our scheme has almost no growth in computational overhead for terminal decryption.

BASRAC: An efficient batch authentication scheme with rule-based access control for VANETs

Security and privacy protection are important requirements of vehicular ad hoc networks (VANETs). In recent years, many authentication schemes have been proposed to solve the security and privacy issues in VANETs. However, almost all authentication schemes do not distinguish the vehicles with different zones' access rights. This paper proposes an efficient batch authentication scheme with rule-based access control for VANETs, named BASRAC, which provides access control during the authentication phase to prevent unauthorized vehicles from accessing zones' services. At the same time, BASRAC supports batch verification, which further improves the efficiency of authentication. Moreover, BASRAC ensures data confidentiality, which prevents the semi-trusted roadside unit (RSU) from obtaining useful service information. Security analysis shows that BASRAC is secure under the random oracle model and meets the security requirements of VANETs. Performance evaluation shows that, compared with the existing schemes, BASRAC cuts down the computational cost of signing, single verification, and batch verification by 58.05%-90.84%, 29.93%-69.61%, and 59.49%-77.65%, respectively. Moreover, BASRAC is more effective in communication overhead and performs better in the average message delay and RSU serving capability.

A SM2 based efficient and lightweight batch verification approach for IC cards

With the rapid development of the Internet of Things (IoT), IoT security has become more and more important. A large number of IoT tasks use digital signatures to ensure authenticity, integrity, and non-repudiation. However, verifying lots of signatures reduces the performance of the IoT system. Batch verification can verify multiple digital signatures at the same time, which reduces the computational overhead and verification time compared with consecutive respective verification. Thus it is suitable for IoT systems. SM2(Shangyong Mima 2) digital signature algorithm is a public key cryptographic algorithm based on elliptic curve cryptography(ECC), and is widely used in IoT applications. We propose SM2Verifi in this paper, a batch verification approach for SM2 digital signatures. SM2Verifi calculates fewer scalar multiplications than consecutive respective verification and uses the KGLP algorithm and the multi-parameter inversion algorithm to speed up scalar multiplications and inversions. Therefore, SM2Verifi greatly reduces the computational overhead and verification time. SM2Verifi generates a set of random integers through the addition chain seminumeric computation to resist possible forged signatures and determines whether to accept a batch of signatures by calculating congruence equations and resultants. Our extensive experiments on NXP smart cards show that SM2Verifi can significantly improve verification efficiency. Specifically, without randomization, batch verification of nine signatures belonging to one signer is 6.41 times faster than respective verification. Considering the verification performance, security, and hardware overhead, SM2Verifi achieves the comprehensive optimum when verifying seven signatures signed either by one signer or seven signers with 32-bit randomization.

Authenticated Data Sharing With Privacy Protection and Batch Verification for Healthcare IoT

The healthcare Internet of Things (IoT) is rapidly becoming an invaluable tool in the healthcare industry. However, sharing data in healthcare IoT raises many security and privacy concerns, such as how to ensure data integrity, source authentication, and data privacy. Redactable signature schemes ( <inline-formula><tex-math notation="LaTeX">${{\sf RSS}}$</tex-math></inline-formula> s) could be a feasible solution to address this question because it allows a signature holder to independently delete the privacy-sensitive part of the authenticated data without invalidating the respective signature. This flexible data sharing mechanism not only protects data privacy but also saves bandwidth. However, the state-of-the-art <inline-formula><tex-math notation="LaTeX">${{\sf RSS}}$</tex-math></inline-formula> s suffer from either the costly public key management problem or the secret key escrow problem. Another drawback of these schemes lies in their computation and communication overheads and hence are quite expensive for constrained devices. To address these challenging issues, in this work, we first propose the notion of certificateless <inline-formula><tex-math notation="LaTeX">${{\sf RSS}}$</tex-math></inline-formula> . We then provide an efficient instantiation of our scheme and prove its security under cryptographic assumptions. Our construction supports batch verification and redaction control, which further saves bandwidth and enhances the security of shared data by preventing the dishonest holder from arbitrarily editing data. Moreover, the comparison analysis of theory and experiment with more recent works shows the practicability of our design.

Secure Battery Swapping: A Reservation Scheme with Conditional Privacy-Preserving Bidirectional Heterogeneous Aggregate Signcryption and Incentive Mechanism

For large-scale battery-swapping demands, reserva- tions are utilized to effectively manage battery swapping. To achieve data security, one promising solution is heterogeneous signcryption (i.e. signature + encryption). However, existing heterogeneous signcryption cannot simultaneously support aggre- gation, batch verification, conditional privacy-preserving, bidirec- tional heterogeneous communication, and availability. Besides, to reduce the end-to-end delays, mobile edge computing (MEC) is introduced to reservations, so other challenge is to design an incentive mechanism to encourage mobile edge nodes (MENs) to transmit reservation messages. Seeking to address these chal- lenges, we propose a reservation scheme with conditional privacy- preserving bidirectional heterogeneous aggregate signcryption and incentive mechanism, namely SecBS. More precisely, in status publication (i.e. SecBS-SP), electric vehicles (EVs) obtain status messages released by battery swapping stations (BSSs) via MENs, which is realized via heterogeneous signcryption from certificateless cryptosystem (CLC) to identity-based cryptosystem (IBC). In the reservation (i.e. SecBS-R), under the incentive, MENs transmit reservations sent by EVs to BSSs, which is realized via heterogeneous signcryption from IBC to CLC. Finally, formally security proof and extensive simulations are carried out to manifest the security and feasibility of our SecBS.

Perception Layer Lightweight Certificateless Authentication Scheme for IoT-Based Emergency Logistics

Emergency logistics is of great significance for supply security in emergencies. As a crucial component of strategic material reserve and allocation, emergency logistics is characterized by high levels of safety and efficacy. The security of the IoT-based emergency logistics system cannot be overstated, considering the potential damage caused by malicious accessors. Authentication is an essential means of system security. Existing certificateless authentication protocols are mostly based on bilinear pairings, which cannot match the objectives of emergency logistics networks for lightweight deployment and fast authentication of massive nodes. In this paper, we propose a lightweight certificateless authentication protocol (CL-LAP) without bilinear pairings. The security is determined by the discrete logarithm problem on elliptic curves. Nonlinear pairings guarantee energy efficiency and minimum computation cost. In addition, we use batch verification to reduce the authentication cost and tackle the problem of quick authentication in broadcast messages. We conduct a security analysis on the proposed CL-LAP under the random oracle model to demonstrate that the proposed scheme can withstand common security threats and provide the necessary security for the perception layer. The performance analysis indicates that the suggested scheme is less complex and more efficient than similar schemes with the same level of security.

EF-CRT: Group Key Update and Batch Verification Based on Euler Function and Chinese Remainder Theorem for Edge-Fog Computing Networks

EF-CRT: Group Key Update and Batch Verification Based on Euler Function and Chinese Remainder Theorem for Edge-Fog Computing Networks

Empirical Evaluation of ECC Batch Verification Algorithms of Digital Signature in Wireless Sensor Network

Wireless sensor network (WSN) is an emerging topic in wireless communication where various sensor nodes are connected over the internet for data exchange. Exchanging the information over the WSN is very critical; therefore, it requires authentication and security mechanisms to ensure integrity and confidentiality. To avoid unauthorized use of WSN, the authentication through a digital signature turns into an essential task in WSN. Verification of individual signature is taking too much time and it is not suitable for wireless sensor network. Digital signature verification time can be reduced by using batch verification techniques in WSN. Therefore, the goal of this research is to examine and analyze the different type of batch verification algorithm based on Elliptic Curve Cryptography (ECC). With respect to security, the entire algorithm is identical to the standard Elliptic Curve Digital Signature Algorithm (ECDSA) verification algorithm. These algorithms are effectively limited to small batch sizes.

A Multisignature-Based Secure and OBU-Friendly Emergency Reporting Scheme in VANET

Acting as an important part of Internet of Things (IoTs), vehicular ad-hoc network (VANET) has attracted considerable attention in recent years, where the emergency reporting system is a significant branch and can improve road safety and optimize traffic management. In an emergency reporting system, the authenticity of the emergency messages needs to be ensured carefully since malicious entities may report fake emergency messages to seek personal profit. However, most existing emergency reporting schemes are not efficient enough for secure reporting, given the limited resources of onboard units (OBUs). In this work, we propose a new emergency reporting architecture based on multisignature, where the computation and communication overhead of road-side units (RSUs) is greatly reduced, as the signatures sent to the RSUs have been aggregated. Then, we transform a chameleon signature into a multisignature and propose a secure and OBU-friendly emergency reporting scheme (SOERS) under our architecture. The proposed scheme only requires one hash, two multiplication, and two addition operations to generate a signature for each OBU. Moreover, batch verification of multisignatures further improves the efficiency. Security analysis shows that our scheme is secure against the vehicles-collusion attack and the rogue-key attack, which is a severe issue in multisignature. Finally, performance evaluation shows that our scheme is an efficient solution for emergency reporting.

A privacy preserving framework for federated learning in smart healthcare systems

Federated Learning (FL) is a platform for smart healthcare systems that use wearables and other Internet of Things enabled devices. However, source inference attacks (SIAs) can infer the connection between physiological data in training datasets with FL clients and reveal the identities of participants to the attackers. We propose a comprehensive smart healthcare framework for sharing physiological data, named FRESH, that is based on FL and ring signature defense from the attacks. In FRESH, physiological data are collected from individuals by wearable devices. These data are processed by edge computing devices (e.g., mobile phones, tablet PCs) that train ML models using local data. The model parameters are uploaded by edge computing devices to the central server for joint training of FL models of disease prediction. In this procedure, certificateless ring signature is used to hide the source of parameter updates during joint training for FL to effectively resist SIAs. In the proposed ring signature schema, an improved batch verification algorithm is designed to leverage additivity of linear operations on elliptic curves and to help reduce the computing workload of the server. Experimental results demonstrate that FRESH effectively reduces the success rate of SIAs and the batch verification method significantly improves the efficiency of signature verification. FRESH can be applied to large scale smart healthcare systems with FL involving large numbers of users.

EEPPDA—Edge‐enabled efficient privacy‐preserving data aggregation in smart healthcare Internet of Things network

AbstractThe Internet of Things‐based smart healthcare provides numerous facilities to patients and medical professionals. Medical professionals can monitor the patient's real‐time medical data and diagnose diseases through the medical health history stored in the cloud database. Any kind of attack on the cloud database will result in misdiagnosis of the patients by medical professionals. Therefore, it becomes a primary concern to secure private data. On the other hand, the conventional data aggregation method for smart healthcare acquires immense communication and computational cost. Edge‐enabled smart healthcare can overcome these limitations. The paper proposes an edge‐enabled efficient privacy‐preserving data aggregation (EEPPDA) scheme to secure health data. In the EEPPDA scheme, captured medical data have been encrypted by the Paillier homomorphic cryptosystem. Homomorphic encryption is engaged in the assurance of secure communication. For data transmission from patients to the cloud server (CS), data aggregation is performed on the edge server (ES). Then aggregated ciphertext data are transmitted to the CS. The CS validates the data integrity and analyzes and processes the authenticated aggregated data. The authorized medical professional executes the decryption, then the aggregated ciphertext data are decrypted in plaintext. EEPPDA utilizes the batch verification process to reduce communication costs. Our proposed scheme maintains the privacy of the patient's identity and medical data, resists any internal and external attacks, and verifies the health data integrity in the CS. The proposed scheme has significantly minimized computational complexity and communication overhead concerning the existing approach through extensive simulation.

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.

Pairing-free certificateless blind signature scheme for smart grid

The smart grid is an emerging power system that can realize the information exchange between users and power companies in two-way communication and adjust power companies’ power supply according to the real-time power requests from smart meters on the users’ side. However, since malicious attackers can eavesdrop on two-way communication to collect and transmit information, they may leak users’ information. Therefore, this paper proposes a new certificateless blind signature (CLBS) scheme with batch verification function and improves a power request system model for the smart grid to protect users’ privacy. In addition, the proposed CLBS scheme simplifies the certificate management process in the traditional public key cryptosystem and eliminates the hidden key escrow in the identity-based public key cryptosystem. The unforgeability of the scheme is proved through the random oracle model, and the scheme’s security can be reduced to the intractability of the elliptic curve discrete logarithm problem (ECDLP). The analysis results show that our scheme does not use the time-consuming bilinear pairing operation, and has obvious advantages in computing performance compared with the existing signature schemes.

A Pairing-Free Heterogeneous Signcryption Scheme for Unmanned Aerial Vehicles

During the past few years, as Internet of Things develops rapidly, the applications of unmanned aerial vehicle (UAV) technology have been increasingly widely used. Meanwhile, the efficiency and security issues of UAV communication have brought about widespread attention of many researchers in different fields. In an open wireless network, the attacks on UAV communication mainly include eavesdropping, tampering, interrupting, forgery, etc. Signcryption is an appropriate method to address these security problems. However, the existing signcryption schemes are not suitable for UAVs with limited resources and ground station (GS) that needs to process a large number of messages from UAVs. Moreover, in a certain area, UAVs and a GS may belong to different cryptosystems. Therefore, in this article, we came up with a heterogeneous signcryption scheme for UAVs to communicate to a GS (HSC-U2G) without bilinear pairing operation, where UAVs belong to identity-based cryptography (IBC) while the GS belongs to public-key infrastructure (PKI). Moreover, our scheme provides identity privacy for UAVs and supports batch verification for the GS. Using the random oracle model, we demonstrate HSC-U2G can achieve insider security for confidentiality as well as unforgeability. After that, HSC-U2G is compared with several important related works and we provide all experimental results to show the efficiency.

Secure, Efficient, and Weighted Access Control for Cloud-Assisted Industrial IoT

In the cloud-assisted Industrial Internet of Things (IIoT), ciphertext-policy attribute-based encryption (CP-ABE) could help the data owner (DO) share his sensitive data via the cloud under self-defined access structures. Among general CP-ABE schemes, the decryption overhead, the key generation cost, and the ciphertext length increase with the number of involved attributes. Additionally, only regular attributes are taking into consideration rather than weighted attributes. In this article, we proposed a secure, efficient, and weighted access control scheme (SEWAC) for cloud-assisted IIoT applications. SEWAC enables the DO to formulate any fine-grained access structure over weighted attributes without making it more complicated. Furthermore, such weighted attributes would not add the length of ciphertext. SEWAC also supports online/offline key generation to alleviate the computational cost of the authority from answering mass key requests in the online phase, while most computational tasks are executed in the offline phase. The heavy decryption overhead is offloaded to the cloud. To ensure the cloud to honestly execute the process of outsourced decryption, we design an efficient batch verification method, which allows the user to spend only three bilinear pairing operations in checking the correctness of batch results. We also give the formal security proof of the proposed scheme. Comprehensive comparisons and implementation results indicate that SEWAC can better achieve weighted access control, compressed ciphertext length, efficient key generation, and the assurance of the outsourced decryption result.

Towards Lightweight Authentication and Batch Verification Scheme in IoV

Revolution in the transportation industry was envisioned by self-driving vehicles, with the potential of communication with other vehicles and interaction with other units of the smart environment. With the advent of the Internet of Vehicles(IoV), which is a system that allows communication between vehicles and other static components of the environment and is a convergence of the Internet of Things (IoT), vehicles are considered as an essential part of the network having secure data sensing and processing platforms. Many vehicular ad-hoc networks (VANETs) research focused on the limited set of applications for intelligent transportation systems (ITS) and typically implied safe driving, infotainment, and traffic management. However, it still exhibits an enormous scope of enhancement in various areas of ITS. In this article, we present a new architecture for IoV, keeping in view the different aspects of ITS and discussing how it can mitigate the challenges of secure communication in IoV along with the new visionary solution for authentication. An IoV is highly dynamic, having different topological structures, uneven distribution of nodes, and, therefore, vulnerable to various security and privacy attacks. This article also presents an efficient batch verification scheme having lightweight authentication that uses bilinear map and one-way hash functions to ensure a high level of security within the limited time constraint as compared to single message verification. The proposed scheme has better performance than the existing techniques in terms of computational delay, time complexity, transmission overhead, and energy consumption.

BBNP: A Blockchain-Based Novel Paradigm for Fair and Secure Smart Grid Communications

As the future energy infrastructure, smart grid aims to overcome the disadvantages of traditional power grid, e.g., low efficiency and unstable service. However, the frequent collection and analysis of the user’s electricity data may bring various security and privacy threats. Besides, the traditional centralized data storage model in the smart grid is prone to the single point of failure. To address these challenges, in this article, for fair and secure smart grid communication, a blockchain-based novel paradigm, named BBNP, is proposed. Specifically, based on the pseudorandom function and auxiliary information generation and sharing technology, a lightweight data aggregation protocol is designed first to protect the user’s data privacy and ensure communication confidentiality. Then, a novel efficient authentication mechanism is proposed to generate and share session keys in a noninteractive way, which is leveraged for MAC authentication to achieve data integrity of the transmitted data. After that, based on the subjective logic reputation model, a blockchain node consensus mechanism is studied to efficiently store smart grid big data and effectively solve the single point failure problem. By constructing the long-term reputation model for consensus nodes (CNs) and integrating batch verification technology, the problems of CN fair selection and scalability of large-scale nodes are solved simultaneously. Finally, the performance evaluation indicates that BBNP outperforms the state-of-the-art similar schemes in computing complexity, communication cost, system availability, and fairness of block generation.

A Verifiable Privacy-Preserving Machine Learning Prediction Scheme for Edge-Enhanced HCPSs

As a highly integrated industrial system, human cyber-physical systems (HCPSs) provide accurate and high-quality services for Industry 5.0. In HCPSs, machine learning (ML) prediction provides reliable prediction results for users based on matured models, while security and privacy protection are considerable issues. In this article, based on the modified Okamoto–Uchiyama homomorphic encryption, we propose a verifiable privacy-preserving machine learning prediction scheme for the edge-enhanced HCPSs, which outputs the verifiable prediction results for users without privacy leakage. Specifically, a batch of prediction results can be verified at one time, which improves the efficiency of verification. Security analysis shows that our scheme protects the privacy of inputs, ML model, and prediction results. The experiment results demonstrate that the edge computing architecture remarkably alleviates the computational burden of the cloud server. Furthermore, compared with other related schemes, our scheme shows the best execution efficiency, and batch verification optimizes the performance by about 15% compared with single verification on the same scale.

An arbitrable multi‐replica data auditing scheme based on smart contracts

SummaryIn order to improve the availability and persistence of data, lightweight cloud users want to store multiple‐replicas of the original file on the server with less local computing and storage overhead. Meanwhile, to ensure the integrity of the remote storage data, some schemes have been designed to allow public verification. However, most existing schemes only focus on malicious cloud service providers and ignore the possibility that dishonest users cheat for profit. This article implements an arbitrable data auditing scheme under multi‐replica storage. The scheme adopts a new arbitration mechanism under multi‐replica storage, makes use of the non‐tampering characteristics of smart contracts, carries out reliable verification through miners, and realizes the timely detection and punishment of any fraudulent entity. In addition, the scheme also designs a multi‐replica storage model based on the B* tree, realizes the batch verification of replica blocks, enables the fraud behavior of malicious users to be identified after data update, and improves the space utilization efficiency. The article also gives detailed security proof of the proposed scheme. The evaluation result shows our scheme not only realizes a more practical and fairer audit scheme but also has lower computational overhead than current state‐of‐the‐art multi‐replica arbitrable schemes.