A Note on Secure Multiparty Multiplication
Peter Lory, Jürgen Wenzl · University of Regensburg Publication Server (University of Regensburg) · 2011
The protocol of Gennaro, Rabin and Rabin (1998) is a well known and efficient protocol for the secure multiparty multiplication of two polynomially shared values over Zq with a public prime number q.It requires O(n 2 k log n + nk 2 ) bit-operations per player, where k is the bit size of the prime q and n is the number of players.In previous papers (2007, 2009), the first author has presented modifications of this protocol, that reduces its complexity to O(n 2 k) .The present report gives an additional modification and compares the running times for these variants by numerical experiments.