Research On Protection Of Position Privacy In ITS LBS

With the maturity of information technology, the development of the whole society is being muchmore intelligent. Intelligent Transportation System is one of the important marks to measure thesociety’s intelligent levels. As the key basis of Intelligent Transportation System., the location-basedservices are widely used in the vast crowd. However, this new kind of service brings many newsecurity problems, especially position privacy. This paper studies on the technology used for positionprivacy protection in the LBS Intelligent Transportation System., and realizes the fully protection forusers’ position privacy.According to the demand of position-privacy protection in LBS, the paper proposes a newalgorithm called Not Fully-Credible Users-Cooperation for Security Cloaking algorithm based on APeer-to-Peer Spatial Cloaking Algorithm. This Algorithm introduces digital signature, made the usesauthenticate others’ identities before they start communicating. Besides, they send their sensitiveinformation in cryptographic way, such as their accurate position, and the speed, so that they can protecttheir position privacy from being known by some attackers when the other uses are not credible. At thesame time, the algorithm adds a parameter called the maximum time that uses can tolerate for waiting.When the user who wants to ask for LBS fails to find other k-1nodes, according to the parameter, thedevice will wait for a period of time to send messages and discovery other nodes again. Thanks to thisparameter, the possibility of the users who request LBS can meet the requirement of finding other k-1nodes is increased, and users can successfully finish cloaking more probably. At last, the experimentshows that this algorithm has better security and success rate.Considering the practical requirements of LBS in ITS, the paper puts forward a new algorithmwith the name of A Oneself-Cloaking Users Cooperation Cloaking with Personalized k. The algorithmfirst decides which cloaking algorithm to use according to the users claim for privacy protection. Someusers focus on the quality of service, and some focus on privacy protection. With the judge, thealgorithm can meet their different demands. To effectively protect the position privacy of the users whotake part in the cloaking, the mechanism of cloaking oneself first is introduced. When the parameter ofk is too large to find enough nodes around the user, in order to have high success rate, the algorithm usesdummies as supplements to meet the requirements in consideration of the number of the nodes that havebeen found. Besides, the algorithm uses the distribution center of the nodes instead of a cloaking area,because the anchor is closer to the true position than the area. In this way, the device can calculate the real result from the candidate set more easily and more quickly. The experiment on a set of simulationdata shows that this algorithm can protect users’ position privacy more securely and more effectively.