2016Tsinghua Science & TechnologyOpen access

An efficient Location Privacy Protection Scheme based on the Chinese Remainder Theorem

Jingjing Wang, Yiliang Han, Xiaoyuan Yang

Open full text 8 citations

Abstract

Traditional k-anonymity schemes cannot protect a user's privacy perfectly in big data and mobile network environments. In fact, existing k-anonymity schemes only protect location in datasets with small granularity. But in larger granularity datasets, a user's geographical region-location is always exposed in realizations of k-anonymity because of interaction with neighboring nodes. And if a user could not find enough adjacent access points, most existing schemes would be invalid. How to protect location information has become an important issue. But it has not attracted much attention. To solve this problem, two location-privacy protection models are proposed. Then a new generalized k-anonymity Location Privacy Protection Scheme based on the Chinese Remainder Theorem (LPSS-CRT) in Location-Based Services (LBSs) is proposed. We prove that it can guarantee that users can access LBSs without leaking their region-location information, which means the scheme can achieve perfect anonymity. Analysis shows that LPPS-CRT is more secure in protecting location privacy, including region information, and is more efficient, than similar schemes. It is suitable for dynamic environments for different users' privacy protection requests.

Open-access reader

About this research paper

What this paper is about

Traditional k-anonymity schemes cannot protect a user's privacy perfectly in big data and mobile network environments. In fact, existing k-anonymity schemes only protect location in datasets with small granularity. But in larger granularity datasets, a user's geographical region-location is always exposed in realizations of k-anonymity because of interaction with neighboring nodes. And if a user could not find enough adjacent access points, most existing schemes would be invalid. How to protect location information has become an important issue. But it has not attracted much attention. To solve this problem, two location-privacy protection models are proposed. Then a new generalized k-anonymity Location Privacy Protection Scheme based on the Chinese Remainder Theorem (LPSS-CRT) in Location-Based Services (LBSs) is proposed. We prove that it can guarantee that users can access LBSs without leaking their region-location information, which means the scheme can achieve perfect anonymity. Analysis shows that LPPS-CRT is more secure in protecting location privacy, including region information, and is more efficient, than similar schemes. It is suitable for dynamic environments for different users' privacy protection requests.

Why it matters

OpenAlex reports 8 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

Traditional k-anonymity schemes cannot protect a user's privacy perfectly in big data and mobile network environments. In fact, existing k-anonymity schemes only protect location in datasets with small granularity. But in larger granularity datasets, a user's geographical region-location is always exposed in realizations of k-anonymity because of interaction with neighboring nodes. And if a user could not find enough adjacent access points, most existing schemes would be invalid. How to protect location information has become an important issue. But it has not attracted much attention. To solve this problem, two location-privacy protection models are proposed. Then a new generalized k-anonymity Location Privacy Protection Scheme based on the Chinese Remainder Theorem (LPSS-CRT) in Location-Based Services (LBSs) is proposed. We prove that it can guarantee that users can access LBSs without leaking their region-location information, which means the scheme can achieve perfect anonymity. Analysis shows that LPPS-CRT is more secure in protecting location privacy, including region information, and is more efficient, than similar schemes. It is suitable for dynamic environments for different users' privacy protection requests.

Key concepts: Anonymity, k-anonymity, Computer science, Chinese remainder theorem, Granularity, Privacy protection, Scheme (mathematics), Location-based service

Related papers

Back to paper searchBrowse research topicsOriginal source
An efficient Location Privacy Protection Scheme based on the Chinese Remainder Theorem — Research Paper | ScholarLens