Skip to main content
SpringerLink
Log in

A Global Optimal Model for Protecting Privacy

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Since Sweeney first proposed the k-anonymity algorithm to protect the security of published data, many researchers have proposed improved algorithms based on the framework of k-anonymity. However, the existing algorithms have not reached the optimal performance in anonymity. An effective anonymity algorithm should be able to solve a basic contradiction—optimal accuracy and security trade-off. To achieve the goal, this paper first develops a new quantitative criterion for the basic contradiction based on classical probability theory. Specifically, the criterion is used to measure the possibility that the individual might experience privacy disclosure and the degree of global security and global accuracy. Through this criterion, then we can derive an optimal division theory to obtain a certain global accuracy by the minimum global security loss. The experiment result shows that the performance of our new algorithm nearly reaches the optimal balance between accuracy and security.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

References

  1. Sweeney, L. (2002). k-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems,10(5), 557–570.

    Article  MathSciNet  Google Scholar 

  2. Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007). l-diversity: Privacy beyond k-anonymity. ACM Transactions on Knowledge Discovery from Data, 1 (1).

  3. Li, N., Li, T., & Venkatasubramanian, S. (2007). t-closeness: Privacy beyond k-anonymity and l-diversity. In; IEEE 23rd international conference on data engineering, pp. 106–115.

  4. Rubner, Y., Tomasi, C., & Guibas, L. J. (2000). The earth mover’s distance as a metric for image retrieval. International Journal of Computer Vision,40(2), 99–121.

    Article  Google Scholar 

  5. LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2005). Incognito: Efficient full-domain k-anonymity. In: ACM SIGMOD international conference on management of data 2005, pp. 49–60.

  6. Terrovitis, M., Mamoulis, N., & Kalnis, P. (2011). Local and global recoding methods for anonymizing set-valued data. VlDB Journal,20(1), 83–106.

    Article  Google Scholar 

  7. Cao, J., & Karras, P. (2012). Publishing microdata with a robust privacy guarantee. Proceedings of the VlDB Endowment,5(11), 1388–1399.

    Article  Google Scholar 

  8. Wong, R. C. W., Li, J. Y., Fu, A. W. C., & Wang, K. (2006). (α, k)-anonymity: an enhanced k-anonymity model for privacy-preserving data publishing. In: 12th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 754–759.

  9. Jiang, W., & Clifton, C. (2006). A secure distributed framework for achieving k-anonymity. The VLDB Journal,15(4), 316–333.

    Article  Google Scholar 

  10. Park, H., & Shim, K. (2007). Approximate algorithms for k-anonymity. In: ACM SIGMOD international conference on management of data, pp. 67–78.

  11. Nergiz, M. E., Clifton, C., & Nergiz, A. E. (2009). Multirelational k-anonymity. IEEE Transactions on Knowledge and Data Engineering,21(8), 1104–1117.

    Article  Google Scholar 

  12. Casas-Roma, J., Herrera-Joancomartí, J., & Torra, V. (2017). k-degree anonymity and edge selection: Improving data utility in large networks. Knowledge and Information Systems,50(2), 447–474.

    Article  Google Scholar 

  13. Kisilevich, S., Rokach, L., & Elovici, Y. (2010). Efficient multi-dimensional suppression for k-anonymity. IEEE transactions on knowledge and date engineering,22(3), 334–347.

    Article  Google Scholar 

  14. LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2006). Mondrian multidimensional k-anonymity. In: IEEE 22nd international conference on data engineering, pp. 25–36.

  15. Aggarwal, C. C. (2005). On k-anonymity and the curse of dimensionality. In: 31st international conference on Very large data bases, pp. 901–909.

  16. Liu, K. Liu, L. Guo, X. Li, & Fang, Y. (2013). A game-theoretic approach for achieving k-anonymity in location based service. In: INFOCOM, 2013 Proceedings IEEE, pp. 2985–2993.

  17. Niu, B., Li, Q., Zhu, X., Cao, G., & Li, H. (2014). Achieving k-anonymity in privacy-aware location-based services. In: INFOCOM, 2014 Proceedings IEEE, pp. 754–762.

  18. Andrews, M., Wilfong, G., & Zhang, L. (2015). Analysis of k-anonymity algorithms for streaming location data. In: IEEE Computer communications workshops, pp. 1–6.

  19. Gedik, B., & Liu, L. (2008). Protecting location privacy with personalized k-anonymity: Architecture and algorithms. IEEE Transactions on Mobile Computing,7(1), 1–18.

    Article  Google Scholar 

  20. Friedman, A., Wolff, R., & Schuster, A. (2008). Providing k-anonymity in data mining. The VLDB Journal,17(4), 789–804.

    Article  Google Scholar 

  21. Wang, K., Yu, P. S., & Chakraborty, S. (2004). Bottom-up generalization: A data mining solution to privacy protection. In: IEEE 4th international conference on data mining, pp. 249–256.

  22. Zhou, B., & Pei, J. (2011). The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacks. Knowledge and Information Systems,28(1), 47–77.

    Article  Google Scholar 

  23. Zhou, X., Liang, X., Zhang, H., & Ma, Y. (2015). Cross-platform identification of anonymous identical users in multiple social media networks. IEEE Transactions on Knowledge and Data Engineering,28(2), 411–424.

    Article  Google Scholar 

  24. Backes, M., Berrang, P., Goga, O., Gummadi, K. P., & Manoharan, P. (2016). On profile linkability despite anonymity in social media systems. In: Proceedings of the 2016 ACM on workshop on privacy in the electronic society, pp. 25–35.

  25. Nettleton, D. F., & Salas, J. (2016). A data driven anonymization system for information rich online social network graphs. Expert Systems with Applications,55, 87–105.

    Article  Google Scholar 

  26. Liu, Q., Wang, G., Li, F., Yang, S., & Wu, J. (2016). Preserving privacy with probabilistic indistinguishability in weighted social networks. IEEE Transactions on Parallel and Distributed Systems,28(5), 1417–1429.

    Article  Google Scholar 

  27. Chen, J., Wang, C., He, K., Zhao, Z., Chen, M., Du, R., & Ahn, G. (2019). Semantics-aware privacy risk assessment using self-learning weight assignment for mobile apps. IEEE Transactions on Dependable and Secure Computing.

  28. Chen, J., Wang, C., Zhao, Z., Chen, K., Du, R., & Ahn, G. (2018). Uncovering the face of android ransomware: Characterization and real-time detection. IEEE Transactions on Information Forensic & Security,13(5), 1286–1300.

    Article  Google Scholar 

  29. Chen, J., He, K., Yuan, Q., Xue, G., Du, R., & Wang, L. (2017). Batch identification game model for invalid signatures in wireless mobile networks. IEEE Transactions on Mobile Computing,16, 1530–1543.

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by the Fundamental Research Funds for the Central Universities (Grant No. CCNU19ZN008).

Author information

Authors and Affiliations

  1. School of Computer, Central China Normal University, Wuhan, 430079, China

    Xinyu Liang & Yajun Guo

  2. Trusted Computing and Information Assurance Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China

    Yimin Guo

Authors
  1. Xinyu Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yajun Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yimin Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yajun Guo.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liang, X., Guo, Y. & Guo, Y. A Global Optimal Model for Protecting Privacy. Wireless Pers Commun 112, 1451–1478 (2020). https://doi.org/10.1007/s11277-020-07110-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-020-07110-x

Keywords

Search

Navigation