Design And Implementation Of Android Smartphone Location Privacy Protection Algorithm

With the rapid development of Android technology,the related industries have also got wide attention.One of the more typical industry is based on the location of the service.People use daily maps to locate,find bus routes,and use the nearest public bike to solve the last mile of work p,roblems and so on.However,people enjoy the fun of science and technology,at the same time,they face with the risk of personal information's disclosure potentially.On this issue,domestic and foreign scholars have given a number of privacy protection programs,such as data confusing,the protection of user movenment trajectory,false location and so on.Although these methods to a certain extent,can protect the user's privacy,there is also the risk of being attacked by the attacker.K-anonymous privacy protectional techno logy is a more mature privacy protectional technology.Since Gruteser M introduced K-anonymous to the location of privacy protection,K-anonymous technology has been the hot spots in the user's location privacy protection research.In order to reach location privacy,the researchers proposed location-based anonymous protection techniques based on hiding or based on generralization or other models,but the essence of these techniques is to collect large amounts of data to group the data.This caused a huge waste of system resources inevitably,even if there is a risk that the data can not be used if the data is small.In view of these problems,this paper presents the algorithm based on K-anonymous dynamic programming and got the implementation by the development of LSBHook APP on Android system.The result shows that LSBHook can realize the privacy protection for user's location well.The main contributions ofthis paper are as follows:1.Based on the generalization,this paper presents the K-DP dynamic privacy protection algorithm.K-DP algorithm can quickly and efficiently solve the anonymous K value according to the current latitude and longitude information of the user,and save a lot of system resources,compared with the previous group to collect large amounts of data and then realize K-anonymity.The data show that the anonymous success rate of the K-DP algorithm is close to or even 100%.At the same time,this paper presents the concept of minimum anonymous distance.When the user or the APP performs a continuous location query,the LSBHook will find the distance between the last location and the present location.If it is less than the minimum distance required for the anonymity,It will return the last anonymous data directly to avoid risks of location disclosure because of the continuous Location query?2.After solving the K value,in order to ensure the effectiveness of anonymity.LBSHook specifies the minimum and maximum anonymous areas.If the anonymous area is less than the minimum anonyniys area or it is greater than the maximum anonymous area,it will be re-anonymous.So that it can avoid the anonymous area is too small to be attacked or anonymous area is too large to lose practical value and other issues;An anonymous geographical location is returned to the user along with the geographic location of the user's physical location,which implements the geographic location ofthe K anonymity.