首页> 外文会议>International conference on cryptology in India >Secure Multi-Party Computation: A Tutorial
【24h】

Secure Multi-Party Computation: A Tutorial

机译:安全的多方计算:教程

获取原文

摘要

Secure Multi-Party Computation (MPC) is a central problem in modern cryptography, that allows mutually distrusting parties to collaborate with each other on computational tasks, without compromising their private data (beyond what the output of the computation reveals). In this tutorial we shall cover some of the basic concepts behind MPC, informed by recent developments in the field. The first half of the tutorial will introduce the concept of MPC and briefly present some of the classic constructions, including Yao's Garbled Circuits, the GMW protocol and the BGW protocol. We shall then see some blackbox transformations that can be applied to simpler protocols, to achieve higher security or efficiency goals. The second half of the tutorial will deal with fundamental issues in the theory of MPC. These include definitions of security, classification of MPC tasks according to their cryptographic complexity (including characterization of tasks as possible or impossible to carry out), and questions regarding the communication complexity of MPC.
机译:安全多方计算(MPC)是现代密码学中的一个中心问题,它使相互不信任的各方可以在计算任务上相互协作,而不会损害其私有数据(超出计算结果所显示的范围)。在本教程中,我们将介绍MPC背后的一些基本概念,并参考该领域的最新发展。本教程的前半部分将介绍MPC的概念,并简要介绍一些经典构造,包括Yao的乱码电路,GMW协议和BGW协议。然后,我们将看到一些可应用于更简单协议的黑盒转换,以实现更高的安全性或效率目标。本教程的后半部分将讨论MPC理论中的基本问题。这些包括安全性定义,根据其密码复杂性对MPC任务进行分类(包括对可能或不可能执行的任务进行表征),以及有关MPC通信复杂性的问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号