Efficiency and Accuracy Improvements of Secure Floating-Point Addition over Secret Sharing

Kota Sasaki, Koji Nuida

Research output: Contribution to journalArticlepeer-review


In secure multiparty computation (MPC), floating-point numbers should be handled in many potential applications, but these are basically expensive. In particular, for MPC based on secret sharing (SS), the floating-point addition takes many communication rounds though the addition is the most fundamental operation. In this paper, we propose an SS-based two-party protocol for floating-point addition with 13 rounds (for single/double precision numbers), which is much fewer than the milestone work of Aliasgari et al. in NDSS 2013 (34 and 36 rounds, respectively) and also fewer than the state of the art in the literature. Moreover, in contrast to the existing SS-based protocols which are all based on "roundTowardZero" rounding mode in the IEEE 754 standard, we propose another protocol with 15 rounds which is the first result realizing more accurate "roundTiesTo- Even" rounding mode. We also discuss possible applications of the latter protocol to secure Validated Numerics (a.k.a. Rigorous Computation) by implementing a simple example.

Original languageEnglish
Pages (from-to)231-241
Number of pages11
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number3
Publication statusPublished - 2022

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Efficiency and Accuracy Improvements of Secure Floating-Point Addition over Secret Sharing'. Together they form a unique fingerprint.

Cite this