Privacy Preservation of Aggregates in Hidden Databases Why隐藏在隐藏数据库中的隐私保护.pptVIP

下载本文档

1
0
约 28页
2017-03-08 发布于上海
举报
版权申诉

Privacy Preservation of Aggregates in Hidden Databases Why隐藏在隐藏数据库中的隐私保护.ppt

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

Privacy Preservation of Aggregates in Hidden Databases Why隐藏在隐藏数据库中的隐私保护

Privacy Preservation of Aggregates in Hidden Databases: Why and How? Arjun Dasgupta, Nan Zhang, Gautam Das, Surajit Chaudhuri Presented by PENG Yu Outline Introduction Problem Definition Our Approach Privacy Guarantee Experiments Conclusion Privacy leakage An airline company’s flight search form lets a user search for a flight by specifying a set of attributes such as departure and destination, date, number of stops, carrier, and cabin preferences. Privacy of Preservation of Aggregates Reasons: Legitimate interfaces give chances to attackers to detect the sensitive aggregates information. Aggregates information can be used by adversaries to master the whole distribution and other features of the hidden databases behind the interfaces. To some extent, aggregates information is more useful than individual information. Challenge: Given a hidden database, develop techniques that make it very difficult to obtain uniform random samples of the database via its search interface without necessitating human intervention. Privacy of Preservation of Aggregates Some Assumptions Data is only accessible through a web-based interface Consider sampling attacks only Keep bona fide users unaffected External knowledge is omitted Consider Boolean attribute and extend it to categorical or numerical one Outline Introduction Problem Definition Our Approach Privacy Guarantee Experiments Conclusion Preliminaries Terms: D: database table m: number of tuples in D Qs: search query Sel(Qs): the result set of tuples in D that satisfy Qs n: number of predicates in Qs Notification If |Sel(Qs)|k, only the top-k tuples in Sel(Qs) will be returned according to a ranking function. Preliminaries (Cont.) A query Qs is called Underflow; if |Sel(Qs)|=0 Overflow; if |Sel(Qs)|k Valid; if 0|Sel(Qs)|≤k Universal space Ω : the set of all possible search queries Active space Θ : a subset of Ω containing only those queries that are candidates for issuing at a subsequent time Problem Definition (ε,