首页> 外文学位 >Query auditing against partial disclosure.
【24h】

Query auditing against partial disclosure.

机译:查询审计以部分披露。

获取原文
获取原文并翻译 | 示例

摘要

Many government agencies, businesses, and nonprofit organizations need to collect, analyze, and report data about individuals in order to support their short-term and long-term planning activities. Statistical Databases therefore contain confidential information such as income, credit ratings, type of disease, or test scores of individuals. Such data are typically stored online and analyzed using sophisticated database management systems (DBMS) and software packages. On one hand, such database systems are expected to satisfy user requests of aggregate statistics related to non-confidential and confidential attributes. On the other hand, the system should be secure enough to guard against a user's ability to infer any confidential information related to a specific individual represented in the database. A major privacy threat is the adversarial inference of individual (private) tuples from aggregate query answers. Most existing work focuses on the exact disclosure problem, which is inadequate in practice. We propose a novel auditing algorithm for defending against partial disclosure.;We introduce ENTROPY-AUDITING, an efficient query-auditing algorithm for partial disclosure that supports a mixture of common aggregate functions. In particular, we classify aggregate functions into two categories: MIN-like (e.g., MIN and MAX) and SUM-like (e.g., SUM and MEDIAN), and support a combination of them. Our proposed scheme utilizes an exact-auditing algorithm as a primitive function, and supports a combination of queries with various aggregate functions (e.g., SUM, MIN, MAX). We also present a detailed experimental evaluation of our PARTIAL-AUDITING approach.
机译:许多政府机构,企业和非营利组织需要收集,分析和报告有关个人的数据,以支持其短期和长期计划活动。因此,统计数据库包含机密信息,例如收入,信用等级,疾病类型或个人测试成绩。此类数据通常在线存储并使用复杂的数据库管理系统(DBMS)和软件包进行分析。一方面,期望这样的数据库系统满足与非机密和机密属性有关的聚合统计信息的用户请求。另一方面,系统应足够安全,以防止用户推断与数据库中表示的特定个人有关的任何机密信息的能力。一个主要的隐私威胁是根据汇总查询答案对单个(私有)元组进行对抗性推论。现有的大多数工作都集中在确切的披露问题上,实际上这是不够的。我们提出了一种新颖的审计算法来抵御部分披露。我们引入了ENTROPY-AUDITING,这是一种有效的部分披露查询查询算法,它支持混合的集合函数。特别是,我们将聚合函数分为两类:MIN类(例如MIN和MAX)和SUM类(例如SUM和MEDIAN),并支持它们的组合。我们提出的方案利用精确审计算法作为原始函数,并支持具有各种聚合函数(例如SUM,MIN,MAX)的查询组合。我们还将介绍对我们的部分审核方法的详细实验评估。

著录项

  • 作者

    Motgi, Mayur.;

  • 作者单位

    The University of Texas at Arlington.;

  • 授予单位 The University of Texas at Arlington.;
  • 学科 Computer Science.
  • 学位 M.S.
  • 年度 2009
  • 页码 71 p.
  • 总页数 71
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

  • 入库时间 2022-08-17 11:38:31

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号