Abstract
As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against an adversary with multi-structures. Precisely, there are m functions f 1,...,f m and m adversary structures \(\mathcal{A}_1,...,\mathcal{A}_m\), where f i is required to be securely computed against an \(\mathcal{A}_i\)-adversary. We give a general construction to build a parallel multi-party computation protocol from any linear multi-secret sharing scheme (LMSSS), provided that the access structures of the LMSSS allow MPC at all. When computing complicated functions, our protocol has more advantage in communication complexity than the “direct sum” method which actually executes a MPC protocol for each function. The paper also provides an efficient and generic construction to obtain from any LMSSS a multiplicative LMSSS for the same multi-access structure.
Supported by the National Natural Science Foundation of China (No. 90304012, 90204016), 973 project (No. 2004CB318000).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Beimel, A.: Secure Schemes for Secret Sharing and Key Distribution. PhD thesis, Technion - Israel Institute of Techonlogy (1996), Available on Internet, http://www.cs.bgu.ac.il/~beimel/pub.html
Blundo, C., De Santis, A., Di Crescenzo, G.: Multi-Secret sharing schemes. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 150–163. Springer, Heidelberg (1994)
Cramer, R., Damgard, I., Maurer, U.: General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316–334. Springer, Heidelberg (2000); Full version available from IACR eprint archive (2000)
Ding, C., Laihonen, T., Renvall, A.: Linear multi-secret sharing schemes and error-correcting codes. Journal of Universal Computer Science 3(9), 1023–1036 (1997)
Fehr, S.: Efficient Construction of Dual MSP (1999), (manuscript) Available on Internet, http://homepages.cwi.nl/~fehr/papers/Feh99.pdf
Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: Proceedings of the nineteenth annual ACM conference on Theory of computing, New York, United States, January 1987, pp. 218–229 (1987)
Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multi-party computation. Journal of Cryptology 13(1), 31–60 (2000)
Karchmer, M., Wigderson, A.: On span programs. In: Proc. 8th Ann. Symp. Structure in complexity Theory, pp. 102–111. IEEE, Los Alamitos (1993)
Xiao, L.: Secret sharing schemes: theory and application. PhD thesis, Academy of Mathematics and Systems Science, CAS (2004)
Xiao, L., Liu, M.: Linear Multi-secret sharing schemes. Science in China Ser. F Information Sciences 48(1), 125–136 (2005)
Yao, A.: Protocols for Secure Computation. In: Proc. of IEEE FOGS 1982, pp. 160–164 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Z., Liu, M., Xiao, L. (2005). Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes. In: Roy, B. (eds) Advances in Cryptology - ASIACRYPT 2005. ASIACRYPT 2005. Lecture Notes in Computer Science, vol 3788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11593447_9
Download citation
DOI: https://doi.org/10.1007/11593447_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30684-9
Online ISBN: 978-3-540-32267-2
eBook Packages: Computer ScienceComputer Science (R0)