could verify the correctness of by checking whether is equal to . If it holds, keeps for the subsequent service request. Otherwise, will drop it and stop this session. 2.2 Access Service Phase Step 1: : < , > When a legal vehicle wants to access the desired services from its neighboring road- side unit , will send a service request message with to , where is the identification of the desired services and , where is a random integer in . Step 2: : <, { , }> Upon receiving , decrypts it by his own private key to ob- tain ( , , ). Next, computes to extract the access credential , which is authorized by . Then, examines whether and are included in and checks the validity of the authorized credential by . If the ver- ification holds, is legal and is granted to access the desired services from . Other- wise, the access request is denied and ter- minates this session. After is verified, selects a ran- dom integer in , calculates and generates a temporary session key as = ( , , ) for protecting the later communication. Finally, sends < , { , }> to . Step 3: : < { }, > After receiving < , { , }>, calculates a tempo- rary session key as = ( , , ) and reveals ( , ) using to check the validity of . If it is valid, is success- fully authenticated. Otherwise, ceases this connection. Then, generates an encrypted by as = ( , , ) and calculates the message authentication code as = ( , { }). Finally, transmits < { }, > to . Step4: Upon receiving < { }, >, verifies to ensure the integrity, and computes = ( , , ) to decrypt { }. If could recog- nize , it is implied that indeed holds the corresponding . Finally, the later communications can be encrypted by the session key as = ( , , ) where , , …. 3. Attack to Yeh et al.’s protocol In a conventional access control scheme, SPs are usually responsible for determining the validity of the access requests. To get rid of the communication between SPs and RSUs, Yeh et al. [9] presented an access control method to store a portable service right list ( ) in a portable authorized credential carried by the vehicle, instead of keeping the SRLs in the SPs. In order to assure the validity and privacy of an SRL, Yeh et al. also proposed an attachable blind signature. Based on the attachable blind signature, vehicles cannot tamper the SRL. Therefore, PAACP can prevent privilege eleva- tion attacks [3]. However, we will show that the malicious vehicles can forge the SRL. Any two or more vehicles can conspire to elevate the access privi- leges. We call this problem as privilege eleva- tion attack by collusion. In this attack, the mali- cious vehicles cooperate to request other differ- entiated access privileges of un-purchased ser- vices. We explain the details of this attack as follows. For example, we assume that a service provider provides 8 Internet services and the travel guide is the 6th service with three differ- ent access privileges: viewing maps, download- ing coupons and watching videos, then and for . Assume that the vehicles and purchase the same services, access privileges and term of service. For example, and purchase the travel guide services with the access privilege of viewing maps, then their service right lists are and , respectively [3]. The service right lists will be signed by as part of an authorized credential. The malicious vehicles Vx and Vy collabo- ratively intend to launch the privilege elevation attack by collusion. They want to elevate the travel guide service with the access privileges such as downloading coupons and watching videos that are not granted by an . They forge