Exploring Privacy-Preserving Strategies: A Comprehensive Analysis of Group-Based Anonymization and Hybrid ECC Encryption Algorithm for Effective Performance Evaluation in Data Security

Authors

  • Anup Maurya Ph.D. Scholar, Pacific University, Udaipur Rajasthan, India
  • Manuj Joshi Associate Professor, Pacific University, Udaipur Rajasthan, India.

Keywords:

Privacy Preserving, Data Security, Anonymization, Cryptography

Abstract

As data security continues to change quickly, protecting privacy has become more important than ever. This paper explores privacy-preserving tactics and provides a thorough examination of two essential methods: Encryption Algorithm for Hybrid Elliptic Curve Cryptography (ECC) with Group-Based Anonymization. Presenting a useful framework for data security performance evaluation is the main objective. Group-Based Anonymization preserves anonymity while retaining data utility by grouping individuals together under the tenet of collective identity preservation. The programme uses an advanced grouping technique to provide the best possible trade-off between data usability and privacy protection. The paper focus on strong cryptographic solution that combines the advantages of symmetric and asymmetric encryption is the Hybrid ECC Encryption Algorithm. This hybrid solution solves the computational issues related to conventional ECC methods while simultaneously improving data transfer security. Important parameters including attack resistance, communication overhead, and computational efficiency are included in the performance evaluation. The paper aims to provide insights into the advantages and disadvantages of each technique by carefully examining these factors. This study adds to the current conversation about privacy and data security by offering a sophisticated insight into the complex interactions between hybrid ECC encryption and group-based anonymization. Adopting such extensive privacy-preserving methods becomes essential for protecting sensitive information in numerous fields, as data remains a crucial asset in the digital world.

Downloads

Download data is not yet available.

References

R. C. W. Wong, J. Li, A. W. C. Fu, and K. Wang, “(α, k)-anonymity: An enhanced k-anonymity model for privacy-preserving data publishing,” Proc. ACM SIGKDD Int. Conf. Knowl. Discov. Data Min., vol. 2006, pp. 754–759, 2006,doi: 10.1145/1150402.1150499

K. LeFevre, D. J. DeWitt, and R. Ramakrishnan, “Mondrian multidimensional K-anonymity,” Proc. -Int. Conf. Data Eng., vol. 2006, p. 25, 2006, doi: 10.1109/ICDE.2006.101

A. Friedman, R. Wolff, and A. Schuster, “Providing k-anonymity in data mining,” VLDB J., vol. 17, no. 4, pp. 789–804, 2008, doi: 10.1007/s00778-006-0039-5

L. Zhang, J. Xuan, R. Si, and R. Wang, “An Improved Algorithm of Individuation K-Anonymity for Multiple Sensitive Attributes,” Wirel. Pers. Commun., vol. 95, no. 3, pp. 2003–2020, 2017, doi: 10.1007/s11277-016-3922-4

C. Ling, W. Zhang, and H. He, “K-anonymity privacy-preserving algorithm for IoT applications in virtualization and edge computing,” Cluster Comput., vol. 4, 2022, doi: 10.1007/s10586-022-03755-4

B. Sowmiya and E. Poovammal, “A Heuristic K-Anonymity Based Privacy Preserving for Student Management Hyperledger Fabric blockchain,” Wirel. Pers. Commun., vol. 127, no. 2, pp. 1359–1376, 2021, doi: 10.1007/s11277-021-08582-1.

D. Slijepčević, M. Henzl, L. Daniel Klausner, T. Dam, P. Kieseberg, and M. Zeppelzauer, “k-Anonymity in practice: How generalisation and suppression affect machine learning classifiers,” Comput. Secur., vol. 111, 2021, doi: 10.1016/j.cose.2021.102488

W. Almuseelem, "Energy-Efficient and Security-Aware Task Offloading for Multi-Tier Edge-Cloud Computing Systems," in IEEE Access, vol. 11, pp. 66428-66439, 2023, doi: 10.1109/ACCESS.2023.3290139.

E. T. Oladipupo et al., "An Efficient Authenticated Elliptic Curve Cryptography Scheme for Multicore Wireless Sensor Networks," in IEEE Access, vol. 11, pp. 1306-1323, 2023, doi: 10.1109/ACCESS.2022.3233632.

A. Ali Pour et al., "Helper Data Masking for Physically Unclonable Function-Based Key Generation Algorithms," in IEEE Access, vol. 10, pp. 40150-40164, 2022, doi: 10.1109/ACCESS.2022.3165284.

W. Mahanan, W. A. Chaovalitwongse, and J. Natwichai, “Data privacy preservation algorithm with k-anonymity,” World Wide Web, vol. 24, no. 5, pp. 1551–1561, 2021, doi: 10.1007/s11280-021-00922-2

Y. T. Tsou et al., “(k, ε, δ)-Anonymization: privacy-preserving data release based on k-anonymity and differential privacy,” Serv. Oriented Comput. Appl., vol. 15, no. 3, pp. 175–185, 2021, doi: 10.1007/s11761-021-00324-2.

Y. C. Tsai, S. L. Wang, I. H. Ting, and T. P. Hong, “Flexible sensitive K-anonymization on transactions,” World Wide Web, vol. 23, no. 4, pp. 2391–2406, 2020, doi: 10.1007/s11280-020-00798-8.

W. Mahanan, W. A. Chaovalitwongse, and J. Natwichai, “Data anonymization: a novel optimal k-anonymity algorithm for identical generalization hierarchy data in IoT,” Serv. Oriented Comput. Appl., vol. 14, no. 2, pp. 89–100, 2020, doi: 10.1007/s11761-020-00287-w.

P. Parida, C. Pradhan, X. -Z. Gao, D. S. Roy and R. K. Barik, "Image Encryption and Authentication With Elliptic Curve Cryptography and Multidimensional Chaotic Maps," in IEEE Access, vol. 9, pp. 76191-76204, 2021, doi: 10.1109/ACCESS.2021.3072075.

J. Wang and M. P. Kwan, “Daily activity locations k-anonymity for the evaluation of disclosure risk of individual GPS datasets,” Int. J. Health Geogr., vol. 19, no. 1, pp. 1–14, 2020, doi: 10.1186/s12942-020-00201-9.

K. Arava and S. Lingamgunta, “Adaptive k-Anonymity Approach for Privacy Preserving in Cloud,” Arab. J. Sci. Eng., vol. 45, no. 4, pp. 2425–2432, 2020, doi: 10.1007/s13369-019-03999-0

Y. Vural and M. Aydos, "A New Approach to Utility-Based Privacy Preserving in Data Publishing," 2017 IEEE International Conference on Computer and Information Technology (CIT), Helsinki, Finland, 2017, pp. 204-209, doi: 10.1109/CIT.2017.27.

S. Nagendrakumar, R. Aparna and S. Ramesh, "A non-grouping anonymity model for preserving privacy in health data publishing," 2014 International Conference on Science Engineering and Management Research (ICSEMR), Chennai, India, 2014, pp. 1-6, doi: 10.1109/ICSEMR.2014.7043554.

M. Boreale, F. Corradi and C. Viscardi, "Relative Privacy Threats and Learning From Anonymized Data," in IEEE Transactions on Information Forensics and Security, vol. 15, pp. 1379-1393, 2020, doi: 10.1109/TIFS.2019.2937640.

Khetani, V. ., Gandhi, Y. ., Bhattacharya, S. ., Ajani, S. N. ., & Limkar, S. . (2023). Cross-Domain Analysis of ML and DL: Evaluating their Impact in Diverse Domains. International Journal of Intelligent Systems and Applications in Engineering, 11(7s), 253–262.

Shivadekar, S., Shahapure, K., Vibhute, S., & Dunn, A. (2024). Evaluation of Machine Learning Methods for Predicting Heart Failure Readmissions: A Comparative Analysis. International Journal of Intelligent Systems and Applications in Engineering, 12(6s), 694-699.

Sairise, Raju M., Limkar, Suresh, Deokate, Sarika T., Shirkande, Shrinivas T. , Mahajan, Rupali Atul & Kumar, Anil(2023) Secure group key agreement protocol with elliptic curve secret sharing for authentication in distributed environments, Journal of Discrete Mathematical Sciences and Cryptography, 26:5, 1569–1583, DOI: 10.47974/JDMSC-1825

Nilesh P. Sable, Devendra P. Gadekar, Jyoti Yogesh Deshmukh, Sheetal Phatangare, Shwetal Kishor Patil, Aarti Dandavate, "Applications of Nonlinear Analysis Transforming Communication Paradigms for Seamless Connectivity", Communications on Applied Nonlinear Analysis, Vol. 30 No. 2 (2023), pp. 56-72.

Downloads

Published

29.01.2024

How to Cite

Maurya, A. ., & Joshi, M. . (2024). Exploring Privacy-Preserving Strategies: A Comprehensive Analysis of Group-Based Anonymization and Hybrid ECC Encryption Algorithm for Effective Performance Evaluation in Data Security. International Journal of Intelligent Systems and Applications in Engineering, 12(13s), 517–527. Retrieved from https://www.ijisae.org/index.php/IJISAE/article/view/4618

Issue

Vol. 12 No. 13s (2024)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.

IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.