<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mi mathvariant="script">PLHAS</mml:mi></mml:math>: Privacy-preserving localized hybrid authentication scheme for large scale vehicular ad hoc networks

Altaf, Fahiem; Maity, Soumyadev

doi:10.1016/j.vehcom.2021.100347

Cited by 11 publications

(14 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Full aggregation was employed in this scheme to reduce computation and bandwidth resources. In 2021, Altaf et al [22] proposed a privacypreserving localized hybrid authentication protocol for largescale VANETs based on CL-PKC and PKI and showed that it is provably secure against type I and II adversaries in the SM. Ren et al [37] proposed a certificateless batch verification signature scheme based on blockchain for privacy protection of VANETs in 2021.…”

Section: Related Workmentioning

confidence: 99%

“…The results show that this scheme, and schemes [15], [20] satisfy all the security attributes, whereas the other schemes only satisfy some of the attributes. However, ROM has been used to prove security in schemes [9], [15], [18]- [22]. The schemes that are provably secure in ROM may be insecure in actual implementation.…”

Section: A Security Attributesmentioning

confidence: 99%

“…• T pa : The time for executing a point addition operation P 1 + P 2 of the bilinear pairing (P 1 , P 2 ∈ G 1 ). [22], the full computational cost in signature generation is T mtp +2T mul +T pa +T h ≈ 6.2428ms. The full computation overhead in single signature verification is 3T bp + 2T mtp + T mul + T pa + T h ≈ 51.8552ms.…”

Section: B Computation Overheadmentioning

confidence: 99%

“…We estimate the computation overhead of this scheme and several related CLAS schemes for VANETs [9], [15], [18]- [22] in Table 4 using a simple and visual method. The computation overhead of signing and verifying one message of the seven CLAS schemes is expressed in Fig.…”

Section: B Computation Overheadmentioning

confidence: 99%

“…To the best of our knowledg, this is the first conditional privacy-preserving CLAS scheme with verifiable security in the SM for VANETs. • Independent of map-to-point operations, the proposed CLAS scheme only requires two bilinear pair operations for aggregate verification, which has a lower computational overhead than previous related CLAS schemes [9], [15], [18]- [22]. Moreover, this scheme can achieve a rapid verification under an increase in the signatures, and can effectively reduce the communication overhead.…”

Section: Introductionmentioning

confidence: 97%

See 4 more Smart Citations

A Conditional Privacy-Preserving Certificateless Aggregate Signature Scheme in the Standard Model for VANETs

Wang

Zhang

et al. 2022

IEEE Access

View full text Add to dashboard Cite

Vehicular ad hoc networks (VANETs) are the communication foundation for future intelligent transportation systems and guarantee safe driving of intelligent networked vehicles. Moreover, VANETs face a series of security challenges related to the protection of vehicle privacy, authenticity of transmitted information, and bandwidth limitations. To resolve these contradictions, many certificateless aggregate signature (CLAS) schemes have been proposed. However, the majority of them can neither resist maliciousbut-passive key generation center attacks, replay attacks, and link attacks, nor track the actual identities of malicious vehicles. Meanwhile, the security of previous CLAS schemes in VANETs is only formally provided in the random oracle model (ROM), which might be insecure in actual implementation. In addition, most CLAS schemes still have problems of large verification delays and high communication overhead. To address the above-mentioned problems, a new conditional privacy-preserving CLAS scheme in VANETs is proposed, which adopts full aggregation technology to reduce computation and bandwidth resources. According to the formal security proofs under the computational Diffie-Hellman problem (CDHP) given in the standard model (SM), the security level of this scheme is higher than that of other CLAS schemes under ROM in practical applications. Additionally, the use of pseudonym mechanism realizes conditional privacy protection in VANETs. The performance analysis shows that this scheme has a higher efficiency in terms of computation and communication overhead compared with several previous CLAS schemes.INDEX TERMS Vehicular ad hoc networks (VANETs), conditional privacy preserving, certificateless aggregate signature (CLAS), full aggregation, standard model (SM).

show abstract

Section: Related Workmentioning

confidence: 99%