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

Kota SASAKI; Koji NUIDA

doi:10.1587/transfun.2021CIP0013

IEICE TRANSACTIONS on Fundamentals

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

Kota SASAKI, Koji NUIDA

Full Text Views

66

Cite this

Free PDF (930.8KB)

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E105-A No.3 pp.231-241

Publication Date: 2022/03/01

Publicized: 2021/09/09

Online ISSN: 1745-1337

DOI: 10.1587/transfun.2021CIP0013

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category

Authors

Kota SASAKI
The University of Tokyo
Koji NUIDA
Kyushu University,National Institute of Advanced Industrial Science and Technology (AIST)

Keyword

secure multiparty computation, floating-point numbers, secret sharing

Cite this

Copy

Kota SASAKI, Koji NUIDA, "Efficiency and Accuracy Improvements of Secure Floating-Point Addition over Secret Sharing" in IEICE TRANSACTIONS on Fundamentals, vol. E105-A, no. 3, pp. 231-241, March 2022, doi: 10.1587/transfun.2021CIP0013.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2021CIP0013/_p

Copy

@ARTICLE{e105-a_3_231,
author={Kota SASAKI, Koji NUIDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficiency and Accuracy Improvements of Secure Floating-Point Addition over Secret Sharing},
year={2022},
volume={E105-A},
number={3},
pages={231-241},
abstract={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.},
keywords={},
doi={10.1587/transfun.2021CIP0013},
ISSN={1745-1337},
month={March},}

Copy

TY - JOUR
TI - Efficiency and Accuracy Improvements of Secure Floating-Point Addition over Secret Sharing
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 231
EP - 241
AU - Kota SASAKI
AU - Koji NUIDA
PY - 2022
DO - 10.1587/transfun.2021CIP0013
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E105-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2022
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.
ER -

IEICE TRANSACTIONS on Fundamentals