Secure and Pairing-Free Identity-Based Batch Verification Scheme in Vehicle Ad-Hoc Networks

A Secure and Efficient Scheme with Batch-Verification for Vehicular Ad-Hoc Network

“…In addition, the vehicle privacy was protected by pseudo identity, while TA has the ability to trace the real identity of the message sender from pseudo identity. In addition, Lo et al [13], Liu et al [10], Hu et al [8], Xie et al [19] proposed an identity-based authentication scheme for VANET, respectively.…”

“…In this section, we compare our scheme to existing efficient VANET-based authentication schemes of [22], [12], [13], [8], [19] from the aspects of security, computation overhead, and bandwidth, respectively.…”

“…Schemes in [12] and [13] can not avoid replaying attack. Schemes in [8] and [19] always use master secret key to sign messages directly. Our proposed scheme satisfies all of the security issues.…”

“…We adopted the same items to Tzeng et al's [17] We compared our proposed scheme with the existing schemes proposed by Zhang et al's [22], Liu et al's [12], Lo et al's [13], Hu et al's [8] and Xie et al's [19]. From the data statistics in Table 2, [22]'s scheme needs 14.7 ms to verify a single message and needs (14.1+0.6n) ms to verify n messages.…”

“…[19]'s scheme needs 26.1 ms to verify a single message and needs nearly (23.7 + 2.4n) ms to verify n messages. [8]'s scheme needs 1.2 ms to verify a single message or n messages. Our proposed scheme needs 1.2 ms to verify a single message and needs (0.6+0.6n) ms to verify n messages.…”