首页> 外文会议>International Conference on Financial Cryptography and DataSecurity >Optimizing MPC for Robust and Scalable Integer and Floating-Point Arithmetic
【24h】

Optimizing MPC for Robust and Scalable Integer and Floating-Point Arithmetic

机译:优化MPC以实现鲁棒和可伸缩整数和浮点算术

获取原文

摘要

Secure multiparty computation (SMC) is a rapidly maturing field, but its number of practical applications so far has been small. Most existing applications have been run on small data volumes with the exception of a recent study processing tens of millions of education and tax records. For practical usability, SMC frameworks must be able to work with large collections of data and perform reliably under such conditions. In this work we demonstrate that with the help of our recently developed tools and some optimizations, the SHAREMIND secure computation framework is capable of executing tens of millions integer operations or hundreds of thousands floating-point operations per second. We also demonstrate robustness in handling a billion integer inputs and a million floating-point inputs in parallel. Such capabilities are absolutely necessary for real world deployments.
机译:安全多方计算(SMC)是一种快速成熟的领域,但到目前为止,它的实际应用数量很小。大多数现有的应用程序已经在小数据卷上运行,但最近的一项教育和税务记录最近的研究处理。为了实际可用性,SMC框架必须能够在大量数据上工作,并在这种条件下可靠地执行。在这项工作中,我们展示了在我们最近开发的工具和一些优化的帮助下,发现的荧光灯安全计算框架能够执行数百万整数操作或每秒数百万浮点操作。我们还展示了处理十亿个整数输入和并行浮点输入的稳健性。真实世界部署是绝对必要的这种功能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号