当前位置: X-MOL 学术Peer-to-Peer Netw. Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Non-interactive secure multi-party arithmetic computations with confidentiality for P2P networks
Peer-to-Peer Networking and Applications ( IF 3.3 ) Pub Date : 2020-11-25 , DOI: 10.1007/s12083-020-01029-7
Lein Harn , Zhe Xia , Chingfang Hsu

A fundamental feature of Peer-to-Peer (P2P) networks is the honest collaboration among a heterogeneous community of participants. Secure Multi-Party Computation (SMPC) finds ways for parties to jointly compute a function using their inputs, while keeping these inputs private. In this paper, we propose a secure three-party computation which takes three inputs and outputs their sum and product without revealing each individual input. Recall that any general function is composed of multiple additions and multiplications, our result serves as a solution for general SMPC. Our proposal is non-interactive and can be easily extended to SMPC with any number of inputs. Furthermore, in our proposed solution, the computational results can be made only available to a designated participant.



中文翻译:

对P2P网络具有机密性的非交互式安全多方算术计算

点对点(P2P)网络的基本特征是异构参与者社区之间的诚实协作。安全多方计算(SMPC)为各方找到了使用其输入共同计算功能的方法,同时又将这些输入保密。在本文中,我们提出了一个安全的三方计算,该计算需要三个输入并输出它们的总和与乘积,而不显示每个单独的输入。回想一下,任何通用函数都是由多个加法和乘法组成的,我们的结果可作为通用SMPC的解决方案。我们的建议是非交互式的,可以通过任意数量的输入轻松扩展到SMPC。此外,在我们提出的解决方案中,计算结果只能提供给指定的参与者。

更新日期:2020-11-25
down
wechat
bug