首页> 外文会议>International conference on very large data bases >Obscure: Information-Theoretic Oblivious and Verifiable Aggregation Queries
【24h】

Obscure: Information-Theoretic Oblivious and Verifiable Aggregation Queries

机译:晦涩:信息 - 理论无耻和可验证的聚合查询

获取原文

摘要

Despite extensive research on cryptography, secure and efficient query processing over outsourced data remains an open challenge. We develop communication-efficient and information-theoretically secure algorithms for privacy-preserving aggregation queries using multi-party computation (MPC). Specifically, query processing techniques over secret-shared data outsourced by single or multiple database owners are developed. These algorithms allow a user to execute queries on the secret-shared database and also prevent the network and the (adversarial) clouds to learn the user's queries, results, or the database. We further develop (non-mandatory) privacy-preserving result verification algorithms that detect malicious behaviors, and experimentally validate the efficiency of our approach over large datasets, the size of which prior approaches to secret-sharing or MPC systems have not scaled to.
机译:尽管对密码学进行了广泛的研究,但外包数据的安全和高效的查询处理仍然是一个开放的挑战。我们使用多方计算(MPC)开发用于隐私保留聚合查询的通信高效和信息理论上安全算法。具体地,开发了由单个或多个数据库所有者外包的秘密共享数据的查询处理技术。这些算法允许用户在秘密共享数据库上执行查询,并且还可以防止网络和(对外的)云来学习用户的查询,结果或数据库。我们进一步开发(非强制性)隐私保留结果验证算法,检测恶意行为,并通过实验验证我们对大型数据集的方法的效率,其秘密共享或MPC系统的前提方法的大小没有缩放到。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号