Atomic Secure Multi-party Multiplication with Low Communication
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical variation on one of the central techniques in the foundational results of Ben-Or, Goldwasser, and Wigderson and Chaum, Crépeau, and Damgaard on secure multi-party computation. Rabin’s idea is a key ingredient to virtually all practical protocols in threshold cryptography.
Given a passive t-adversary in the secure channels model with synchronous communication, for example, secure multiplication of two secret-shared elements from a finite field K based on this idea uses one communication round and has the network exchange O(n 2) field elements, if t = Θ(n) and t < n/2 and if n is the number of players. This is because each of O(n) players must perform Shamir secret sharing as part of the protocol. This paper demonstrates that under a few restrictions much more efficient protocols are possible; even at the level of a single multiplication.
We demonstrate a twist on Rabin’s idea that enables one-round secure multiplication with just O(n) bandwidth in certain settings, thus reducing it from quadratic to linear. The ideas involved can additionally be employed in the evaluation of arithmetic circuits, where under appropriate circumstances similar efficiency gains can be obtained.
- 1.Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of STOC 1988, pp. 1–10. ACM Press, New York (1988)Google Scholar
- 2.Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings Proceedings of National Computer Conference ’79. AFIPS Proceedings, vol. 48, pp. 313–317 (1979)Google Scholar
- 3.Chaum, D., Crépeau, C., Damgaard, I.: Multi-party unconditionally secure protocols. In: Proceedings of STOC 1988, pp. 11–19. ACM Press, New York (1988)Google Scholar
- 6.Cramer, R., Kiltz, E., Padró, C.: A Note on Secure Computation of the Moore-Penrose and Its Application to Secure Linear Algebra. Manuscript (2006)Google Scholar
- 7.Franklin, M., Yung, M.: Communication complexity of secure computation. In: Proceedings of STOC 1992, pp. 699–710. ACM Press, New York (1992)Google Scholar
- 8.Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In: Proceedings of STOC 2001, pp. 580–589. ACM Press, New York (2001)Google Scholar
- 9.Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fasttrack multiparty computations with applications to threshold cryptography. In: Proceedings of PODC 1997, pp. 101–111 (1998)Google Scholar