Satisfying privacy requirements before data anonymization
Date
2012
Authors
Sun, X.
Wang, H.
Li, J.
Zhang, Y.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Computer Journal, 2012; 55(4):422-437
Statement of Responsibility
Conference Name
Abstract
In this paper, we study a problem of protecting privacy of individuals in large public survey rating data. We propose a novel (k,ϵ, l)-anonymity model to protect privacy in large survey rating data, in which each survey record is required to be similar to at least k−1 other records based on the non-sensitive ratings, where the similarity is controlled by ϵ, and the standard deviation of sensitive ratings is at least l. We study an interesting yet non-trivial satisfaction problem of the proposed model, which is to decide whether a survey rating data set satisfies the privacy requirements given by the user. For this problem, we investigate its inherent properties theoretically, and devise a novel slicing technique to solve it. We analyze the computation complexity of the proposed slicing technique and conduct extensive experiments on two real-life data sets, and the results show that the slicing technique is fast and scalable with data size and much more efficient in terms of execution time and space overhead than the heuristic pairwise method.
School/Discipline
Dissertation Note
Provenance
Description
Link to a related website: http://pdfs.semanticscholar.org/b2c2/d390b965442e4abe370f544bcbd873b928ad.pdf, Open Access via Unpaywall
Access Status
Rights
Copyright 2011 The Author