2021· International Journal of Applied Data Science & Modern Computing· 0 citations
Abstract
The appraisal of Privacy-Preserving Data Mining (PPDM) has become a crucial research area in current times as a result of the incredible increase in the applications of data-driven applications that use sensitive data (health records, financial transactions, social networks, and governmental databases). Although the data mining techniques have been offering effective tools in the extraction of valuable knowledge, they facilitate great risks to personal privacy when they are applied to sensitive data. Unauthorized disclosure, inference attack, and breach of data has brought up serious ethical, legal, and regulatory issues. As a result, it is difficult to find the compromise between data utility and privacy protection. This essay outlines an extensive analysis of privacy ensuring data mining methods that allow secure privacy of sensitive data without compromising on the analysis accuracy. The paper systematically investigates the ways of anonymization, perturbation, cryptography, and hybrid privacy models. Besides that, newer privacy models include differential privacy, federated learning, and secure multi-party computation are discussed. A systematic approach is given to assess PPDM methods using privacy strength, data utility, computational complexity and scalability. The paper also reports on the findings of the experiments by comparing them, thus showing trade-offs between privacy and performance. The problems, problems under open research and direction are also discovered. The results highlight the lack of universal best practices because no single method is universally the best and the use of PPDM methods should be applied based on the application. The paper is intended to be a reference book of researchers and practitioners looking to have strong privacy preservation solutions such in sensitive data mining tasks.
: The widespread adoption of data-driven systems has intensified concerns regarding the protection of sensitive information and the assessment of privacy risks. Although numerous privacy-preserving techniques and models have been proposed, quantifying and interpreting the level of privacy achieved remains challenging, particularly for non-expert users. This paper introduces the Privacy Index, a unified metric designed to aggregate multiple privacy-related factors into a single, interpretable score. The proposed approach integrates the validation of established privacy models, detection of anonymization techniques, and estimation of re-identification risk under different attacker assumptions. To support practical usage, we develop a serverless, client-side web application that automatically processes structured datasets by classifying attributes and computing the Privacy Index without transmitting data externally. Experimental evaluation demonstrates that the attribute classification component achieves average confidence levels above 88% across multiple datasets, correctly identifying all direct identifiers with high reliability. The system successfully validates privacy models such as k -anonymity and l -diversity and effectively distinguishes between poorly and well-anonymized datasets. The tool is open-source, its code is available at https://github.com/ieeta-mith/DataPrivScore and a demo is available through https://ieeta-mith.github.io/DataPrivScore/.
José A. Gameiro, J. Oliveira, João Rafael Almeida· Proceedings of the 15th Inte...· 0 citations
The rapid growth of digital technologies has accelerated the adoption of online banking and e-commerce services, enabling fast and convenient financial transactions. However, the extensive collection and processing of customer data have introduced significant cybersecurity and privacy risks, particularly the possibility of re-identification by malicious actors. This study proposes a multi-level anonymity analytics framework to enhance the protection of customer personal information in banking systems. The approach focuses on improving data anonymity to reduce the likelihood of privacy breaches while maintaining data usability. In addition, the research implements a k-anonymity-based method to ensure that sensitive information is adequately protected without compromising its value for operational use. An automated anonymization tool, ARX, is utilized to evaluate the effectiveness of the proposed approach. The study demonstrates that increasing the k-anonymity level reduces re-identification risks while preserving data utility. The proposed methodology aims to provide a scalable and efficient solution for privacy preservation and can be applied across sectors such as banking, healthcare, and telecommunications where sensitive personal data is handled.
A. Tukur, Hamza Audi Giade, Danlami Mohammed et al.· International journal of res...· 0 citations
In today’s era of big data, personal privacy is increasingly at risk due to widespread data sharing. Mobile applications often collect excessive personal information, while advanced analytics can sometimes lead to biased or discriminatory practices. These challenges create an urgent need for secure, privacy-preserving methods that allow sensitive data to be shared and analyzed across multiple parties and diverse systems. This paper reviews the progress made in this area, with a particular focus on the requirements for safe data sharing and controlled dissemination of private information during multi-party data fusion. The review is structured around three main perspectives: privacy-preserving computation, information sharing control, and collaborative secure computation. We begin by examining the current state of privacy protection in large-scale, interconnected environments, followed by a comparison of recent research developments at both national and international levels. In the area of privacy-preserving computation, emerging techniques such as full-lifecycle privacy safeguards, information flow control, and secure data exchange mechanisms are discussed. For information sharing control, three approaches are analyzed—local control, extended control, and desensitization methods. In collaborative secure computation, we outline methods currently being applied in both academic and industry contexts. Finally, the paper highlights key challenges and directions for future research. Traditional approaches such as anonymization, perturbation, and access control, as well as more advanced methods like cryptography and federated learning, all face practical limitations. To achieve robust protection throughout the entire data lifecycle, theoretical models and privacy-aware information systems must be further refined and tailored to different real-world application scenarios.
Chaitanya Tumma, Supraja Ayyamgari, Charan Thumma et al.· 2026 International Conferenc...· 0 citations
Initial evaluations using various machine-learning algorithms on pre-and post-generalized datasets demonstrate the privacy framework’s effectiveness in mitigating privacy risks while preserving data usability.
Ze-Yang Zhu, Matthias N. Louws, Roland V. Bumbuc et al.· 0 citations
An in-depth analysis of federated learning methods and paying special attention to the issue of privacy is provided, which examines new developments, concerns and tradeoffs connected with privacy, effectiveness of communication, model noise, and scalability of systems.
Aarav Mehta· International Journal of App...· 0 citations
It was concluded that strategies such as the careful selection of differential privacy parameters and training settings, along with the use of larger datasets, can improve the efficiency of FL and demonstrate that privacy-preserving and high-performance artificial intelligence systems can be securely applied in sensitive domains such as healthcare and finance.
Cagdas Karatas, Hibanur Karadogan, A. Ertug et al.· 0 citations