An Efficient Pairing-free Batch Verification Scheme for VANET

Abstract An intelligent traffic system, which can flexibly allocate traffic resources, serves as a good assistant to help us improve traffic safety and efficiency of controlling traffic volume, providing instant traffic information and giving priority to ambulances. Although such system is powerful, it could be misused without prop er protection. For example, malicious drivers might forge the message of the ambulance so that they can quickly pass through intersections. In addition, because traffic information is huge and needs to be processed immediately, traditional schemes that pro cess the information one by one are not competent. For this issue, a lot of batch schemes have been proposed. Most of them adopt the algorithm of Bilinear pairing while the others tries to avoid it since pairing operations are complex. However, such pairin g - free schemes are not applicable because their calculation time will explode when there are more data waiting to be processed. In this article, we briefly describe those schemes and propose a more effective one to solve the problems mentioned above.