arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0912.5426cs.DB
收藏

L-分集的困难性和近似算法

The Hardness and Approximation Algorithms for L-Diversity

Xiaokui Xiao, Ke Yi, Yufei Tao

摘要:

现有的隐私保护发布解决方案可以分为理论和启发式两大类。前者保证了可证明的低信息损失,而后者在最坏的情况下会产生巨大的损失,但经验表明,在许多实际输入上表现良好。虽然已经开发了许多启发式算法来满足高级隐私原则,例如l-多样性、t-接近度等,理论类别目前限于K-匿名,这是已知的对隐私攻击具有严重脆弱性的最早的原则。出于这一动机,我们提出了第一个理论研究L-多样性,一个流行的原则,被广泛采用的文献。首先,我们证明了最优l-多样推广是NP-难的,即使在微数据中只有3个不同的敏感值。然后,开发了(l*d)-近似算法,其中d是底层数据集的维数。这是第一个已知的算法与非平凡的信息损失的限制。大量的实验验证了所提出的解决方案的有效性和效率的真实数据集。

英文摘要:

The existing solutions to privacy preserving publication can be classified into the theoretical and heuristic categories. The former guarantees provably low information loss, whereas the latter incurs gigantic loss in the worst case, but is shown empirically to perform well on many real inputs. While numerous heuristic algorithms have been developed to satisfy advanced privacy principles such as l-diversity, t-closeness, etc., the theoretical category is currently limited to k-anonymity which is the earliest principle known to have severe vulnerability to privacy attacks. Motivated by this, we present the first theoretical study on l-diversity, a popular principle that is widely adopted in the literature. First, we show that optimal l-diverse generalization is NP-hard even when there are only 3 distinct sensitive values in the microdata. Then, an (l*d)-approximation algorithm is developed, where d is the dimensionality of the underlying dataset. This is the first known algorithm with a non-trivial bound on information loss. Extensive experiments with real datasets validate the effectiveness and efficiency of proposed solution.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑