An Efficient Location Privacy Protection Scheme Based on the Chinese Remainder Theorem  

作　　者：Jingjing Wang Yiliang Han Xiaoyuan Yang 

机构地区：[1]Department of Electronic Technology, the Key Laboratory of Network & Information Security of Armed Police Force, Engineering University of Armed Police Force

出　　处：《Tsinghua Science and Technology》2016年第3期260-269,共10页清华大学学报（自然科学版（英文版）

基　　金：supported in part by the National Natural Science Foundation of China (Nos.61272492 and 61572521);the Shaanxi Province Natural Science Foundation of China (No.2015JM6353);the Basic Foundation of Engineering University of CAPF (No.WJY201521)

摘　　要：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.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.

关 键 词：location privacy protection generalized k-anonymity location-based services the Chinese remaindertheorem 

分 类 号：TP309[自动化与计算机技术—计算机系统结构] TP308[自动化与计算机技术—计算机科学与技术]