Exclusive Strategy for Generalization Algorithms in Micro-data Disclosure


When generalization algorithms are known to the public, an adversary can obtain a more precise estimation of the secret table than what can be deduced from the disclosed generalization result. Therefore, whether a generalization algorithm can satisfy a privacy property should be judged based on such an estimation. In this paper, we show that the computation of the estimation is inherently a recursive process that exhibits a high complexity when generalization algorithms take a straightforward inclusive strategy. To facilitate the design of more efficient generalization algorithms, we suggest an alternative exclusive strategy, which adopts a seemingly drastic approach to eliminate the need for recursion. Surprisingly, the data utility of the two strategies are actually not comparable and the exclusive strategy can provide better data utility in certain cases.

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@inproceedings{Zhang2008ExclusiveSF, title={Exclusive Strategy for Generalization Algorithms in Micro-data Disclosure}, author={Lei Zhang and Lingyu Wang and Sushil Jajodia and Alexander Brodsky}, booktitle={DBSec}, year={2008} }