k-Jump Strategy for Preserving Privacy in Micro-Data Disclosure

摘要

In disclosing micro-data with sensitive attributes, the goal is usually two fold. First, the data utility of disclosed data should be maximized for analysis purposes. Second, the private information contained in such data must be limited to an acceptable level. Recent studies show that adversarial inferences using knowledge about a disclosure algorithm can usually render the algorithm unsafe. In this paper, we show that an existing unsafe algorithm can be transformed into a large family of distinct safe algorithms, namely, fc-jump algorithms. We prove that the data utility of different A;-jump algorithms is generally incomparable. Therefore, a secret choice can be made among all fc-jump algorithms to eliminate adversarial inferences while improving the data utility of disclosed micro-data.