Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values

The multiparty multiplication of two polynomially shared values over Zq with a public prime number q is an important module in distributed computations. The multiplication protocol of Gennaro, Rabin and Rabin (1998) is considered as the best protocol for this purpose. It requires a complexity of O(n2 k log n + nk2 ) bit-operations per player, where k is the bit size of the prime q and n is the number of players. The present paper reduces this complexity to O(n2 k + nk2 ) by using Newton’s classical interpolation formula. The impact of the new method on distributed signatures is outlined.

• Type: Conference
• Year: 2007
• Where: AINA
• Authors: Peter Lory
• Keywords: AINA 2007, Computer Networks, Multiparty Multiplication, Multiplication Protocol, Public Prime Number