Title :
On the Representation and Querying of Sets of Possible Worlds in the K-anonymity Privacy Protecting Model
Author :
Li, Jieyuan ; Liu, Guohua
Author_Institution :
Sch. of Comput. Sci. & Technol, Donghua Univ., Shanghai, China
Abstract :
We represent a set of possible worlds using a k-anonymity privacy protection model. We introduce kpro-anonymity model, a space-efficient and complete representation system for finite sets of worlds. We study the problem of efficiently evaluating queries on sets of possible worlds represented by kpro-anonymity model.
Keywords :
data privacy; query processing; set theory; k-anonymity privacy protecting model; kpro-anonymity model; possible worlds; query evaluation; Cancer; Complexity theory; Computational modeling; Cost accounting; Databases; Polynomials; Privacy; data-complexity; k-anonymity; query; representation;
Conference_Titel :
Computational Intelligence and Security (CIS), 2011 Seventh International Conference on
Conference_Location :
Hainan
Print_ISBN :
978-1-4577-2008-6
DOI :
10.1109/CIS.2011.151
