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

Authors:
Peter Lory
Affiliations:
Universitat Regensburg, Germany
Venue:
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01
Year:
2007

Citing 0
Cited 2

Reducing the Complexity in the Distributed Computation of Private RSA Keys

ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Enhancing the efficiency in privacy preserving learning of decision trees in partitioned databases

PSD'12 Proceedings of the 2012 international conference on Privacy in Statistical Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multiparty multiplication of two polynomially shared values over \mathbb{Z}_q 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(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. The present paper reduces this complexity to O(n^{2}k +nk^2) by using Newton's classical interpolation formula. The impact of the new method on distributed signatures is outlined.