Abstract
This paper proposes an efficient batch secret sharing protocol among n players resilient to t < n/4 players in asynchronous network. The construction of our protocol is along the line of Hirt’s protocol which works in 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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Canetti R. Studies in secure multiparty computation and applications [D]. Rehovot, Israel: Weizmann Institute of Science, 1995.
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.
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.
Srinathan K, Rangan C. Efficient asynchronous secure multiparty distributed computation [C]//Proceedings of Progress in Cryptology INDOCRYPT 2000. Heidelberg: Springer-Verlag, 2000: 117–130.
Hirt M, Mauren U. Robustness for free in unconditional multiparty computation [C]//Advances in Cryptology-CRYPTO’ 01. Heidelberg: Springer-Verlag, 2001: 101–118.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: the National Natural Science Foundation of China (No. 60803146)
Rights and permissions
About this article
Cite this article
Huang, Z., Gong, Z. & Li, Q. Batch secret sharing for secure multi-party computation in asynchronous network. J. Shanghai Jiaotong Univ. (Sci.) 14, 112–116 (2009). https://doi.org/10.1007/s12204-009-0112-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12204-009-0112-5