Paper 2014/221

Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations

Toomas Krips and Jan Willemson

Abstract

This paper develops a new hybrid model of floating point numbers suitable for operations in secure multi-party computations. The basic idea is to consider the significand of the floating point number as a fixed point number and implement elementary function applications separately of the significand. This gives the greatest performance gain for the power functions (e.g. inverse and square root), with computation speeds improving up to 18 times in certain configurations. Also other functions (like exponent and Gaussian error function) allow for the corresponding optimisation. We have proposed new polynomials for approximation, and implemented and benchmarked all our algorithms on the Sharemind secure multi-party computation framework.

Note: Fixed some minor errors. Updated publication history.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Minor revision. Information Security 17th International Conference, ISC 2014, Hong Kong, China, October 12-14, 2014. Proceedings
DOI
10.1007/978-3-319-13257-0
Keywords
cryptographic protocolssecret sharingmulti-party computations
Contact author(s)
toomaskrips @ gmail com
History
2014-12-23: last of 3 revisions
2014-03-27: received
See all versions
Short URL
https://ia.cr/2014/221
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/221,
      author = {Toomas Krips and Jan Willemson},
      title = {Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations},
      howpublished = {Cryptology ePrint Archive, Paper 2014/221},
      year = {2014},
      doi = {10.1007/978-3-319-13257-0},
      note = {\url{https://eprint.iacr.org/2014/221}},
      url = {https://eprint.iacr.org/2014/221}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.