An incentive mechanism for K-anonymity in LBS privacy protection based on credit mechanism

被引:62
作者
Li, Xinghua [1 ,2 ]
Miao, Meixia [1 ]
Liu, Hai [1 ]
Ma, Jianfeng [1 ]
Li, Kuan-Ching [3 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks, Xian, Shaanxi, Peoples R China
[2] Xidian Univ, Sch Cyber Engn, Xian, Shaanxi, Peoples R China
[3] Providence Univ, Dept Comp Sci & Informat Engn, Taichung, Taiwan
基金
中国国家自然科学基金;
关键词
Location-based service; Privacy protection; Fuzzy logic; Distributed K-anonymity; Incentive mechanism; LOCATION SERVICES;
D O I
10.1007/s00500-016-2040-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the location-based service (LBS) privacy protection, the most common and classic solution is K-anonymity, however, existing schemes rarely consider the issue that whether other mobile users are willing to provide assistance to the requesters to form the K-anonymity set, thus leading to their poor practicability. In this paper, an incentive mechanism based on credit is introduced into the distributed K-anonymity, and only providing assistance to the others, a user can gain and accumulate his credit. Based on the fuzzy logic in the soft computing, a probability threshold is introduced to reflect a user's reputation, and only when a user's reputation reaches this threshold, can he get the assistance from other neighbors. Security analysis shows that our scheme is secure with respect to various typical attacks. And because of not relying on a trusted third party, our scheme can avoid the security issue resulting from its breach. Extensive experiments indicate that the time to form the anonymity set is short and it increases slowly as the value of K increases. Finally, the additional traffic introduced by this scheme is very limited.
引用
收藏
页码:3907 / 3917
页数:11
相关论文
共 22 条
[1]  
Ahmad MW, 2012, P 12 INT C COMP SCI, P783
[2]  
[Anonymous], 2000, 1 MONDAY J INTERNET
[3]  
Bamba B., 2008, Proceeding of 17th International Conference on World Wide Web, P237, DOI DOI 10.1145/1367497.1367531
[4]  
Bernstein, 2006, P 9 INT C THEOR PRAC, P207
[5]   High-speed high-security signatures [J].
Bernstein, Daniel J. ;
Duif, Niels ;
Lange, Tanja ;
Schwabe, Peter ;
Yang, Bo-Yin .
JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2012, 2 (02) :77-89
[6]   Casper: Query Processing for Location Services without Compromising Privacy [J].
Chow, Chi-Yin ;
Mokbel, Mohamed F. ;
Aref, Walid G. .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2009, 34 (04)
[7]   Hybrid indoor and outdoor location services for new generation mobile terminals [J].
Ficco, Massimo ;
Palmieri, Francesco ;
Castiglione, Aniello .
PERSONAL AND UBIQUITOUS COMPUTING, 2014, 18 (02) :271-285
[8]  
Freudiger J, 2009, LECT NOTES COMPUT SC, V5672, P216, DOI 10.1007/978-3-642-03168-7_13
[9]   Protecting location privacy with personalized k-anonymity:: Architecture and algorithms [J].
Gedik, Bugra ;
Liu, Ling .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2008, 7 (01) :1-18
[10]  
Golle P., 2001, EC'01. Proceedings of the 3rd ACM Conference on Electronic Commerce, P264, DOI 10.1145/501158.501193