The Mastermind Attack on Genomic Data对基因组数据的策划攻击.pptVIP

下载本文档

6
0
约5.74千字
约 25页
2017-03-09 发布于上海
举报
版权申诉

The Mastermind Attack on Genomic Data对基因组数据的策划攻击.ppt

1、本文档共25页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

The Mastermind Attack on Genomic Data对基因组数据的策划攻击

On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem Michael T. Goodrich Dept. of Computer Science joint with Wenliang Du, David Eppstein, and George Lueker Motivation Privacy is a concern with respect to information in relational data bases rows are associated with people columns are attributes K-anonymity No query should reveal less than K individuals image source: /2007/09/neutral-mask-masterclass.html Generalization Replace specific attributes with more general ones, so no category has fewer than K members. source: ?-Diversity: Privacy Beyond k-Anonymity Ashwin Machanavajjhala Johannes Gehrke Daniel Kifer Muthuramakrishnan Venkitasubramaniam Department of Computer Science, Cornell University Data Types Linear: Easy greedy algorithm is optimal Unordered: arbitrary groupings possible GPS coordinates: group using rectangles Zip codes: should use proximity, not text image source: /Applications/ZIPScribbleMap.html Previous Work [Samarati, Sweeney, 98] introduce concept of k-anonymization and generalization to achieve it. [Meyerson, Williams, 04] show optimal generalization or unordered data is NP-hard, but their proof requires as many attributes as people. And similar proofs are due to [Aggarwal et al., 05] and [Byun et al., 07]. [Khanna, Muthukrishnan, Paterson, 98] study a rectangle tiling problem similar to GPS coordinate generation, showing 5/4-approximations are not possible unless P=NP. Lots more work on k-anonymization and its variants… Our Results Zip codes: has a 4-approximation, but no 4/3-approximation unless P=NP GPS coordinates: has a 5-approximation, but no 4/3-approximation unless P=NP Unordered: is NP-hard but has a PTAS. Also, this version of the problem gives rise to a new type of bin-packing problem. Min-Max Bin Covering max min (k) image source: /article/5540/bin-packing/4/ Min-Max Bin Cover is NP-hard Reduction from: Reduction method: A Next-Fit Method: “Fold” Theorem: There is a linear-ti