On the Representation and Querying of Sets of Possible Worlds in the K anonymity Privacy Protecting Model
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.
2011 Seventh International Conference on Computational Intelligence and Security