Paper
23 August 2022 (ρ,α)-k anonymous algorithm based on dynamic data
Ke Zheng, Huatang Wu
Author Affiliations +
Proceedings Volume 12330, International Conference on Cyber Security, Artificial Intelligence, and Digital Economy (CSAIDE 2022); 123301L (2022) https://doi.org/10.1117/12.2646317
Event: International Conference on Cyber Security, Artificial Intelligence, and Digital Economy (CSAIDE 2022), 2022, Huzhou, China
Abstract
At present, most privacy protection models only consider static data, and it is easy for attackers to deduce some privacy data through data tables. In view of the changing characteristics of data, this paper proposes a set of dynamic data processing strategies, which are processed according to whether the data appears for the first time and the frequency of occurrence, and the KL divergence is adopted in the process of calculating similarity. Based on the dynamic data processing strategy, this paper proposes a (p,α)-Sensitive k anonymity algorithm for dynamic data. Through the analysis of the experimental results, it can be seen that the algorithm can protect the privacy of dynamic data and increase a certain amount of data-availability.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ke Zheng and Huatang Wu "(ρ,α)-k anonymous algorithm based on dynamic data", Proc. SPIE 12330, International Conference on Cyber Security, Artificial Intelligence, and Digital Economy (CSAIDE 2022), 123301L (23 August 2022); https://doi.org/10.1117/12.2646317
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Data modeling

Silicon

Data processing

Analytical research

Distance measurement

Mining

Operating systems

Back to Top