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

Communications in computer and information science

Secure Multi-party Comparison Protocol and Application

Jing Zhang, Shoushan Luo, Yixian Yang

Published Jan 1, 2017• 1 citation
Publisher
DOI
10.1007/978-981-10-6385-5_25

Related papers

The oblivious comparison sorting protocols for secure multi-party computation

Koteswararao Ch, Kunwar Singh, Anoop Kumar

Multimedia Tools and Applications•Jan 27, 2024•0 citations

Private, secure and truthful multi-party protocols

Zhichao Zhao

•Jan 1, 2016•0 citations

A Taxonomy of Secure Two-Party Comparison Protocols and Efficient Constructions

Nuttapong Attrapadung, Goichiro Hanaoka, Shinsaku Kiyomoto +2 more

Secure two-party comparison plays a crucial role in many privacy-preserving applications, such as privacy-preserving data mining and machine learning. In particular, the available comparison protocols with the appropriate input/output configuration have a significant impact on the performance of these applications. In this paper, we firstly describe a taxonomy of secure two-party comparison protocols which allows us to describe the different configurations used for these protocols in a systematic manner. This taxonomy leads to a total of 216 types of comparison protocols.We then describe conversions among these types. While these conversions are based on known techniques and have explicitly or implicitly been considered previously, we show that a combination of these conversion techniques can be used to convert a perhaps less-known two-party comparison protocol by Nergiz et al. (IEEE SocialCom 2010) into a very efficient protocol in a configuration where the two parties hold shares of the values being compared, and obtain a share of the comparison result. This setting is often used in multi-party computation protocols, and hence in many privacy-preserving applications as well. We furthermore implement the protocol and measure its performance. Our measurement suggests that the protocol outperforms the previously proposed protocols for this input/output configuration, when off-line pre-computation is not permitted.

Conference on Privacy, Security and Trust•Aug 1, 2017•10 citations

A Taxonomy of Secure Two-Party Comparison Protocols and Efficient Constructions

Nuttapong Attrapadung, Goichiro Hanaoka, Shinsaku Kiyomoto +2 more

Secure two-party comparison plays a crucial role in many privacy-preserving applications, such as privacy-preserving data mining and machine learning. In particular, the available comparison protocols with the appropriate input/output configuration have a significant impact on the performance of these applications. In this paper, we firstly describe a taxonomy of secure two-party comparison protocols which allows us to describe the different configurations used for these protocols in a systematic manner. This taxonomy leads to a total of 216 types of comparison protocols. We then describe conversions among these types. While these conversions are based on known techniques and have explicitly or implicitly been considered previously, we show that a combination of these conversion techniques can be used to convert a perhaps less-known two-party comparison protocol by Nergiz et al. (IEEE SocialCom 2010) into a very efficient protocol in a configuration where the two parties hold shares of the values being compared, and obtain a share of the comparison result. This setting is often used in multi-party computation protocols, and hence in many privacy-preserving applications as well. We furthermore implement the protocol and measure its performance. Our measurement suggests that the protocol outperforms the previously proposed protocols for this input/output configuration, when off-line pre-computation is not permitted.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Aug 31, 2019•1 citation

Multi-party private comparison protocol for a malicious third party without pre-shared keys

Qiuyu Ma, Jiansheng Guo, Li Zhang

Quantum Information Processing•May 9, 2026•0 citations

An attempt at universal quantum secure multi-party computation with graph state

Zhao Dou, Xiu‐Bo Chen, Gang Xu +3 more

Abstract Quantum secure multi-party computation (SMC) is a vital field in quantum cryptography. In this paper, we try to resolve SMC problems universally via graph states. Firstly, three kinds of quantum SMC protocols are investigated, which are quantum private comparison protocol, quantum millionaire protocol and quantum multi-party summation protocol. Secondly, three proposed protocols are reviewed, and then the core of them is summarized. We further find that the computation, deduced as modulo subtraction, can be resolved by using graph state. This implies that our protocols are universal in part and will be widely applicable. Thirdly, analyses show that the proposed protocols are correct and secure. Our research will promote the development of quantum secure multi-party computation.

Physica Scripta•Feb 7, 2020•5 citations
Secure two-party comparison plays a crucial role in many privacy-preserving applications, such as privacy-preserving data mining and machine learning. In particular, the available comparison protocols with the appropriate input/output configuration have a significant impact on the performance of these applications. In this paper, we firstly describe a taxonomy of secure two-party comparison protocols which allows us to describe the different configurations used for these protocols in a systematic manner. This taxonomy leads to a total of 216 types of comparison protocols.We then describe conversions among these types. While these conversions are based on known techniques and have explicitly or implicitly been considered previously, we show that a combination of these conversion techniques can be used to convert a perhaps less-known two-party comparison protocol by Nergiz et al. (IEEE SocialCom 2010) into a very efficient protocol in a configuration where the two parties hold shares of the values being compared, and obtain a share of the comparison result. This setting is often used in multi-party computation protocols, and hence in many privacy-preserving applications as well. We furthermore implement the protocol and measure its performance. Our measurement suggests that the protocol outperforms the previously proposed protocols for this input/output configuration, when off-line pre-computation is not permitted.
Secure two-party comparison plays a crucial role in many privacy-preserving applications, such as privacy-preserving data mining and machine learning. In particular, the available comparison protocols with the appropriate input/output configuration have a significant impact on the performance of these applications. In this paper, we firstly describe a taxonomy of secure two-party comparison protocols which allows us to describe the different configurations used for these protocols in a systematic manner. This taxonomy leads to a total of 216 types of comparison protocols. We then describe conversions among these types. While these conversions are based on known techniques and have explicitly or implicitly been considered previously, we show that a combination of these conversion techniques can be used to convert a perhaps less-known two-party comparison protocol by Nergiz et al. (IEEE SocialCom 2010) into a very efficient protocol in a configuration where the two parties hold shares of the values being compared, and obtain a share of the comparison result. This setting is often used in multi-party computation protocols, and hence in many privacy-preserving applications as well. We furthermore implement the protocol and measure its performance. Our measurement suggests that the protocol outperforms the previously proposed protocols for this input/output configuration, when off-line pre-computation is not permitted.
Abstract Quantum secure multi-party computation (SMC) is a vital field in quantum cryptography. In this paper, we try to resolve SMC problems universally via graph states. Firstly, three kinds of quantum SMC protocols are investigated, which are quantum private comparison protocol, quantum millionaire protocol and quantum multi-party summation protocol. Secondly, three proposed protocols are reviewed, and then the core of them is summarized. We further find that the computation, deduced as modulo subtraction, can be resolved by using graph state. This implies that our protocols are universal in part and will be widely applicable. Thirdly, analyses show that the proposed protocols are correct and secure. Our research will promote the development of quantum secure multi-party computation.