An Efficient Secure Division Protocol Using Approximate Multi-Bit Product and New Constant-Round Building Blocks_

Keitaro Hiwatashi, Satsuya Ohata, Koji Nuida

研究成果: ジャーナルへの寄稿学術誌査読

抄録

Integer division is one of the most fundamental arithmetic operators and is ubiquitously used. However, the existing division protocols in secure multi-party computation (MPC) are inefficient and very complex, and this has been a barrier to applications of MPC such as secure machine learning. We already have some secure division protocols working in Z2n . However, these existing results have drawbacks that those protocols needed many communication rounds and needed to use bigger integers than in/output. In this paper, we improve a secure division protocol in two ways. First, we construct a new protocol using only the same size integers as in/output. Second, we build efficient constant-round building blocks used as subprotocols in the division protocol. With these two improvements, communication rounds of our division protocol are reduced to about 36% (87 rounds ! 31 rounds) for 64-bit integers in comparison with the most efficient previous one.

本文言語英語
ページ(範囲)404-416
ページ数13
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E105A
3
DOI
出版ステータス出版済み - 2022

!!!All Science Journal Classification (ASJC) codes

  • 信号処理
  • コンピュータ グラフィックスおよびコンピュータ支援設計
  • 電子工学および電気工学
  • 応用数学

フィンガープリント

「An Efficient Secure Division Protocol Using Approximate Multi-Bit Product and New Constant-Round Building Blocks_」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル