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

Keitaro Hiwatashi, Satsuya Ohata, Koji Nuida

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)404-416
Number of pages13
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE105A
Issue number3
DOIs
Publication statusPublished - 2022

All Science Journal Classification (ASJC) codes

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

Fingerprint

Dive into the research topics of 'An Efficient Secure Division Protocol Using Approximate Multi-Bit Product and New Constant-Round Building Blocks_'. Together they form a unique fingerprint.

Cite this