Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Asynchronous secure computation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Asynchronous secure computations with optimal resilience (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Robustness for Free in Unconditional Multi-party Computation
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Multiparty Protocols Using Circuit Randomization
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Efficient Asynchronous Secure Multiparty Distributed Computation
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Hi-index | 0.00 |
This paper proposes an efficient secure multiparty computation protocol among n players resilient to $t players in asynchronous model. We use Batch Secret Sharing [9] as building blocks. The construction of our protocol is along the line of [7]and [2] which work in synchronous model. The execution of our protocol can be divided into two phases: Pre-computation phase and the Circuit evaluation phase. The pre-computation phase needs to communicate $O( n^4 \lg |\mathcal{F}| + mn^2 \log |\mathcal{F}|)$ bits and Broadcast $O(n^2 \lg |\mathcal{F}|) $ bits, where m is the number of multiplication gates in the circuit and the circuit is over a finite field $\mathcal{F}$. The circuit evaluation phase needs to communicate $O(n^3 \lg |\mathcal{F}|+n^4 \lg n+mn^2 \lg |\mathcal{F}|) $ bits and Broadcast $O(n^2 \lg n)$ bits. Compared with the well-known secure multiparty computation protocol in asynchronous model [4] which needs to communicate $O(mn^4 \lg |\mathcal{F}|+mn^4 \lg n)$ bits and broadcast $O(mn^4 \lg n)$ bits, our protocol is quite efficient.