An efficient certificateless aggregate signature scheme for vehicular ad-hoc networks

Abstract

Distributed Computing and Networking International audience The state-of-the-art telecommunication technologies have widely been adapted for sensing the traffic related information and collection of it. Vehicular Ad-Hoc Networks (VANETs) have emerged as a novel technology for revolutionizing the driving experiences of human. The most effective and widely recognized way for mutual authentication among entities in VANETs is digital signature scheme. The new and attractive paradigm which eliminates the use of certificates in public key cryptography and solves the key escrow problem in identity based cryptography is certificateless cryptography. A new certificateless aggregate signature scheme is proposed in the paper for VANETs with constant pairing computations. Assuming the hardness of computational Diffie-Hellman Problem, the scheme is proved to be existentially unforgeable in the random oracle model against adaptive chosen-message attacks.

A Large-Scale Concurrent Data Anonymous Batch Verification Scheme for Mobile Healthcare Crowd Sensing

“…4 shows the comparison of computation cost between different schemes. And we also find that our scheme has lowest computation complexity than the other schemes [23], [24], [36], with the increasing of the number of participants. As a whole, our scheme achieve the best performance of the computation complexity.…”

“…Table II shows the complexity comparison between different schemes. We find that, in the signing stage, our scheme only requires nH + 2nS operations, while the schemes in [23], [24], [36] require 4nH + 3nS, nH + 4nS and nH + 3nS respectively. In the verification stage, our scheme needs 2nH + 2nP + nS operations, rather than 5nH + 4nP + 2nS in [23], 2nH + 3nP + 3nS in [24] and 2nH + 3nP + 2nS in [36].…”

“…We find that, in the signing stage, our scheme only requires nH + 2nS operations, while the schemes in [23], [24], [36] require 4nH + 3nS, nH + 4nS and nH + 3nS respectively. In the verification stage, our scheme needs 2nH + 2nP + nS operations, rather than 5nH + 4nP + 2nS in [23], 2nH + 3nP + 3nS in [24] and 2nH + 3nP + 2nS in [36]. In addition, in aggregation stage, only our scheme needs 2nS scalar multiplications, but it only requires two pairing operations in aggregate verification stage.…”

“…In addition, in aggregation stage, only our scheme needs 2nS scalar multiplications, but it only requires two pairing operations in aggregate verification stage. Hence, compared with the schemes in [23], [24], [36], our scheme has the least total computation overhead in all four stages -signing, verification, aggregation and aggregate verification.…”

“…We select three existing schemes [23], [24], [36] to compare the computation complexity with our scheme. Due to the computation overhead is mostly caused by three basic cryptographic operations, so we mainly focus on the time consumption of these operations.…”