TY - GEN
T1 - Efficiency and accuracy improvements of secure floating-point addition over secret sharing
AU - Sasaki, Kota
AU - Nuida, Koji
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2020.
PY - 2020
Y1 - 2020
N2 - 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 “roundTiesToEven” 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.
AB - 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 “roundTiesToEven” 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.
KW - Floating-point numbers
KW - Secret sharing
KW - Secure multiparty computation
UR - http://www.scopus.com/inward/record.url?scp=85091061859&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85091061859&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-58208-1_5
DO - 10.1007/978-3-030-58208-1_5
M3 - Conference contribution
AN - SCOPUS:85091061859
SN - 9783030582074
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 77
EP - 94
BT - Advances in Information and Computer Security - 15th International Workshop on Security, IWSEC 2020, Proceedings
A2 - Aoki, Kazumaro
A2 - Kanaoka, Akira
PB - Springer Science and Business Media Deutschland GmbH
T2 - 15th International Workshop on Security, IWSEC 2020
Y2 - 2 September 2020 through 4 September 2020
ER -