The square root is an important mathematical primitive whose secure, efficient, distributed computation has so far not been possible. We present a solution to this problem based on Goldschmidt's algorithm. The starting point is computed by linear approximation of the normalized input using carefully chosen coefficients. The whole algorithm is presented in the fixed-point arithmetic framework of Catrina/Saxena for secure computation. Experimental results demonstrate the feasibility of our algorithm and we show applicability by using our protocol as a building block for a secure QR-Decomposition of a rational-valued matrix. © 2012 Springer-Verlag.
CITATION STYLE
Liedel, M. (2012). Secure distributed computation of the square root and applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7232 LNCS, pp. 277–288). https://doi.org/10.1007/978-3-642-29101-2_19
Mendeley helps you to discover research relevant for your work.