PROJECT TITLE :

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

ABSTRACT:

Vehicular ad hoc networks, also known as VANETs, are the communication foundation for future intelligent transportation systems. These networks ensure that intelligent networked vehicles can be driven safely. In addition, vehicle area networks (VANETs) are confronted with a number of security challenges, including the protection of vehicle privacy, the authenticity of information transmitted, and limitations on bandwidth. Many different certificateless aggregate signature (CLAS) schemes have been proposed as a potential solution to resolve these contradictions. On the other hand, the vast majority of them are unable to withstand attacks coming from malicious but passive key generation centers, replay attacks, and link attacks, and they also cannot track the actual identities of malicious vehicles. In the meantime, the safety provided by earlier CLAS schemes in VANETs is only guaranteed in a formal sense by the random oracle model (ROM), which may not be safe in practice. In addition, the majority of CLAS schemes continue to have issues with significant verification delays and significant communication overhead. In order to solve the issues that were discussed earlier, a new conditional privacy-preserving CLAS scheme in VANETs has been proposed. This scheme uses full aggregation technology to cut down on the amount of resources needed for computation and bandwidth. The formal security proofs that are given for the computational Diffie-Hellman problem (CDHP) in the standard model (SM) indicate that the security level of this scheme is higher than that of other CLAS schemes when used in practical applications. This is the case regardless of whether or not ROM is used. In addition, the utilization of pseudonym mechanisms allows for the realization of conditional privacy protection within VANETs. When compared to several of the CLAS schemes that came before it, the performance analysis demonstrates that this particular scheme is more effective in terms of the computation and communication overhead it requires.