首页> 外文会议>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的概念,并简要介绍一些经典结构,包括姚明的乱码电路,GMW协议和BGW协议。然后,我们将看到一些可以应用于更简单的协议的黑箱变换,以实现更高的安全性或效率目标。该教程的下半部分将处理MPC理论中的根本问题。这些包括安全的定义,根据他们的加密复杂性(包括尽可能或不可能执行的任务的表征)以及关于MPC的通信复杂性的问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号