Paper 2014/990

Combining Secret Sharing and Garbled Circuits for Efficient Private IEEE 754 Floating-Point Computations

Pille Pullonen and Sander Siim

Abstract

Two of the major branches in secure multi-party computation research are secret sharing and garbled circuits. This work succeeds in combining these to enable seamlessly switching to the technique more efficient for the required functionality. As an example, we add garbled circuits based IEEE 754 floating-point numbers to a secret sharing environment achieving very high efficiency and the first, to our knowledge, fully IEEE 754 compliant secure floating-point implementation.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
secure multi-party computationgarbled circuitssecret sharingfloating-point numbers
Contact author(s)
sander siim @ cyber ee
History
2014-12-18: received
Short URL
https://ia.cr/2014/990
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/990,
      author = {Pille Pullonen and Sander Siim},
      title = {Combining Secret Sharing and Garbled Circuits for Efficient Private {IEEE} 754 Floating-Point Computations},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/990},
      year = {2014},
      url = {https://eprint.iacr.org/2014/990}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.