zbMATH — the first resource for mathematics

Batch secret sharing for secure multi-party computation in asynchronous network. (English) Zbl 1214.94067
Summary: This paper proposes an efficient batch secret sharing protocol among \(n\) players resilient to \(t < n/4\) players in an asynchronous network. The construction of our protocol is along the line of Hirt’s protocol which works in a synchronous model. Compared with the method of using secret share protocol \(m\) times to share \(m\) secrets, our protocol is quite efficient. The protocol can be used to improve the efficiency of secure multi-party computation (MPC) greatly in asynchronous network.

94A62 Authentication, digital signatures and secret sharing
Full Text: DOI
[1] Canetti R. Studies in secure multiparty computation and applications [D]. Rehovot, Israel: Weizmann Institute of Science, 1995.
[2] Ben-or M, Kelmer B, Rabin T. Asynchromous secure computation with optimal resilience [C]//Proceedings of 13th ACM PODC. New York: ACM, 1994: 183–192. · Zbl 1373.68074
[3] Ashwin K M V N, Srinathan K, Pandu R C. Asynchronous perfectly secure computation tolerating generalized adversaries [C]//Proceedings of ACISP 2002. Heidelberg: Springer-Verlag, 2002: 497–511. · Zbl 1024.94511
[4] Srinathan K, Rangan C. Efficient asynchronous secure multiparty distributed computation [C]//Proceedings of Progress in Cryptology INDOCRYPT 2000. Heidelberg: Springer-Verlag, 2000: 117–130. · Zbl 0971.68049
[5] Hirt M, Mauren U. Robustness for free in unconditional multiparty computation [C]//Advances in Cryptology-CRYPTO’ 01. Heidelberg: Springer-Verlag, 2001: 101–118. · Zbl 1002.94523
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.