arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.3811cs.CCcs.DB
收藏

解决某些数据隐私问题的复杂性

Resolving the Complexity of Some Data Privacy Problems

Jeremiah Blocki, Ryan Williams

摘要:

我们正式研究了两种在数据库社区中广泛使用的数据卫生方法:k-匿名和l-多样性。我们解决了几个公开的问题,这些方法的最佳应用的困难,证明积极和消极的结果:1。2-匿名在P.2。将无三角形图的边划分为4-星(3度顶点)的问题是NP-困难的。这产生了另一种证明,即即使数据库属性都是二进制的,3-匿名也是NP难的。3. 3-每个记录只有27个属性的匿名性是MAX SNP硬的。4.对于n行的数据库,k-匿名是O(4^n poly(n))时间,对于所有k > 1。5.对于具有n行和l <= log_{2c+2} log n个属性的数据库,在基数为c = O(1)的字母表上,k-匿名在P中。假设c,l = O(1),k-匿名在O(n)中。6. 3-具有二元属性的多样性是NP难的,具有一个敏感属性。7. 2-具有二值属性的多样性是NP难的,具有三个敏感属性。

英文摘要:

We formally study two methods for data sanitation that have been used extensively in the database community: k-anonymity and l-diversity. We settle several open problems concerning the difficulty of applying these methods optimally, proving both positive and negative results: 1. 2-anonymity is in P. 2. The problem of partitioning the edges of a triangle-free graph into 4-stars (degree-three vertices) is NP-hard. This yields an alternative proof that 3-anonymity is NP-hard even when the database attributes are all binary. 3. 3-anonymity with only 27 attributes per record is MAX SNP-hard. 4. For databases with n rows, k-anonymity is in O(4^n poly(n)) time for all k > 1. 5. For databases with n rows and l <= log_{2c+2} log n attributes over an alphabet of cardinality c = O(1), k-anonymity is in P. Assuming c, l = O(1), k-anonymity is in O(n). 6. 3-diversity with binary attributes is NP-hard, with one sensitive attribute. 7. 2-diversity with binary attributes is NP-hard, with three sensitive attributes.

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

↑