-Inference: A Data-Aware and High-Utility Privacy Model for Relational Data Publishing

Current privacy-preservation data publishing technologies primarily focus on anonymizing datasets, often overlooking the inherent privacy degrees embedded within the data. This oversight makes it challenging to balance privacy and utility effectively. To address this issue, we introduce the Privacy Evaluation and Validation scheme to Measure the original Privacy Degree (PEVMPD), anchored in a novel <inline-formula><tex-math notation="LaTeX">$\eta$</tex-math></inline-formula>-inference model. PEVMPD operates in two phases: the identification of risk elements and the evaluation of privacy degrees. In the first phase, attributes are appraised using entropy and KL divergence to pinpoint sensitive attributes. Concurrently, the maximum entropy principle is employed to identify critical quasi-identifiers. The second phase involves applying these risk elements within our <inline-formula><tex-math notation="LaTeX">$\eta$</tex-math></inline-formula>-inference model to locate data vulnerable to privacy breaches and to quantify the corresponding privacy degree. This methodology enables data owners to make informed decisions about achieving an optimal privacy-utility tradeoff during data anonymization. Experimental results on real datasets validate the effectiveness of PEVMPD in enhancing privacy measures.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Dependable and Secure Computing
Published
2025-02-18
DOI
https://doi.org/10.1109/tdsc.2025.3543205
Citations
1
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

-Inference: A Data-Aware and High-Utility Privacy Model for Relational Data Publishing

Guowei Wu, Haibo Hu, Lin Yao, Zhenyu Chen
1 citations
IEEE Transactions on Dependable and Secure Computing
Privacy-Preserving Technologies in Data
2.48
article

-Inference: A Data-Aware and High-Utility Privacy Model for Relational Data Publishing

Guowei Wu, Haibo Hu, Lin Yao, Zhenyu Chen
article en
1 citations

Abstract

Current privacy-preservation data publishing technologies primarily focus on anonymizing datasets, often overlooking the inherent privacy degrees embedded within the data. This oversight makes it challenging to balance privacy and utility effectively. To address this issue, we introduce the Privacy Evaluation and Validation scheme to Measure the original Privacy Degree (PEVMPD), anchored in a novel <inline-formula><tex-math notation="LaTeX">$\eta$</tex-math></inline-formula>-inference model. PEVMPD operates in two phases: the identification of risk elements and the evaluation of privacy degrees. In the first phase, attributes are appraised using entropy and KL divergence to pinpoint sensitive attributes. Concurrently, the maximum entropy principle is employed to identify critical quasi-identifiers. The second phase involves applying these risk elements within our <inline-formula><tex-math notation="LaTeX">$\eta$</tex-math></inline-formula>-inference model to locate data vulnerable to privacy breaches and to quantify the corresponding privacy degree. This methodology enables data owners to make informed decisions about achieving an optimal privacy-utility tradeoff during data anonymization. Experimental results on real datasets validate the effectiveness of PEVMPD in enhancing privacy measures.

IEEE Transactions on Dependable and Secure ComputingVol. 22(4)
Hong Kong Polytechnic University (HK), Dalian University of Technology (CN)
Openalex Percentile: Top 12%
Privacy-Preserving Technologies in Data
2.48
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.