The explosion in variety and volume of information in the public domains provides an enormous opportunity for analysis and business purposes. Availability of private information is of explicit interest in sanctionative highly tailored services tuned to individual desires. Though this is highly favorable to the individuals, the conventional anonymization techniques still possess threats to the privacy of individuals through reidentification attacks. The focus of this paper is to propose a privacy-preserving approach called (K, L) Anonymity that combines k-anonymity and Laplace differential privacy techniques. This coherent model guarantees privacy from linkage attacks as the risk is mitigated through experimental results. The proposed model also addressed the shortcomings of other traditional privacy-preserving mechanisms and validated with publicly available datasets.
CITATION STYLE
Andrew, J., & Karthikeyan, J. (2021). Privacy-preserving big data publication: (k, l) anonymity. In Advances in Intelligent Systems and Computing (Vol. 1167, pp. 77–88). Springer. https://doi.org/10.1007/978-981-15-5285-4_7
Mendeley helps you to discover research relevant for your work.