Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
复制标题
DOI：
10.1007/978-3-319-28166-7_1
复制
发表时间：
2015-06
期刊：
影响因子：
--
通讯作者：
Berry Schoenmakers;Meilof Veeningen
中科院分区：
文献类型：
--
作者：
Berry Schoenmakers;Meilof Veeningen
多方计算可用于对多方私人输入的计算进行隐私友好的外包。一个计算外包给几个计算方；如果没有太多的计算方被破坏(例如，不超过一半)，那么他们就不能确定输入或产生不正确的输出。然而，在许多情况下，这些保证是不够的：即使所有计算方可能被破坏，我们也需要正确性；我们需要即使没有参与计算的各方也可以验证正确性。满足这些附加性质的协议被称为“普遍可验证的”。本文提出了一种新的通用可验证多方计算的安全模型，并给出了一个基于门限同态密码体制的实用构造。我们还开发了一个多方协议，用于联合产生可能独立感兴趣的非交互零知识证明。
Multiparty computation can be used for privacy-friendly outsourcing of computations on private inputs of multiple parties. A computation is outsourced to several computation parties; if not too many are corrupted (e.g., no more than half), then they cannot determine the inputs or produce an incorrect output. However, in many cases, these guarantees are not enough: we need correctness even ifallcomputation parties may be corrupted; and we need that correctness can be verified even by parties that did not participate in the computation. Protocols satisfying these additional properties are called “universally verifiable”. In this paper, we propose a new security model for universally verifiable multiparty computation, and we present a practical construction, based on a threshold homomorphic cryptosystem. We also develop a multiparty protocol for jointly producing non-interactive zero-knowledge proofs, which may be of independent interest.