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

arXiv:0906.2297 · Physical Review A

Secure multiparty computation with a dishonest majority via quantum means

Klearchos Loukopoulos, Dan E. Browne

Published Jun 25, 2010• 26 citations
arXivHTMLPDF

Abstract

We introduce a scheme for secure multiparty computation utilizing the quantum correlations of entangled states. First we present a scheme for two-party computation, exploiting the correlations of a Greenberger-Horne-Zeilinger state to provide, with the help of a third party, a near-private computation scheme. We then present a variation of this scheme which is passively secure with threshold $t=2$, in other words, remaining secure when pairs of players conspire together provided they faithfully follow the protocol. Furthermore, we show that the passively secure variant can be modified to be secure when cheating parties are allowed to deviate from the protocol. We show that this can be generalized to computations of $n$-party polynomials of degree 2 with a threshold of $n\ensuremath{-}1$. The threshold achieved is significantly higher than the best known classical threshold, which satisfies the bound $t<n/2$. Our schemes, each complying with a different definition of security, shed light on which physical assumptions are necessary in order to achieve quantum secure multiparty computation.

DOI
10.1103/physreva.81.062336

Related papers

Comment on “Secure multiparty computation with a dishonest majority via quantum means”

Yanbing Li, Qiaoyan Wen, Su‐Juan Qin

In a recent paper [K. Loukopoulos and D. E. Browne, Phys. Rev. A 81, 062336 (2010)], five schemes for secure multiparty computation utilizing the Greenberger-Horne-Zeilinger (GHZ) quantum correlation were presented, which were claimed to be secure in some kinds of security models. However, this study points out that schemes C and D2 could be attacked by corrupted parties replacing photon and exchanging classical information.

Physical Review A•Jul 27, 2011•14 citations

Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority

Michael Ben-Or, Claude Crépeau, Daniel Gottesman +2 more

Secret sharing and multiparty computation (also called "secure function evaluation") are fundamental primitives in modern cryptography, allowing a group of mutually distrustful players to perform correct, distributed computations under the sole assumption that some number of them will follow the protocol honestly. This paper investigates how much trust is necessary -- that is, how many players must remain honest -- in order for distributed quantum computations to be possible. We present a verifiable quantum secret sharing (VQSS) protocol, and a general secure multiparty quantum computation (MPQC) protocol, which can tolerate any \left[ {\frac{{n - 1}} {2}} \right] cheaters among n players. Previous protocols for these tasks tolerated \left[ {\frac{{n - 1}} {4}} \right] and \left[ {\frac{{n - 1}} {6}} \right] cheaters, respectively. The threshold we achieve is tight -- even in the classical case, "fair" multiparty computation is not possible if any set of n/2 players can cheat. Our protocols rely on approximate quantum errorcorrecting codes, which can tolerate a larger fraction of errors than traditional, exact codes. We introduce new families of authentication schemes and approximate codes tailored to the needs of our protocols, as well as new state purification techniques along the lines of those used in faulttolerant quantum circuits.

arXiv:0801.1544•Annual Symposium on Foundations of Computer Science•Jan 1, 2006•102 citations

Secure two-party computation via measurement-based quantum computing

Zeinab Rahmani, Armando N. Pinto, Luís Soares Barbosa

Abstract Secure multiparty computation (SMC) provides collaboration among multiple parties, ensuring the confidentiality of their private information. However, classical SMC implementations encounter significant security and efficiency challenges. Resorting to the entangled Greenberger–Horne–Zeilinger (GHZ) state, we propose a quantum-based two-party protocol to compute binary Boolean functions, with the help of a third party. We exploit a technique in which a random Z-phase rotation on the GHZ state is performed to achieve higher security. The security and complexity analyses demonstrate the feasibility and improved security of our scheme compared to other SMC Boolean function computation methods. Additionally, we implemented the proposed protocol on the IBM QisKit and found consistent outcomes that validate the protocol’s correctness.

Quantum Information Processing•Jun 1, 2024•1 citation

Temporary Assumptions for Quantum Multiparty Secure Computations

Joern Mueller-Quade, Hideki Imai

This paper introduces quantum multiparty protocols which allow the use of temporary assumptions. We prove that secure quantum multiparty computations are possible if and only if classical multi party computations work. But these strict assumptions are necessary only during the execution of the protocol and can be loosened after termination of the protocol. We consider two settings: 1. A collusion of players tries to learn the secret inputs of honest players or tries to modify the result of the computation. 2. A collusion of players cheats in the above way or tries to disrupt the protocol, i.e., the collusion tries to abort the computation or leaks information to honest players. We give bounds on the collusions tolerable after a protocol has terminated and we state protocols reaching these bounds.

arXiv:quant-ph/0010112•Oct 31, 2000•9 citations

Quantum Security Multi-Party Extremum Protocol with Greenberger–Horne–Zeilinger States

Ping Wang, Gongde Guo, Shuxin Lin +2 more

Secure multi-party extremum, as a significant offshoot of secure multi-party computation, has extensive applications in various domains, including healthcare, financial transactions, market analysis, sports events, etc. Nevertheless, most existing secure multi-party extremum protocols rely on computational hard problems and are thus vulnerable to quantum algorithms. This paper presents a quantum secure multi-party extremum protocol that is built upon the correlations of Greenberger–Horne–Zeilinger (GHZ) states. Within this protocol, multiple participants, with the aid of a semi-honest third party, can obtain the maximum and minimum values of their secret inputs. GHZ states act as the information carriers and are transmitted among the participants and the third party. Their unique correlations ensure the secure transmission of quantum particles. The analysis demonstrates that the proposed protocol is capable of not only warding off common external attacks but also resisting internal attacks launched by dishonest participants and the semi-honest third party. Moreover, the protocol boasts correctness and high scalability.

Technologies•Sep 24, 2025•0 citations

Quantum And Relativistic Protocols For Secure Multi-Party Computation

Roger Colbeck

After a general introduction, the thesis is divided into four parts. In the first, we discuss the task of coin tossing, principally in order to highlight the effect different physical theories have on security in a straightforward manner, but, also, to introduce a new protocol for non-relativistic strong coin tossing. This protocol matches the security of the best protocol known to date while using a conceptually different approach to achieve the task. In the second part variable bias coin tossing is introduced. This is a variant of coin tossing in which one party secretly chooses one of two biased coins to toss. It is shown that this can be achieved with unconditional security for a specified range of biases, and with cheat-evident security for any bias. We also discuss two further protocols which are conjectured to be unconditionally secure for any bias. The third section looks at other two-party secure computations for which, prior to our work, protocols and no-go theorems were unknown. We introduce a general model for such computations, and show that, within this model, a wide range of functions are impossible to compute securely. We give explicit cheating attacks for such functions. In the final chapter we discuss the task of expanding a private random string, while dropping the usual assumption that the protocol's user trusts her devices. Instead we assume that all quantum devices are supplied by an arbitrarily malicious adversary. We give two protocols that we conjecture securely perform this task. The first allows a private random string to be expanded by a finite amount, while the second generates an arbitrarily large expansion of such a string.

arXiv:0911.3814•Nov 19, 2009•494 citations
We introduce a scheme for secure multiparty computation utilizing the quantum correlations of entangled states. First we present a scheme for two-party computation, exploiting the correlations of a Greenberger-Horne-Zeilinger state to provide, with the help of a third party, a near-private computation scheme. We then present a variation of this scheme which is passively secure with threshold t=2t=2t=2, in other words, remaining secure when pairs of players conspire together provided they faithfully follow the protocol. Furthermore, we show that the passively secure variant can be modified to be secure when cheating parties are allowed to deviate from the protocol. We show that this can be generalized to computations of nnn-party polynomials of degree 2 with a threshold of n\ensuremath−1n\ensuremath{-}1n\ensuremath−1. The threshold achieved is significantly higher than the best known classical threshold, which satisfies the bound t<n/2t<n/2t<n/2. Our schemes, each complying with a different definition of security, shed light on which physical assumptions are necessary in order to achieve quantum secure multiparty computation.
Secret sharing and multiparty computation (also called "secure function evaluation") are fundamental primitives in modern cryptography, allowing a group of mutually distrustful players to perform correct, distributed computations under the sole assumption that some number of them will follow the protocol honestly. This paper investigates how much trust is necessary -- that is, how many players must remain honest -- in order for distributed quantum computations to be possible. We present a verifiable quantum secret sharing (VQSS) protocol, and a general secure multiparty quantum computation (MPQC) protocol, which can tolerate any \left[ {\frac{{n - 1}} {2}} \right] cheaters among n players. Previous protocols for these tasks tolerated \left[ {\frac{{n - 1}} {4}} \right] and \left[ {\frac{{n - 1}} {6}} \right] cheaters, respectively. The threshold we achieve is tight -- even in the classical case, "fair" multiparty computation is not possible if any set of n/2 players can cheat. Our protocols rely on approximate quantum errorcorrecting codes, which can tolerate a larger fraction of errors than traditional, exact codes. We introduce new families of authentication schemes and approximate codes tailored to the needs of our protocols, as well as new state purification techniques along the lines of those used in faulttolerant quantum circuits.
Abstract Secure multiparty computation (SMC) provides collaboration among multiple parties, ensuring the confidentiality of their private information. However, classical SMC implementations encounter significant security and efficiency challenges. Resorting to the entangled Greenberger–Horne–Zeilinger (GHZ) state, we propose a quantum-based two-party protocol to compute binary Boolean functions, with the help of a third party. We exploit a technique in which a random Z-phase rotation on the GHZ state is performed to achieve higher security. The security and complexity analyses demonstrate the feasibility and improved security of our scheme compared to other SMC Boolean function computation methods. Additionally, we implemented the proposed protocol on the IBM QisKit and found consistent outcomes that validate the protocol’s correctness.
This paper introduces quantum multiparty protocols which allow the use of temporary assumptions. We prove that secure quantum multiparty computations are possible if and only if classical multi party computations work. But these strict assumptions are necessary only during the execution of the protocol and can be loosened after termination of the protocol. We consider two settings: 1. A collusion of players tries to learn the secret inputs of honest players or tries to modify the result of the computation. 2. A collusion of players cheats in the above way or tries to disrupt the protocol, i.e., the collusion tries to abort the computation or leaks information to honest players. We give bounds on the collusions tolerable after a protocol has terminated and we state protocols reaching these bounds.
Secure multi-party extremum, as a significant offshoot of secure multi-party computation, has extensive applications in various domains, including healthcare, financial transactions, market analysis, sports events, etc. Nevertheless, most existing secure multi-party extremum protocols rely on computational hard problems and are thus vulnerable to quantum algorithms. This paper presents a quantum secure multi-party extremum protocol that is built upon the correlations of Greenberger–Horne–Zeilinger (GHZ) states. Within this protocol, multiple participants, with the aid of a semi-honest third party, can obtain the maximum and minimum values of their secret inputs. GHZ states act as the information carriers and are transmitted among the participants and the third party. Their unique correlations ensure the secure transmission of quantum particles. The analysis demonstrates that the proposed protocol is capable of not only warding off common external attacks but also resisting internal attacks launched by dishonest participants and the semi-honest third party. Moreover, the protocol boasts correctness and high scalability.
After a general introduction, the thesis is divided into four parts. In the first, we discuss the task of coin tossing, principally in order to highlight the effect different physical theories have on security in a straightforward manner, but, also, to introduce a new protocol for non-relativistic strong coin tossing. This protocol matches the security of the best protocol known to date while using a conceptually different approach to achieve the task. In the second part variable bias coin tossing is introduced. This is a variant of coin tossing in which one party secretly chooses one of two biased coins to toss. It is shown that this can be achieved with unconditional security for a specified range of biases, and with cheat-evident security for any bias. We also discuss two further protocols which are conjectured to be unconditionally secure for any bias. The third section looks at other two-party secure computations for which, prior to our work, protocols and no-go theorems were unknown. We introduce a general model for such computations, and show that, within this model, a wide range of functions are impossible to compute securely. We give explicit cheating attacks for such functions. In the final chapter we discuss the task of expanding a private random string, while dropping the usual assumption that the protocol's user trusts her devices. Instead we assume that all quantum devices are supplied by an arbitrarily malicious adversary. We give two protocols that we conjecture securely perform this task. The first allows a private random string to be expanded by a finite amount, while the second generates an arbitrarily large expansion of such a string.