Cluster Computing

, Volume 22, Supplement 6, pp 15127–15136 | Cite as

Distinct model on privacy protection of dynamic data publication

  • Xun-yi RenEmail author
  • Pan Zhang
  • Yu-qi Zhou


The M-Distinct is an excellent model that supports the anonymization of a fully dynamic set of data. This study aimed to explore and analyze the M-Distinct model. First of all, sensitive values in the QI-Group have certain randomness which caused the M-Distinct model prone to be property attacked. However, the (M, CUS)-Distinct model was proposed and required additional records in anonymity in the process. Therefore, its QI-Group-sensitive attribute value must belong to the same set of CUS to reduce the probability of property attacks. Secondly, the M-Distinct model involved time and cost. The proposed (M, CUS)-Distinct model creation phase generated disjoint barrel queues to ensure that each record could be stored in the record distribution phase, which reduced the time complexity of the algorithm. Finally, the experiment based on real data sets showed that the (M, CUS)-Distinct model was superior to the M-Distinct model in terms of data security, faked records processing, and execution time.


Dynamic data set Dynamic publishing M-Distinct model Privacy protecting Sensitivity-based group 


  1. 1.
    Sweeney, L.: Achieving k-anonymity privacy protection using generalization and suppression. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 10(5), 571–588 (2002)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Wong, R., Li, J., Fu, A.: (α, k)-Anonymity: an enhanced k-anonymity model for privacy preserving data publishing. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 754–759. ACM, Philadelphia (2006)Google Scholar
  3. 3.
    Wang, K., Fung, B.: Anonymizing sequential releases. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 414–423. ACM, New York (2006)Google Scholar
  4. 4.
    Byun, J.W., Sohn, Y., Bertino, E.: Secure anonymization for incremental datasets. In: Workshop on Secure Data Management, pp. 48–63. Springer, Berlin (2006)Google Scholar
  5. 5.
    Wu, Y., Ni, W., Zhang, B., Yan, L., Sun, Z.: k-APPRP: a partitioning based privacy preserving k-anonymous algorithm for republication of incremental datasets. J. Chin. Comput. Syst. 8, 1581–1587 (2009)Google Scholar
  6. 6.
    Xiao, X., Tao, Y.: M-invariance: towards privacy preserving re-publication of dynamic datasets. In: Proceedings of ACM SIGMOD Conference on Management of Data, pp. 689–700. ACM, New York (2007)Google Scholar
  7. 7.
    Bu, Y., Fu, C., Wong, W.: Privacy preserving serial data publishing by role composition. In: Proceedings of the VLDB Endowment, pp. 845–856. ACM, New York (2008)CrossRefGoogle Scholar
  8. 8.
    Joly, Y., Dyke, S., Knoppers, B.M.: Are data sharing and privacy protection mutually exclusive? Cell 167(5), 1150–1154 (2016)CrossRefGoogle Scholar
  9. 9.
    Chen, P., Su, J., Zhao, B.: An escrow-free online/offline HIBS scheme for privacy protection of people-centric sensing. Secur. Commun. Netw. 9(14), 2302–2312 (2016)CrossRefGoogle Scholar
  10. 10.
    Buccafurri, F., Fotia, L., Lax, G.: Analysis-preserving protection of user privacy against information leakage of social-network likes. Inf. Sci. 328(2), 340–358 (2016)CrossRefGoogle Scholar
  11. 11.
    Memon, I., Arain, A.: Dynamic path privacy protection framework for continuous query service over road networks. World Wide Web Internet Web Inf. Syst. 20(4), 639–672 (2017)CrossRefGoogle Scholar
  12. 12.
    Xiong, J., Li, F., Ma, J.: A full lifecycle privacy protection scheme for sensitive data in cloud computing. Peer-to-Peer Netw. Appl. 8(6), 1025–1037 (2015)CrossRefGoogle Scholar
  13. 13.
    Krontiris, I., Dimitriou, T.: A platform for privacy protection of data requesters and data providers in mobile sensing. Comput. Commun. 65(1), 43–54 (2015)CrossRefGoogle Scholar
  14. 14.
    Kalogridis, G., Sooriyabandara, M., Fan, Z.: Toward unified security and privacy protection for smart meter networks. IEEE Syst. J. 8(2), 641–654 (2014)CrossRefGoogle Scholar
  15. 15.
    Hwang, R.-H., Hsueh, Y.-L., Chung, H.-W.: A novel time-obfuscated algorithm for trajectory privacy protection. IEEE Trans. Serv. Comput. 7(2), 126–139 (2014)CrossRefGoogle Scholar
  16. 16.
    Wen, Y.D., Meikang, Q., Longfei, Q., Longbin, C., Ana, W.: Who moved my data? Privacy protection in smartphones. IEEE Commun. Mag. 55(1), 20–25 (2017)CrossRefGoogle Scholar
  17. 17.
    Zhang, Z., Qin, Z., Zhu, L., Weng, J., Ren, K.: Cost-friendly differential privacy for smart meters: exploiting the dual roles of the noise. IEEE Trans. Smart Grid. 8(2), 619–626 (2017)Google Scholar
  18. 18.
    Marta, B., Javier, G., Aythami, M., Julian, F.: Privacy-preserving comparison of variable-length data with application to biometric template protection. IEEE Access. 5, 8606–8619 (2017)CrossRefGoogle Scholar
  19. 19.
    Anna, R.: The necessity of the implementation of privacy by design in sectors where data protection concerns arise. Comput. Law Secur. Rev. 34(1), 99–110 (2018)CrossRefGoogle Scholar
  20. 20.
    Zulfiqar, A., Muhammad, I., Mansour, A., Tanveer, Z.: A zero-watermarking algorithm for privacy protection in biomedical signals. Futur. Gen. Comput. Syst. 82(5), 290–303 (2018)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.College of ComputerNanjing University of Posts and TelecommunicationsNanjingChina

Personalised recommendations