Location-based Services (LBS) Based On Privacy Protection Scheme

With the combination of Location-based services and novel application increasing, however, threats to personal privacy are ramping up, as witnessed by recent security incidents targeting privacy of individuals, revealed faulty data management practices, and unauthorized trading of users personal information. Location information is not immune from such threats and presents new dangers such as stalking or physical harassment.However, the existed location privacy protection program structure is relatively simple and less flexible, which is difficult to meet the needs of the user’s personalized privacy. Therefore, location based service (LBS) of the personalized privacy protection scheme has become a hot research topic at home and abroad.This article studies location privacy preferences and location privacy relevance of privacy protection plans of location-based services (LBS),and the validity of message anonymization algorithm and the Anonymous group search algorithm. And this thesis proposed an improved group anonymous algorithm. The main work of the paper is as follows:1.Studying the basic theory of privacy protection technology programs on location-based services (LBS), and the system architecture of locat ion-based services (LBS),and privacy threats of which.2. Studying foundational technology of location privacy protection of LBS. Positioning accuracy of LBS and quality of measurement are discussed in this paper.Studying some important definitions and terminology of personalized location k-anonymity privacy protection schemes.Studying impact on the quality of service and performance in personalized location k-anonymity privacy protection schemes.3.Studying fuzzy technology that bases on circle transform and then based on such technology the thesis proposed an improved double round fuzzy location privacy protection program.This paper proposed a simple and intuitive privacy preference to express user’s privacy requirements.The new scheme has abality to archive varying degrees of location privacy protect ion, and also estimate different degrees of location privacy quantitatively. Simulation experiments of the T-G (moving zoom) and E-T (shrink moving) may be used in the new program show that the new scheme is a good balance between high-quality information services and location privacy.4.Studying personalized location privacy protection scheme,this thesis presents an improved personalized k-anonymous location privacy protection plan based on user location privacy relevance. The new scheme uses a flexible privacy personalization framework to enhance the function of the location k-anonymity privacy protection.This thesis presents two new group anonymous algorithms based on the message anonymously engine algorithm. Then studying the validity of such algorithms under various conditions through using ture positon data. Simulation results show that the anonymous area produced by group anonymous algorithm is smaller than the message constraint area that specified by the tolerance value. Scheme that varing k values has increased by15percent in average anonymous success rate than scheme that fixed k values. The progressive search proposed in this paper can be linear expansion based on the value of tolerance, and the progressive search has a50percent improvement on a one-time search method. The personalized location k-anonymity model proposed in this paper, together with the location anonymization engine algorithm, which can achieve a more efficient location privacy protection, at the same time they have ability to ensure that they do not introduce any significant loss of performance.