Skip to main content
Log in

Data Privacy Preservation and Trade-off Balance Between Privacy and Utility Using Deep Adaptive Clustering and Elliptic Curve Digital Signature Algorithm

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The privacy and utility are treated as a major factor in influencing the role of data privacy preservation in cloud environments. There exists a trade-off between these two factors, where one factor should compromise its functionality over the other. It is hence necessary to maintain both utility and privacy for a data offloaded or accessed across cloud computing environment. In this paper, we develop a utility privacy model that established utility using Deep Adaptive Clustering (DAC) and privacy using Elliptic Curve Digital Signature Algorithm (ECDSA). The utility is performed using clustering of the input datasets using DAC and the privacy is maintained using ECDSA. The simulation is conducted on specific datasets to test the efficacy of the model and the results shows improved accuracy on clustering, and efficient privacy metrics than existing methods.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

Availability of Data and Material

The data that support the findings of this study are available from the corresponding author, upon reasonable request.

Code Availability

The code that is used this study are available from the corresponding author, upon reasonable request.

References

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

    Article  MathSciNet  Google Scholar 

  2. Lin, W. Y., Yang, D. C., & Wang, J. T. (2016). Privacy preserving data anonymization of spontaneous ADE reporting system dataset. BMC Medical Informatics and Decision Making, 16(1), 58.

    Article  Google Scholar 

  3. Soria-Comas, J., Domingo-Ferrer, J., Sánchez, D., & Martinez, S. (2015). t-closeness through microaggregation: Strict privacy with enhanced utility preservation. IEEE Transactions on Knowledge and Data Engineering, 27(11), 3098–3110.

    Article  Google Scholar 

  4. Mivule, K., Turner, C., & Ji, S. Y. (2012). Towards a differential privacy and utility preserving deep learning classifier. Procedia Computer Science, 12, 176–181.

    Article  Google Scholar 

  5. Wong, R. C. W., Fu, A. W. C., Wang, K., & Pei, J. (2007). Minimality attack in privacy preserving data publishing. In Proceedings of the 33rd international conference on Very large data bases. VLDB Endowment, (pp. 543–554).

  6. Chen, K., & Liu, L. (2009). Privacy-preserving multiparty collaborative mining with geometric data perturbation. IEEE Transactions on Parallel and Distributed Systems, 20(12), 1764–1776.

    Article  Google Scholar 

  7. Polato, I., Ré, R., Goldman, A., & Kon, F. (2014). A comprehensive view of Hadoop research—A systematic literature review. Journal of Network and Computer Applications, 46, 1–25.

    Article  Google Scholar 

  8. Asikis, T., & Pournaras, E. (2017). Optimization of privacy-utility trade-offs under informational self-determination. arXiv preprint arXiv:1710.03186

  9. Joy, J., Gray, D., McGoldrick, C., & Gerla, M. (2018). K privacy: Towards improving privacy strength while preserving utility. Ad Hoc Networks.

  10. Valdez, A. C., & Ziefle, M. (2018). The users’ perspective on the privacy-utility trade-offs in health recommender systems. International Journal of Human-Computer Studies.

  11. Majeed, A. (2018). Attribute-centric anonymization scheme for improving user privacy and utility of publishing e-health data. Journal of King Saud University-Computer and Information Sciences.

  12. Lin, J. C. W., Gan, W., Fournier-Viger, P., Yang, L., Liu, Q., Frnda, J., & Voznak, M. (2016). High utility-itemset mining and privacy-preserving utility mining. Perspectives in Science, 7, 74–80.

    Article  Google Scholar 

  13. Lin, J. C. W., Wu, T. Y., Fournier-Viger, P., Lin, G., Zhan, J., & Voznak, M. (2016). Fast algorithms for hiding sensitive high-utility itemsets in privacy-preserving utility mining. Engineering Applications of Artificial Intelligence, 55, 269–284.

    Article  Google Scholar 

  14. Yun, U., & Kim, J. (2015). A fast perturbation algorithm using tree structure for privacy preserving utility mining. Expert Systems with Applications, 42(3), 1149–1165.

    Article  Google Scholar 

  15. Fu, A. W. C., Wang, K., Wong, R. C. W., Wang, J., & Jiang, M. (2014). Small sum privacy and large sum utility in data publishing. Journal of biomedical informatics, 50, 20–31.

    Article  Google Scholar 

  16. Mivule, K., & Turner, C. (2013). A comparative analysis of data privacy and utility parameter adjustment, using deep learning classification as a gauge. Procedia Computer Science, 20, 414–419.

    Article  Google Scholar 

  17. Yeh, J. S., & Hsu, P. C. (2010). HHUIF and MSICF: Novel algorithms for privacy preserving utility mining. Expert Systems with Applications, 37(7), 4779–4786.

    Article  Google Scholar 

  18. Rodriguez-Garcia, M., Batet, M., & Sánchez, D. (2019). Utility-preserving privacy protection of nominal data sets via semantic rank swapping. Information Fusion, 45, 282–295.

    Article  Google Scholar 

  19. Gao, S., Ma, J., Sun, C., & Li, X. (2014). Balancing trajectory privacy and data utility using a personalized anonymization model. Journal of Network and Computer Applications, 38, 125–134.

    Article  Google Scholar 

  20. Kao, Y., & Cheng, K. (2006). An DAC-based clustering algorithm. In International Workshop on Deep Adaptive clustering and Swarm Intelligence. Springer, Berlin, Heidelberg, (pp. 340–347).

  21. Lichman, M. (2013). UCI deep learning repository, 2013. http://archive.ics.uci.edu/ml. Accessed 28 Aug 2018.

  22. Sweeney, L. (1998). Datafly: A system for providing anonymity in medical data. In Database Security XI. Springer, Boston, MA, (pp. 356–381).

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

  24. LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2006). Mondrian multidimensional k-anonymity. In Data Engineering, 2006. ICDE’06. Proceedings of the 22nd International Conference on Data Engineering (pp. 25–25). IEEE.

Download references

Funding

The author(s) received no financial support for the research, authorship, and/or publication of this article.

Author information

Authors and Affiliations

Authors

Contributions

Conceptualization: NY; Methodology: KP; Formal analysis and investigation: TK; Writing—original draft preparation: KP, TK; Writing—review and editing: KP, TK.

Corresponding author

Correspondence to N. Yuvaraj.

Ethics declarations

Conflict of interest

The author(s) have no conflicts of interest to declare.

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

Yuvaraj, N., Praghash, K. & Karthikeyan, T. Data Privacy Preservation and Trade-off Balance Between Privacy and Utility Using Deep Adaptive Clustering and Elliptic Curve Digital Signature Algorithm. Wireless Pers Commun 124, 655–670 (2022). https://doi.org/10.1007/s11277-021-09376-1

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-021-09376-1

Keywords

Navigation