Brief announcement: Optimally-resilient unconditionally-secure asynchronous multi-party computation revisited. (English) Zbl 1540.68028
Attiya, Hagit (ed.), 34th international symposium on distributed computing, DISC 2020, virtual conference, October 12–16, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 179, Article 44, 3 p. (2020).
Summary: In this paper, we present an optimally-resilient, unconditionally-secure asynchronous multi-party computation (AMPC) protocol for \(n\) parties, tolerating a computationally unbounded adversary, capable of corrupting up to \(t<\frac{n}{3}\) parties. Our protocol needs a communication of \(\mathcal{O}(n^4)\) field elements per multiplication gate. This is to be compared with previous best AMPC protocol [A. Patra et al., Lect. Notes Comput. Sci. 5973, 74–92 (2010; Zbl 1282.94063)] in the same setting, which needs a communication of \(\mathcal{O}(n^5)\) field elements per multiplication gate. To design our protocol, we present a simple and highly efficient asynchronous verifiable secret-sharing (AVSS) protocol, which is of independent interest.
For the entire collection see [Zbl 1451.68023].
For the entire collection see [Zbl 1451.68023].
MSC:
| 68M14 | Distributed systems |
| 68M15 | Reliability, testing and fault tolerance of networks and computer systems |
| 68P27 | Privacy of data |
| 68Q10 | Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) |
| 94A62 | Authentication, digital signatures and secret sharing |
