DocumentCode
2988296
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
fYear
2011
fDate
3-4 Dec. 2011
Firstpage
662
Lastpage
664
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Security (CIS), 2011 Seventh International Conference on
Conference_Location
Hainan
Print_ISBN
978-1-4577-2008-6
Type
conf
DOI
10.1109/CIS.2011.151
Filename
6128207
Link To Document