Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol

Nishide, Takashi; Ohta, Kazuo

doi:10.1007/978-3-540-71677-8_23

Cited by 184 publications

(190 citation statements)

References 23 publications

Supporting

Mentioning

188

Contrasting

Order By: Relevance

“…We note that using the ideas in [11], the round complexity of our private exponentiation protocols (as well as our public modulo reduction protocol) can be improved; the method is to use preprocessing, i.e. moving all the generation of (shared) random values (e.g.…”

Section: Discussionmentioning

confidence: 99%

“…By the detailed analysis in [11], we get to know that this protocol, denoted as Sec-Prod * (·) in this paper, can be realized in only 3 rounds and 5l multiplications.…”

Section: Known Primitivesmentioning

confidence: 99%

“…Independently and concurrently, Schoenmakers and Tuyls [16] solved the problem of BD for MPC based on (Paillier) threshold homomorphic cryptosystems [4,7] and they concern mainly about efficient variations of BD for practical use. In the work [11], Nishide and Ohta proposed solutions for interval test, comparison and equality test of shared secrets without relying on the expensive BD protocol although it seems necessary. Their ideas and techniques play an important role in our work.…”

Section: Related Workmentioning

confidence: 99%

“…Given a shared non-zero secret [x] p as input, the secure inversion protocol Sec-Inver(·) will output [x −1 mod p] p . This protocol will cost only 2 rounds and 2 multiplications [2,6,11].…”

Section: Known Primitivesmentioning

confidence: 99%

“…In [11], a linear protocol Equ-Zero(·) was proposed for testing whether a given secret [x] p is 0 or not, i.e. we have…”

Section: Known Primitivesmentioning

confidence: 99%

See 4 more Smart Citations

Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security

Ning

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Bit-decomposition is an important primitive in multi-party computation (MPC). With the help of bit-decomposition, we will be able to construct constant-rounds protocols for various MPC problems, such as equality test, comparison, public modulo reduction and private exponentiation, which are four main applications of bit-decomposition. However, when considering perfect security, bit-decomposition does not have a linear communication complexity; thus any protocols involving bitdecomposition inherit this inefficiency. Constructing protocols for MPC problems without relying on bit-decomposition is a meaningful work because this may provide us with perfectly secure protocols with linear communication complexity. It is already proved that equality test, comparison and public modulo reduction can be solved without involving bit-decomposition and the communication complexity can be reduced to linear. However, it remains an open problem whether private exponentiation could be done without relying on bit-decomposition. In this paper, maybe somewhat surprisingly, we show that it can. That is to say, we construct a constant-rounds, linear, perfectly secure protocol for private exponentiation without relying on bit-decomposition though it seems essential to this problem.In a recent work, Ning and Xu proposed a generalization of bitdecomposi-tion and, as a simplification of their generalization, they also proposed a linear protocol for public modulo reduction. In this paper, we show that their generalization can be further generalized; more importantly, as a simplification of our further generalization, we propose a public modulo reduction protocol which is more efficient than theirs.

show abstract

Section: Discussionmentioning

confidence: 99%

“…By the detailed analysis in [11], we get to know that this protocol, denoted as Sec-Prod * (·) in this paper, can be realized in only 3 rounds and 5l multiplications.…”

Section: Known Primitivesmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Known Primitivesmentioning

confidence: 99%

“…In [11], a linear protocol Equ-Zero(·) was proposed for testing whether a given secret [x] p is 0 or not, i.e. we have…”

Section: Known Primitivesmentioning

confidence: 99%

See 3 more Smart Citations

Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security

Ning

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Secure similarity coefficients computation for binary data and its extensions

Zhang

2013

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYSimilarity measures play an important role in classification problems, cluster analysis, and identification issues. This paper studies the secure similarity coefficients computation in the two‐party setting. Recently, a privacy‐preserving similarity coefficients protocol for binary data was proposed by Wong and Kim (Computers and Mathematics with Application 2012). We point out that their protocol is not secure, even in the semi‐honest model. In their protocol, the client can retrieve the inputs of the server without deviating from the protocol. Next, we propose a secure similarity coefficients computation protocol in the presence of malicious adversaries, which solves the same similarity coefficients functionality as that proposed by Wong and Kim. Meanwhile, we prove the protocol secure against the malicious adversaries by using the standard simulation‐based security definitions for secure two‐party computation. Also several extensions of our protocol for settling other specific problems are discussed. At last, we present a protocol computing the similarity coefficients with better privacy by using the secure integer division on ciphertexts. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Multiparty protocol that usually shuffles

Mardi

Tanwar

Howlader

2021

Security and Privacy

View full text Add to dashboard Cite

Multiparty computation is raising importance because its primary objective is to replace any trusted third party in the distributed computation. This work presents two multiparty shuffling protocols where each party, possesses a private input, agrees on a random permutation while keeping the permutation secret. The proposed shuffling protocols are based on permutation network, thereby data‐oblivious. The first proposal is n ‐permute that permutes n inputs in all n! possible ways. n‐permute network consists of 2logn−1 layers, and in each layer there are n/2 gates. Our second protocol is nπ‐permute shuffling that defines a permutation set Π=false{π1,…,πNfalse} where ∣Π∣

show abstract

Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol

Cited by 184 publications

References 23 publications

Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security

Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security

Secure similarity coefficients computation for binary data and its extensions

Multiparty protocol that usually shuffles

Contact Info

Product

Resources

About