TY - GEN
T1 - An Efficient Secure Division Protocol Using Approximate Multi-bit Product and New Constant-Round Building Blocks
AU - Hiwatashi, Keitaro
AU - Ohata, Satsuya
AU - Nuida, Koji
N1 - Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - 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. 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.
AB - 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. 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.
UR - http://www.scopus.com/inward/record.url?scp=85091306665&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85091306665&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-57808-4_18
DO - 10.1007/978-3-030-57808-4_18
M3 - Conference contribution
AN - SCOPUS:85091306665
SN - 9783030578077
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 357
EP - 376
BT - Applied Cryptography and Network Security - 18th International Conference, ACNS 2020, Proceedings
A2 - Conti, Mauro
A2 - Zhou, Jianying
A2 - Casalicchio, Emiliano
A2 - Spognardi, Angelo
PB - Springer Science and Business Media Deutschland GmbH
T2 - 18th International Conference on Applied Cryptography and Network Security, ACNS 2020
Y2 - 19 October 2020 through 22 October 2020
ER -