Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adar E, Huberman BA (2000) Free riding on Gnutella. First Monday 5(10):1–22
Ahmad MW, Ansari MA (2012) A survey: soft computing in intelligent information retrieval systems. In: Proceedings of the 12th International Conference on Computational Science and Its Applications, pp 783–796
Bamba B, Liu L, Pesti P, Wang T (2008) Supporting anonymous location queries in mobile environments with privacy grid. In: Proceedings of the 17th International Conference on World Wide Web, pp 237–246
Bernstein, Curve DJ (2006) New Diffie-Hellman speed records. In: Proceedings of the 9th International Conference on Theory and Practice in Public-Key Cryptography, pp 207–228
Chow CY, Mokbel MF, Aref WG (2009) Casper: query processing for location services without compromising privacy. ACM Trans Database Syst 34(4):1–24
Daniel J, Bernstein Niels D, Lange TJ (2012) High-speed high-security signatures. J Cryptogr Eng 2(2):77–89
Ficco M, Palmieri F, Castiglione A (2014) Hybrid indoor and outdoor location services for new generation mobile terminals. J Person Ubiquitiou Comput 18(2):271–285
Freudiger J, Shokri R, Hubaux J (2009) On the optimal placement of mix zones. In: Proceedings of the 9th International Symposium on Privacy Enhancing Technologies, pp 216–234
Gedik B, Liu L (2008) Protecting location privacy with personalized k-anonymity: architecture and algorithms. IEEE Trans Mobile Comput 7(1):1–18
Golle P, Leyton-Brown K, Mironov I (2001) Incentives for sharing in peer-to-peer networks. In: Proceedings of the 3rd ACM Conference on Electronic Commerce, pp 264–267
Gruteser M, Grunwal D (2003) Anonymous usage of location-based services through spatial and temporal cloaking. In: Proceedings of the 1st International Conference on Mobile Systems, Applications,and Services, pp 163–168
Hernandez J, Moreno MV, Jara AJ, Skarmeta AF (2014) A soft computing based location-aware access control for smart buildings. Soft Comput 18(9):1659–1674
Hu H, Chen Q, Xu J (2013) VERDICT: privacy-preserving authentication of range queries in location-based services. In: Proceedings of the 29th IEEE International Conference on Data Engineering, pp 1312–1315
Jung T, Li XY (2013) Search me if you can: privacy-preserving location query service. In: Proceedings of the 32nd IEEE International Conference on Computer Communications, pp 2760–2768
Kido H, Yanagisawa Y, Satoh T (2005) An anonymous communication technique using dummies for location-based services. Proc Int Conf Pervasive Serv 2005:88–97
Levin D, LaCurts K (2008) BitTorrent is an Auetion:Analyzing and Improving BitTorrent’s Incentives. In: Proeeedings of the ACM SIGCOMM 2008 Conference on Data Communication, pp 243–254
Lien IT, Lin YH, Shieh JR (2005) A novel privacy preserving location-based service protocol with secret circular shift for k-nn search. IEEE Trans Inf Forensics Secur 8(6):863–873
Metre PB, Radhika KR, Gowrishankar G (2012) Survey of soft computing techniques for joint radio resource management. In: Proceedings of 2012 International Conference on Multimedia Computing and System, pp 562–565
Paulet R, Kaosar MG, Yi X, Bertino E (2012) Privacy-preserving and content-protecting location based queries. In: Proceedings of the 28th IEEE International Conference on Data Engineering, pp 44–53
Tang F, Li J, You L, Guo M (2015) Long-term location privacy protection for location-based services in mobile cloud computing. J Soft Comput (published online)
Trawinski K, Alonso JK, Hernandez N (2013) A multiclassifier approach for topology-based wifi indoor localization. Soft Comput 17(10):1817–1831
Yang DJ, Fang X, Xue GL (2013) Truthful Incentive Mechanisms for K-Anonymity Location Privacy. In: Proceedings of the 32nd IEEE International Conference on Computer Communications, pp 783–796
Acknowledgments
Funding: This study was funded by the National Natural Science Foundation of China (Nos. 61372075, U1405255, 61472310, 61202389).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflicts of interest
The authors declare that they have no conflict of interest.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Li, X., Miao, M., Liu, H. et al. An incentive mechanism for K-anonymity in LBS privacy protection based on credit mechanism. Soft Comput 21, 3907–3917 (2017). https://doi.org/10.1007/s00500-016-2040-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-016-2040-2