Go to content
UR Home

Secure Distributed Computation of the Square Root and Applications

Liedel, Manuel (2012) Secure Distributed Computation of the Square Root and Applications. In: 8th International Conference on Information Security Practice and Experience (ISPEC 2012), 9.4-12.4.2012, Hangzhou, China. (In Press)

License: Publishing license for publications including print on demand
PDF - Accepted Version
Download (383kB)
Date of publication of this fulltext: 30 Mar 2012 06:18

Other URL: http://www.springerlink.com/content/r851464077t18162


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 ...


Export bibliographical data

Item type:Conference or workshop item (Paper)
Date:31 January 2012
Institutions:Business, Economics and Information Systems > Institut für Wirtschaftsinformatik > Alumni or Retired Professors > Professur für Wirtschaftsinformatik & Wirtschaftsmathematik (Prof. Dr. Peter Lory)
Projects:SECBIT - Ausbau der Kompetenzpartnerschaft zum Themenschwerpunkt "IT-Sicherheit" an den Standorten Passau und Regensburg
Interdisciplinary Subject Network:Not selected
Keywords:Square Root, Fixed-Point Arithmetic, Secure Computation, QR-Decomposition
Dewey Decimal Classification:000 Computer science, information & general works > 004 Computer science
300 Social sciences > 330 Economics
Status:In Press
Refereed:Yes, this version has been refereed
Created at the University of Regensburg:Yes
Item ID:23563
Owner only: item control page


Downloads per month over past year

  1. Homepage UR

University Library

Publication Server


Publishing: oa@ur.de

Dissertations: dissertationen@ur.de

Research data: daten@ur.de

Contact persons