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).
We improve Wu and Wang’s method for finding impossible differentials of block cipher structures. This improvement is more general than Wu and Wang’s method where it can find more impossible differentials with less time. We apply it on Gen-CAST256, Misty, Gen-Skipjack, Four-Cell, Gen-MARS, SMS4, MIBS, Camellia⁎, LBlock, E2, and SNAKE block ciphers. All impossible differentials discovered by the algorithm are the same as Wu’s method. Besides, for the 8-round MIBS block cipher, we find 4 new impossible differentials, which are not listed in Wu and Wang’s results. The experiment results show that the improved algorithm can not only find more impossible differentials, but also largely reduce the search time.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.