Design of Privacy Preservation Model for Data Stream Using Condensation Based Anonymization

In modern world, continuous data flows that may be analyzed in real-time and are created from multiple sources are referred to as data streams. As data streams become increasingly prevalent across various sectors, preserving the privacy of sensitive information while maintaining data utility is a significant challenge. Due to privacy concerns in most of the organizations, data are shared with third party or the public. In many cases, users are hesitant to provide personal information. This paper proposes a privacy-preservation model for data streams based on condensation-based anonymization. This model uses a condensation mechanism to reduce the granularity of data while ensuring that personally identifiable information and sensitive attributes are effectively anonymized. By leveraging a condensation approach, the model selectively compresses data, allowing for both privacy protection and the retention of essential data patterns for analysis. The condensation method minimizes lost information throughout the anonymization process in an effort to maintain the statistical features of the data. Using generalization and suppression approaches, k-Anonymity obscures identifying information in datasets, making it a useful tool for protecting individual privacy. The proposed model employs hybrid of K- Anonymity algorithm and condensation method to enhance the security and privacy of the data.

Authors

Institutions

Publication Details

Journal
CLEI electronic journal
Published
2025-08-03
DOI
https://doi.org/10.19153/cleiej.28.4.8
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Design of Privacy Preservation Model for Data Stream Using Condensation Based Anonymization

P Latha, M Thangaraj
CLEI electronic journal
Privacy-Preserving Technologies in Data
article

Design of Privacy Preservation Model for Data Stream Using Condensation Based Anonymization

P Latha, M Thangaraj
article en

Abstract

In modern world, continuous data flows that may be analyzed in real-time and are created from multiple sources are referred to as data streams. As data streams become increasingly prevalent across various sectors, preserving the privacy of sensitive information while maintaining data utility is a significant challenge. Due to privacy concerns in most of the organizations, data are shared with third party or the public. In many cases, users are hesitant to provide personal information. This paper proposes a privacy-preservation model for data streams based on condensation-based anonymization. This model uses a condensation mechanism to reduce the granularity of data while ensuring that personally identifiable information and sensitive attributes are effectively anonymized. By leveraging a condensation approach, the model selectively compresses data, allowing for both privacy protection and the retention of essential data patterns for analysis. The condensation method minimizes lost information throughout the anonymization process in an effort to maintain the statistical features of the data. Using generalization and suppression approaches, k-Anonymity obscures identifying information in datasets, making it a useful tool for protecting individual privacy. The proposed model employs hybrid of K- Anonymity algorithm and condensation method to enhance the security and privacy of the data.

CLEI electronic journalVol. 28(4)
Madurai Kamaraj University (IN)
Openalex Percentile: Top 91%
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.