Supporting Batch Verification Research Articles

Improving Throughput of Mobile Sensors via Certificateless Signature Supporting Batch Verification

Mobile sensors enjoy the advantages of easy installation and low consumption, which have been widely adopted in many information systems. In those systems where data are generated rapidly, the throughput of the sensors is one of the most fundamental factors that determine the system functionality. For example, to guarantee data integrity, digital signature techniques can be applied. In many practical scenarios, such as the smart grid system, data are generated rapidly and, hence, the signature together with the data must also be transmitted and verified in time. This requires the mobile sensors to support a high-throughput data processing ability. In this setting, how to achieve efficient signature schemes supporting batch verification must be considered. Many signatures, such as the original national cryptographic standard, namely, the SM2 algorithm, do not support batch verification and are in a public-key infrastructure setting. In this paper, we propose a SM2-based certificateless signature scheme with batch verification, which is suitable for the aforementioned environment. The scheme extends the Chinese cryptographic standard SM2 algorithm to the certificateless setting and multiple signatures can be verified simultaneously. Another advantage of this scheme is that its signing phase does not involve any pairing operation. The verification phase only requires a constant pairing operation, which is not related to the number of signatures to be verified. The construction is generic and can be instantiated using any traditional signature scheme.

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.

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.

EPMDA-FED: Efficient and Privacy-Preserving Multidimensional Data Aggregation Scheme With Fast Error Detection in Smart Grid

Smart grids bring advantages of reliabilty and high efficiency by real-time communication technologies in contrast to the traditional grids. However, smart grids also raise concerns about privacy and security for the individual fine-grained information collection. In order to guarantee privacy and securtiy in the grids, we propose an efficient and privacy-preserving multidimensional data aggregation scheme without a third trusted party and supporting fast error detection, named EPMDA-FED, in the paper. Firstly, we adopt Chinese Remainder Theorem to pack multidimensional data and encrypt the processed data using the keys generated by the negotiation among users and the control center. Secondly, our scheme is efficient for encryption without high-cost additive homomorphic public key encryption scheme, such as Paillier cryptosystem and supporting batch verification with fast error detection. Our proposed error detection algorithm is quite efficient with sublinear computation complexity. Besides, through security analysis, EPMDA-FED is semantically secure against collusion attack and the consistency of negotiated key, authenticity and data integrity of the users’ reports are guaranteed. Finally, performance evaluation shows EPMDA-FED is more efficient than existing competing approaches in terms of computation and communication overhead.

CPPA-D: Efficient Conditional Privacy-Preserving Authentication Scheme With Double-Insurance in VANETs

With the establishment of the intelligent transportation system (ITS), the vehicular ad hoc networks (VANETs) play a significant role for improving traffic safety and efficiency. In order to avoid malicious attack and resource abuse in VANETs, the use of digital signature scheme is widely regarded as the first line of defense to achieve a secure VANETs system. However, it is still a challenging task to design a conditional privacy preserving authentication scheme, to resolve security and privacy-preserving problems in VANETs and to improve the utilization ratio of information resources. In addition, the relevant researches show that the tamper-proof device (TPD) is vulnerable to side channel attacks. If the sensitive parameters stored in TPD are extracted, the system would be totally broken. To address these issues, this paper introduces a conditional privacy-preserving authentication scheme with double-insurance supporting batch verification (CPPA-D) for VANETs, which is constructed in cyclic groups on elliptic curves. Either the master private key or the vehicle private key is leaked, it is impossible to forge a valid authenticated message to deceive the recipients, which achieves double-insurance for private keys. When multiple messages are received, our CPPA-D scheme allows the receiver to perform batch verification to improve the efficiency. Security analysis shows that our CPPA-D scheme not only can resist traditional attacks but also can solve the security problems caused by private key stolen in the TPD under side channel attack. There is also a certain advantage in computation overhead according to efficiency analysis and comparison.

An efficient group signcryption scheme supporting batch verification for securing transmitted data in the Internet of Things

This paper presents a novel secure and privacy-preserving scheme for enhancing the security of transmitted data in an Internet of Things (IoT) environment. The proposed scheme combines a short group signature scheme with a signcryption method to represent an efficient short group signcryption (SGSC) technique with added security features. The proposed scheme supports aggregation and batch verification to eliminate the issue of increasing the computation delay from which the current IoT system suffers, particularly when the number of connected devices are increased. Detailed security analysis has shown that the proposed SGSC scheme is robust against many security and privacy threats in the IoT communication network, and can achieve more security features compared with currently available group signature schemes. The proposed scheme shows high efficiency in terms of computational cost in verifying a large number of messages within a short time frame.

Secure Metering Data Aggregation With Batch Verification in Industrial Smart Grid

Smart grid can greatly improve the efficiency, reliability, and sustainability of the traditional grids. In industrial smart grid, real-time user-side metering data may be frequently collected for monitoring and controlling electricity consumption. However, the procedure of frequently metering data collection may lead to sensitive information leakage. To address the security issues in industrial smart grid, in this article, we construct an efficient identity-based metering data aggregation scheme supporting batch verification by collector and electricity service provider, respectively, which guarantees the privacy and integrity of metering data. In our scheme, collectors are allowed to collect and aggregate the metering data of users in their respective administrative domain without compromising the confidentiality of metering data. Security analysis demonstrates that our proposed scheme is provably secure in the random oracle and satisfies the above security requirements. Performance analysis indicates that our scheme outperforms existing solutions in terms of communication and computation costs.

Identity-Based Batch Provable Data Possession with Detailed Analyses

In the era of big data, cloud storages become prevalent while security issues on outsourced data emerge. Without the physical control of the data owners, the outsourced data faces more risks. Provable Data Possession (PDP) is a probabilistic technique for checking whether data is correctly stored in remote servers without retrieving the entire data. For many previous PDP schemes, correctly choosing public keys for data owners relies on the security of Public Key Infrastructure (PKI), which is resource consuming. In this paper, we propose an Identity-Based Batch Provable Data Possession (ID-BPDP) scheme to eliminate the certificate management. Meanwhile, to the best of our knowledge, it is the first identity-based provable data possession scheme supporting batch verification for multiple owners and multiple clouds simultaneously to reduce computation cost greatly. We prove that our scheme is correct and secure based on bilinear pairings and the hardness assumption of Computational Diffie-Hellman problem, and also give detailed analyses to show that our scheme is able to verify the integrity of data efficiently.

Efficient extensible conditional privacy‐preserving authentication scheme supporting batch verification for VANETs

AbstractBy using pseudo‐identity‐based signature, a conditional privacy‐preserving authentication scheme was proposed in this paper, called EECB, to solve the anonymous authentication issue in vehicular ad hoc networks. In this scheme, pseudo‐identities and the corresponding private keys are generated by the private key generator alone, which is credible and independent. So only Adding private key generators can satisfy the increasing pseudo‐identities demand. In other words, it has achieved the extensible of the scheme. However, the malicious vehicle can only be traced by trust authority. Furthermore, the protocol supports batch verification and the operation of a signature verification only needs two bilinear pairings and some point multiplication. The security of the signature scheme in EECB can be proved to be equivalent to the standard computational Diffie–Hellman problem in the random oracle. The experiment and the analysis indicated that, compared with the existing well‐known schemes, EECB has higher authentication efficiency and less communication cost. Copyright © 2017 John Wiley & Sons, Ltd.

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.

Strongly Secure Certificateless Signature Scheme Supporting Batch Verification

We propose a strongly secure certificateless signature scheme supporting batch verification, which makes it possible for a verifier to verify a set of signatures more efficiently than verifying them one by one. In an identity-based digital signature scheme, private key generator (PKG) knows each user's signing key, so it can generate a signature which is indistinguishable from the signature generated by the user. This is a serious problem because the property of signature nonrepudiation will not be achieved. In our proposed scheme, it is impossible for PKG to produce a signature which is indistinguishable from any signature produced by a user. Compared with existing signature schemes with batch verification, although our proposed scheme is not the most efficient one, it achieves Girault's level-3 security, while the others have Girault's level-1 or level-2 security only. We also formally prove that the proposed scheme is unforgeable and satisfies Girault's level-3 security based on hard problems.