Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Wireless Communications, Networking and Mobile Computing

Research on Secure Multi-Party Closest String Problem

Wen Liu, Yongbin Wang, Yizhen Cao

Published Sep 1, 2011• 0 citations
Publisher

Abstract

A secure two-party hamming distance computing protocol is proposed based on the secure two-party matrix product protocol; a secure four-party addition protocol, a secure three-party addition protocol and a secure two-party number protocol are proposed based on the additive homomorphic encryption and secure two-party compare protocol. A secure multi-party closest string protocol is presented based on the secure two-party hamming distance computing protocol and a secure multi-party addition protocol. These protocols are based on semi-honest model.

DOI
10.1109/wicom.2011.6040160

Related papers

Research on the Problem of Secure Multi-party Ranking Under Semi-honest Model

Bo Wu

Secure multi-party ranking is a problem generalized from the millionaires' problem,which can be used by n people to know about their secrets' order among all their inputs without leaking further information.Through the study on millionaires' protocol,we presented a secure two-party ranking protocol under semi-honest model based on homomorphic encryption.Then we generalized it to secure multi-party ranking,and we presented two algorithms whose efficiency are both improved.Finally,we gave a secure multi-party ranking protocol based on fuzzy nearness degree,and we analyzed the efficiency and security of these protocols.

Dianzi xuebao•Jan 1, 2008•3 citations

Secure multi-party multiplication protocol based on homomorphic encryption technology

Xia Cha

Secure multi-party multiplication is a special secure multi-party computation problem, which can be used by multi-party to share the multiplication result. Present protocols frequently using the secure two-party multiplication protocol which has high communication cost and large amount of data. Based on the homomorphic encryption technology, a serial secure multi-party multiplication protocol in the complex communication environment and a parallel secure multi-party multiplication protocol in the ideal communication environment are presented for this problem in the semi-honest model.At last, correctness and security of those protocols are analyzed. Compared with the present protocols, the analysis shows that the proposed protocols have better advantages in the communication cost and the execution efficiency.

Computer Engineering and Applications Journal•Jan 1, 2015•0 citations

Research of quantum secure multi-party ranking protocol

Liu Wen, Yongbin Wang

Secure multi-party ranking problem is used to rank n private integers without leaking further information. It is an extended problem of secure two-party comparing problem. A secure multi-party quantum ranking protocol in semi-honest model is presented based on the a quantum implicit module n+1 addition. The security for multi-parties of the protocol is analyzed.

Acta Physica Sinica•Jan 1, 2011•2 citations

Secure Multi-Party Comparing Protocol and Its Applications

Liu Wen, Yongbin Wang

The secure multi-party comparing problem is generalized from the millionaires' problem,which is used to get whether the multi-party's secret inputs are all equal and if not,the number of users whose inputs are same as an indicated user's.Based on the F function and semantic addition homomorphic encryption,a protocol of secure multi-party comparing is proposed.The correctness,security and efficiency of the protocol are analyzed.This protocol can be used in many aspects of secure multi-party computation.

Dianzi xuebao•Jan 1, 2012•1 citation

Secure two-party comparing protocol based on evaluation of encrypted functions

Liang Chen, Yong Xu

Secure two-party comparing is a special case and a basic module of secure computations,and is applied in mobile code and e-commerce security etc.But known solutions have some disadvantages:expensive costs of computing and communicating,limited ranges of compared numbers.Based on a modified ElGamal algorithm,this paper presented and proved multiplicative,mixed-multiplicative,additive and subtractive homomorphic cryptosystem.Constructed an encrypted function unknown by two-party using the homomorphic cryptosystem.Based on the homomorphic cryptosystem and evaluation of encrypted functions,designed secure two-party comparing protocol under semi-honest model.Proof,example and comparing with other protocols show the proposed protocol has the merits of security,fairness,lower costs of communication and computational complexity,and comparing integers.

Jisuanji yingyong yanjiu•Jan 1, 2010•0 citations

Research of secure two-party quantum comparing protocol

Liu Wen, Yongbin Wang

Secure two-party comparing problem is used to compare two private integer without further leaking of information. But in case of the quantum computer the currently available solutions become useless. A secure two-party quantum comparing protocol in semi-honest model is presented based on the a quantum implicit module n+1 addition. The security of the protocol is analyzed.

Acta Physica Sinica•Jan 1, 2011•2 citations
A secure two-party hamming distance computing protocol is proposed based on the secure two-party matrix product protocol; a secure four-party addition protocol, a secure three-party addition protocol and a secure two-party number protocol are proposed based on the additive homomorphic encryption and secure two-party compare protocol. A secure multi-party closest string protocol is presented based on the secure two-party hamming distance computing protocol and a secure multi-party addition protocol. These protocols are based on semi-honest model.
Secure multi-party ranking is a problem generalized from the millionaires' problem,which can be used by n people to know about their secrets' order among all their inputs without leaking further information.Through the study on millionaires' protocol,we presented a secure two-party ranking protocol under semi-honest model based on homomorphic encryption.Then we generalized it to secure multi-party ranking,and we presented two algorithms whose efficiency are both improved.Finally,we gave a secure multi-party ranking protocol based on fuzzy nearness degree,and we analyzed the efficiency and security of these protocols.
Secure multi-party multiplication is a special secure multi-party computation problem, which can be used by multi-party to share the multiplication result. Present protocols frequently using the secure two-party multiplication protocol which has high communication cost and large amount of data. Based on the homomorphic encryption technology, a serial secure multi-party multiplication protocol in the complex communication environment and a parallel secure multi-party multiplication protocol in the ideal communication environment are presented for this problem in the semi-honest model.At last, correctness and security of those protocols are analyzed. Compared with the present protocols, the analysis shows that the proposed protocols have better advantages in the communication cost and the execution efficiency.
The secure multi-party comparing problem is generalized from the millionaires' problem,which is used to get whether the multi-party's secret inputs are all equal and if not,the number of users whose inputs are same as an indicated user's.Based on the F function and semantic addition homomorphic encryption,a protocol of secure multi-party comparing is proposed.The correctness,security and efficiency of the protocol are analyzed.This protocol can be used in many aspects of secure multi-party computation.
Secure two-party comparing is a special case and a basic module of secure computations,and is applied in mobile code and e-commerce security etc.But known solutions have some disadvantages:expensive costs of computing and communicating,limited ranges of compared numbers.Based on a modified ElGamal algorithm,this paper presented and proved multiplicative,mixed-multiplicative,additive and subtractive homomorphic cryptosystem.Constructed an encrypted function unknown by two-party using the homomorphic cryptosystem.Based on the homomorphic cryptosystem and evaluation of encrypted functions,designed secure two-party comparing protocol under semi-honest model.Proof,example and comparing with other protocols show the proposed protocol has the merits of security,fairness,lower costs of communication and computational complexity,and comparing integers.