An identity-based security framework For VANETs
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Efficient and robust pseudonymous authentication in VANET
Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks
PPAA: peer-to-peer anonymous authentication
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
TSVC: timed efficient and secure vehicular communications with privacy preserving
IEEE Transactions on Wireless Communications - Part 1
Proof of concept of a security based on lifetime of communication's pseudonyms for the VANETs
Proceedings of the second ACM international symposium on Design and analysis of intelligent vehicular networks and applications
| Hi-index | 0.00 |
Intelligent Transportation Systems (ITS) have attracted many researchers that invested a lot of effort to develop many applications mainly for vehicular systems. Existing and investigated applications in vehicular systems are classified in two folds: safety applications and convenience applications. The first type of applications focuses mainly on drivers security and safety on the roads by providing warnings and alerts if there are accidents or disasters. The second type of applications helps drivers and passengers to localize services, get accurate weather or road condition information, get entertainment access, or even interact with surrounding services. Thus, a secure service discovery and communication protocol is mandatory in order to prevent from many attacks and malicious processes in the vehicular system. An efficient service discovery protocol should guarantee a secure discovery and communication in the vehicular system while maintaining the network scalability and a low communication delay. In this paper, we present the possible attacks that can happen at the discovery level and at the routing level. Then, we present our secure service discovery protocol for vehicular systems designed for the convenience type of applications. We prove the correctness of our proposed scheme and we compute its message complexity.