搜索结果: 1-5 共查到“three-party computation”相关记录5条 . 查询时间(0.078 秒)
We settle the exact round complexity of three-party computation (3PC) in honest-majority setting, for a range of security notions such as selective abort, unanimous abort, fairness and guaranteed outp...
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
secure multiparty computation honest majority concrete efficiency
2016/12/10
In this paper, we describe a new information-theoretic protocol (and a computationally-secure variant) for secure {\em three}-party computation with an honest majority. The protocol has very minimal c...
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
secure multiparty computation malicious adversaries honest majority
2016/12/8
In this paper, we describe a new protocol for secure three-party computation of any functionality, with an honest majority and a \textit{malicious} adversary. Our protocol has both an information-theo...
Efficient Three-Party Computation from Cut-and-Choose
cryptographic protocols secure computation
2016/1/25
With relatively few exceptions, the literature on efficient (practical) secure computation has
focused on secure two-party computation (2PC). It is, in general, unclear whether the techniques
used t...
Fast and Secure Three-party Computation: The Garbled Circuit Approach
secure computation garbled circuits three-party
2015/12/22
Many deployments of secure multi-party computation (MPC) in practice have used informationtheoretic
three-party protocols that tolerate a single, semi-honest corrupt party, since these protocols
enj...