The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Vues en texte intégral
118
Dans le calcul multipartite sécurisé (MPC), les nombres à virgule flottante devraient être traités dans de nombreuses applications potentielles, mais celles-ci sont fondamentalement coûteuses. En particulier, pour les MPC basés sur le partage de secrets (SS), l'ajout en virgule flottante nécessite de nombreux cycles de communication bien que l'ajout soit l'opération la plus fondamentale. Dans cet article, nous proposons un protocole bipartite basé sur SS pour l'addition à virgule flottante avec 13 tours (pour les nombres simple/double précision), ce qui est bien inférieur aux travaux marquants d'Aliasgari et al. dans NDSS 2013 (34 et 36 tours, respectivement) et également moins que l'état de l'art de la littérature. De plus, contrairement aux protocoles existants basés sur SS qui sont tous basés sur le mode d'arrondi « roundTowardZero » dans la norme IEEE 754, nous proposons un autre protocole avec 15 tours qui est le premier résultat réalisant un mode d'arrondi « roundTiesToEven » plus précis. Nous discutons également des applications possibles de ce dernier protocole pour sécuriser les valeurs numériques validées (alias calcul rigoureux) en implémentant un exemple simple.
Kota SASAKI
The University of Tokyo
Koji NUIDA
Kyushu University,National Institute of Advanced Industrial Science and Technology (AIST)
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
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
Copier
@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},}
Copier
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 -