Secure Division Protocol and Applications to Privacy-preserving Chi-squared Tests

Morita, Hiraku; Attrapadung, Nuttapong; Ohata, Satsuya; Nuida, Koji; Yamada, Shota; Shimizu, Kana; Hanaoka, Goichiro; Asai, Kiyoshi

doi:10.23919/isita.2018.8664337

Cited by 11 publications

(21 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our protocol only requires 31 communication rounds for 64-bit integers. This is about 64% smaller (87 → 31) than the previous result [12]. We show the theoretical and experimental evaluation of our protocol in Section 5.…”

Section: Our Proposed Arithmetic Overflow Detection Protocolmentioning

confidence: 66%

“…In the same way as the previous results [8]- [10], [12], we also start from the approach by Goldschmidt [19]. To compute the integer division / , the numerator and the denominator are iteratively multiplied by common factors in a way that the denominator converges to 1 so that the product at the numerator can be used as an approximated result.…”

Section: Secure Division Protocol Without Bit Expansionmentioning

confidence: 99%

“…To compute the integer division / , the numerator and the denominator are iteratively multiplied by common factors in a way that the denominator converges to 1 so that the product at the numerator can be used as an approximated result. To implement this method, the strategy of the previous result [12] is to make the approximation as good as possible and finally add an explicitly estimated correction term to obtain the exact result. However, the requirement of highly accurate approximation caused the following two inefficiency problems; the number of iterated products has to be large, and; for a better approximation of products of -bit values, intermediate values with not only -bit but 2bit or even higher accuracy have to be handled (e.g., 206-bit values were needed for 64-bit inputs).…”

Section: Secure Division Protocol Without Bit Expansionmentioning

confidence: 99%

“…Although there are some previous research results on secure division protocols [8]- [14], all of them are not efficient enough in practice. For example, in [12], we need 87 communication rounds to execute the secure division protocol for 64-bit integers. Moreover, we also need to expand the size of integers to 206-bit during the computation for controlling calculation errors correctly.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

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

Hiwatashi

Ohata²,

Nuida

2022

IEICE Trans. Fundamentals

Self Cite

View full text Add to dashboard Cite

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 Z 2 . 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.

show abstract

Section: Our Proposed Arithmetic Overflow Detection Protocolmentioning

confidence: 66%

Section: Secure Division Protocol Without Bit Expansionmentioning

confidence: 99%

Section: Secure Division Protocol Without Bit Expansionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Hiwatashi

Ohata²,

Nuida

2022

IEICE Trans. Fundamentals

Self Cite

View full text Add to dashboard Cite

show abstract

“…In 2018, Ohata and Morita [27] described a privacypreserving division protocol, with a trade-off between accuracy and efficiency, by approximating the reciprocal. At the same conference, together with other authors, they describe an exact division protocol with secret divisor, based on Goldschmidt's division algorithm, and apply it to Chi-squared tests [23].…”

Section: Related Work In Secure Integer Divisionmentioning

confidence: 99%

Secure integer division with a private divisor

Veugen

Abspoel

2021

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

We consider secure integer division within a secret-sharing based secure multi-party computation framework, where the dividend is secret-shared, but the divisor is privately known to a single party. We mention various applications where this situation arises. We give a solution within the passive security model, and extend this to the active model, achieving a complexity linear in the input bit length. We benchmark both solutions using the well-known MP-SPDZ framework in a cloud environment. Our integer division protocol with a private divisor clearly outperforms the secret divisor solution, both in runtime and communication complexity.

show abstract

An Efficient Secure Division Protocol Using Approximate Multi-bit Product and New Constant-Round Building Blocks

Hiwatashi

Ohata²,

Nuida

2020

Applied Cryptography and Network Security

View full text Add to dashboard Cite

Secure Division Protocol and Applications to Privacy-preserving Chi-squared Tests

Cited by 11 publications

References 12 publications

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

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

Secure integer division with a private divisor

An Efficient Secure Division Protocol Using Approximate Multi-bit Product and New Constant-Round Building Blocks

Contact Info

Product

Resources

About