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

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 po...

Full description

Saved in:
Bibliographic Details
Published inSoft computing (Berlin, Germany) Vol. 21; no. 14; pp. 3907 - 3917
Main Authors Li, Xinghua, Miao, Meixia, Liu, Hai, Ma, Jianfeng, Li, Kuan-Ching
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2017
Springer Nature B.V
Subjects
Approximation
Artificial Intelligence
Computational Intelligence
Control
Cybersecurity
Engineering
Fuzzy logic
Incentives
Localization
Location based services
Mathematical Logic and Foundations
Mechatronics
Methodologies and Application
Privacy
Reputations
Robotics
Soft computing
Third party
Trusted third parties
Fuzzy logic
Privacy protection
anonymity
Incentive mechanism
Location-based service
Distributed
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1432-7643
1433-7479
DOI:10.1007/s00500-016-2040-2