2015Xinxi wangluo anquanRequires access

Research on Location Anonymity Method Based on Continuous Location Services Requests

WU Yan-n

Open publisher page 1 citations

Abstract

With the vigorous development of the wireless technology and mobile localization technology, a new research field, location-based service(LBS), is opened up. When users are enjoying this kind of service, they will have to send their precise position information to service providers. In other words, they may face the risk of location privacies let out. Location k- anonymity is one of the most common location privacy protection technologies, which achieves the purpose of privacy protection by generalizing the user's precise position information to be an area with k-anonymity nature. But when the moving user keeps delivering queries of location-based service, the attacker can infer the user's privacy information according to the user's history requests. Thus the traditional isolated k- anonymity model is failed. On the premise of meeting the user's prescribed anonymous degree requirement, this paper puts forward an optimized k-anonymity model, which can use the user's historical position information in the active region to look for k-1 users who appear most frequently and have the densest position distribution to constitute the common anonymities set. The experimental result shows that the method can effectively reduce the area of the common anonymous region on the premise of guaranteeing the user's prescribed anonymous degree.

About this research paper

What this paper is about

With the vigorous development of the wireless technology and mobile localization technology, a new research field, location-based service(LBS), is opened up. When users are enjoying this kind of service, they will have to send their precise position information to service providers. In other words, they may face the risk of location privacies let out. Location k- anonymity is one of the most common location privacy protection technologies, which achieves the purpose of privacy protection by generalizing the user's precise position information to be an area with k-anonymity nature. But when the moving user keeps delivering queries of location-based service, the attacker can infer the user's privacy information according to the user's history requests. Thus the traditional isolated k- anonymity model is failed. On the premise of meeting the user's prescribed anonymous degree requirement, this paper puts forward an optimized k-anonymity model, which can use the user's historical position information in the active region to look for k-1 users who appear most frequently and have the densest position distribution to constitute the common anonymities set. The experimental result shows that the method can effectively reduce the area of the common anonymous region on the premise of guaranteeing the user's prescribed anonymous degree.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

With the vigorous development of the wireless technology and mobile localization technology, a new research field, location-based service(LBS), is opened up. When users are enjoying this kind of service, they will have to send their precise position information to service providers. In other words, they may face the risk of location privacies let out. Location k- anonymity is one of the most common location privacy protection technologies, which achieves the purpose of privacy protection by generalizing the user's precise position information to be an area with k-anonymity nature. But when the moving user keeps delivering queries of location-based service, the attacker can infer the user's privacy information according to the user's history requests. Thus the traditional isolated k- anonymity model is failed. On the premise of meeting the user's prescribed anonymous degree requirement, this paper puts forward an optimized k-anonymity model, which can use the user's historical position information in the active region to look for k-1 users who appear most frequently and have the densest position distribution to constitute the common anonymities set. The experimental result shows that the method can effectively reduce the area of the common anonymous region on the premise of guaranteeing the user's prescribed anonymous degree.

Key concepts: Anonymity, Computer science, Premise, Location-based service, k-anonymity, Service provider, Computer security, Position (finance)

Related papers

Back to paper searchBrowse research topicsOriginal source
Research on Location Anonymity Method Based on Continuous Location Services Requests — Research Paper | ScholarLens