Name
Title | ||
|---|---|---|
Non-Interactive Secure Multi-Party Arithmetic Computations With Confidentiality For P2p Networks |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s12083-020-01029-7 | PEER-TO-PEER NETWORKING AND APPLICATIONS |
Keywords | DocType | Volume |
Secure multi-party computation, Non-interaction, Confidentiality, Information-theoretical security | Journal | 14 |
Issue | ISSN | Citations |
2 | 1936-6442 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lein Harn | 1 | 15 | 4.00 |
| Zhe Xia | 2 | 7 | 8.21 |
| Ching-Fang Hsu | 3 | 6 | 3.47 |