FairplayMP: a system for secure multi-party computation
FairplayMP: a system for secure multi-party computation
复制标题
DOI：
10.1145/1455770.1455804
复制
发表时间：
2008-10
期刊：
影响因子：
--
通讯作者：
Assaf Ben-David;N. Nisan;Benny Pinkas
中科院分区：
文献类型：
--
作者：
Assaf Ben-David;N. Nisan;Benny Pinkas
我们提出了FairplayMP （for“Fairplay Multi-Party”），一个安全的多方计算系统。安全计算是现代密码学的伟大成就之一，它使一组不信任的各方能够计算其私人输入的任何函数，而只显示函数的结果。从某种意义上说，FairplayMP允许各方运行一个联合计算，模拟一个受信任的方，它接收来自各方的输入，计算函数，并私下通知各方他们的输出。FairplayMP通过接收功能的高级语言描述和描述参与各方的配置文件来运行。系统将函数编译成布尔电路的描述，并在不显示任何其他内容的情况下对电路执行分布式计算。FairplayMP是对Fairplay系统[16]的补充，后者支持双方之间的安全计算。FairplayMP的底层协议是Beaver-Micali-Rogaway （BMR）协议，该协议以固定数量的通信轮（我们的实现中为8轮）运行。我们对BMR协议进行了新颖的改进，并通过使用Ben-Or-Goldwasser-Wigderson （BGW）协议来构造门表，大大提高了其性能。我们之所以选择使用这个协议，是因为我们认为通信轮数是影响协议整体性能的一个主要因素。我们进行了不同的实验，测量了不同参数对系统性能的影响，并证明了系统的可扩展性。（例如，我们现在可以知道，在四个竞标者之间进行二次价格拍卖，使用五个计算玩家，大约需要8秒。）
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptography, enabling a set of untrusting parties to compute any function of their private inputs while revealing nothing but the result of the function. In a sense, FairplayMP lets the parties run a joint computation that emulates a trusted party which receives the inputs from the parties, computes the function, and privately informs the parties of their outputs. FairplayMP operates by receiving a high-level language description of a function and a configuration file describing the participating parties. The system compiles the function into a description as a Boolean circuit, and perform a distributed evaluation of the circuit while revealing nothing else. FairplayMP supplements the Fairplay system [16], which supported secure computation between two parties. The underlying protocol of FairplayMP is the Beaver-Micali-Rogaway (BMR) protocol which runs in a constant number of communication rounds (eight rounds in our implementation). We modified the BMR protocol in a novel way and considerably improved its performance by using the Ben-Or-Goldwasser-Wigderson (BGW) protocol for the purpose of constructing gate tables. We chose to use this protocol since we believe that the number of communication rounds is a major factor on the overall performance of the protocol. We conducted different experiments which measure the effect of different parameters on the performance of the system and demonstrate its scalability. (We can now tell, for example, that running a second-price auction between four bidders, using five computation players, takes about 8 seconds.)