Skip to main content
SpringerLink
Log in
Book cover

Internet Conference of China

ICoC 2014: Frontiers in Internet Technologies pp 46–55Cite as

A Personalized k-Anonymity with Fake Position Generation for Location Privacy Protection

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 502))

Abstract

Privacy protection has become one of the important issues for location-based services (LBS) nowadays. In order to meet the requirements of humanization, security and quick response, this paper proposes an improved personalized k-anonymous location privacy protection algorithm with fake position generation mechanism. Compared to the normal personalized k-anonymity algorithm, our improved algorithm has higher success rate of anonymity. By generating fake queries for the source queries that expire, our algorithm guarantees that no source query will be dropped, namely all the source queries can get anonymized. The experimental results show that the algorithm proposed by this paper is able to achieve better performance in terms of success rate of anonymity.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Reference

  1. Foursquare. https://foursquare.com/. Accessed April 2014

  2. Google Latitude. https://www.google.com/latitude/. Accessed April 2014

  3. Where, http://where.com. Accessed April 2014

  4. Gedik, B., Liu, L.: Protecting location privacy with personalized k-anonymity: architecture and algorithms, IEEE Trans. Mob. Comput. 7(1), 1–18, (2008)

    Google Scholar 

  5. Xiao, P., Zhen, X., Xiaofeng, M.: Survey of location privacy preserving. J. Comput. Sci. Front. 1(3), 268–281 (2007)

    Google Scholar 

  6. Xiao, Z., Meng, X., Xu, J.: Quality Aware Privacy Protection for Location—Based Services, pp. 434–446. Springer, Heidelberg (2007)

    Google Scholar 

  7. Kido, H., Yanagisawa, Y., Satoh, T.: An anonymous communication technique using dummies for location based services. In: IEEE International Conference on Pervasive Services, pp. 88–97 (2005)

    Google Scholar 

  8. Jang, M.Y., Jang, S.J., Chang, J.W.: A New KNN query processing algorithm enhancing privacy protection in location based services. In: IEEE First International Conference on Mobile Services, pp. 17–24 (2012)

    Google Scholar 

  9. Kalnis, P., Ghinita, G., Mouratidis, K., et al.: Preventing location based identify inference in anonymous spatial queries. IEEE Trans. Knowl. Data Eng. 19(12), 1719–1733 (2007)

    Article  Google Scholar 

  10. Samarati, P., Sweeney L.: Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. In: Proceedings of IEEE Symposium on Research in Security and Privacy (1998)

    Google Scholar 

  11. Sweeney, L.: k-anonymity: a model for protecting privacy. IJUFKS, 10(5), 557–570 (2002)

    MATH  MathSciNet  Google Scholar 

  12. Gruteser, M., Grunwald, D.: Anonymous usage of location based services through spatial and temporal cloaking. In: ACM/USENIX MobiSys (2003)

    Google Scholar 

  13. Kang, H.: The research and implementation of personalized k-anonymous location privacy protection technology based on the internet of things. J. Nanjing Univ. Posts Telecommun. (Natural Science Edition) TP393.08, 28(6), 78–82 (2012)

    Google Scholar 

  14. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: R±Tree: an efficient and robust access method for points and rectangles. In: Proceeding of ACM International Conference Management of Data (Sigmod 1990), pp. 322–331 (1990)

    Google Scholar 

  15. Interval Tree. http://en.wikipedia.org/wiki/Interval_tree. Accessed April 2014.

Download references

Acknowledgement

The paper is sponsored by Beijing Higher Education Young Elite Teacher Project, DNSLAB, the China’s Next Generation Internet Project(CNGI Project)(CNGI-12-03-009) and National High Technology Research and Development Program of China (2013AA014702).

Author information

Authors and Affiliations

  1. Institute of Network Technology, Beijing University of Posts and Telecommunications, Beijing, China

    Zhi Luo & Xiaohong Huang

Authors
  1. Zhi Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaohong Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaohong Huang .

Editor information

Editors and Affiliations

  1. Fudan University, Shanghai, China

    Shiyong Zhang

  2. Department of Computer Science, Tsinghua University, Beijing, China

    Ke Xu

  3. Tsinghua University, Beijing, China

    Mingwei Xu

  4. Fudan University, Shanghai, China

    Jie Wu

  5. Fudan University, Shanghai, China

    Chengrong Wu

  6. Fudan University, Shanghai, China

    Yiping Zhong

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luo, Z., Huang, X. (2015). A Personalized k-Anonymity with Fake Position Generation for Location Privacy Protection. In: Zhang, S., Xu, K., Xu, M., Wu, J., Wu, C., Zhong, Y. (eds) Frontiers in Internet Technologies. ICoC 2014. Communications in Computer and Information Science, vol 502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46826-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-46826-5_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-46825-8

  • Online ISBN: 978-3-662-46826-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation