首页> 外文会议>International Conference on Data Warehousing and Knowledge Discovery(DaWaK 2007); 20070903-07; Regensburg(DE) >Fast Cryptographic Multi-party Protocols for Computing Boolean Scalar Products with Applications to Privacy-Preserving Association Rule Mining in Vertically Partitioned Data
【24h】

Fast Cryptographic Multi-party Protocols for Computing Boolean Scalar Products with Applications to Privacy-Preserving Association Rule Mining in Vertically Partitioned Data

机译:用于计算布尔型标量产品的快速加密多方协议及其在垂直分区数据中保护隐私的关联规则挖掘中的应用

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

摘要

Recently, the problem of privately mining association rules in vertically partitioned data has been reduced to the problem of privately computing boolean scalar products. In this paper, we propose two cryptographic multi-party protocols for privately computing boolean scalar products. The proposed protocols are shown to be secure and much faster than other protocols for the same problem.
机译:近来,在垂直划分的数据中私下挖掘关联规则的问题已经减少到私下计算布尔型标量产品的问题。在本文中,我们提出了两个用于加密计算布尔标量产品的加密多方协议。对于相同的问题,建议的协议被证明是安全的,并且比其他协议要快得多。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号