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

Chinese Physics B

A rational quantum state sharing protocol with semi-off-line dealer

Huali Zhang, Bichen Che, Zhao Dou, Yu Yang, Xiu‐Bo Chen

Published Jan 24, 2022• 5 citations
Publisher

Abstract

A rational quantum state sharing protocol with the semi-off-line dealer is proposed. Firstly, the dealer Alice shares an arbitrary two-particle entangled state with the players by Einstein–Podolsky–Rosen (EPR) pairs and Greenberger–Horne–Zeilinger (GHZ) states. The EPR pairs are prepared by Charlie instead of the dealer, reducing the workload of the dealer. Secondly, all players have the same probability of reconstructing the quantum state, guaranteeing the fairness of the protocol. In addition, the dealer is semi-off-line, which considerably reduces the information exchanging between the dealer and the players. Finally, our protocol achieves security, fairness, correctness, and strict Nash equilibrium.

DOI
10.1088/1674-1056/ac4e02

Related papers

Using GHZ-State for Multiparty Quantum Secret Sharing Without Code Table

Yao–Hsin Chou, Shyi‐Ming Chen, Yu-Ting Lin +2 more

We proposed two multiparty quantum secret sharing schemes based on n-particle Greenberger–Horne–Zeilinger-states (GHZ states), which are transformed from Einstein–Podolsky–Rosen pairs by entanglement swapping. In our schemes, the dealer imposes messages by performing local unitary operations (I, σ x, iσ y, σ z) on the n-particle GHZ state she holds, and the agents collaborate to deduce the dealer's messages by performing local unitary operations on their own qubit. The amount of dealer's secret message is positively related with the number of agents. The need of qubits is one-third less than the former schemes and, also, they can be reused for the next new round. The scheme (II) does not have to pre-share the code table, which increases the security without the risk of being stolen.

The Computer Journal•Feb 1, 2012•13 citations

Quantum state sharing of an arbitrarym-particle state using Einstein–Podolsky–Rosen pairs and application in quantum voting

Comfort Sekga, Mhlambululi Mafu

In this paper, we propose a scheme where Alice shares an arbitrary m-particle unknown state with her agents, Bob and Charlie. Alice starts by distributing 2m Einstein–Podolsky–Rosen pairs with her agents and performs m joint three-particle Greenberger–Horne–Zeilinger state measurements on her particles. Bob, who acts as the controller, performs a product measurement [Formula: see text] on his m qubit states while Charlie retrieves the original state by performing unitary operations on his m particles. Subsequently, we demonstrate our proposed scheme’s feasibility by applying it in electronic voting by sharing an arbitrary single-particle state.

Modern Physics Letters A•Jul 10, 2021•5 citations

Proposal for quantum rational secret sharing

Arpita Maitra, Sourya Joyee De, Goutam Paul +1 more

A rational secret sharing scheme is a game in which each party responsible for reconstructing a secret tries to maximize his or her utility by obtaining the secret alone. Quantum secret sharing schemes, derived either from quantum teleportation or from quantum error correcting code, do not succeed when we assume rational participants. This is because all existing quantum secret sharing schemes consider that the secret is reconstructed by a party chosen by the dealer. In this paper, for the first time, we propose a quantum secret sharing scheme which is resistant to rational parties. The proposed scheme is fair (everyone gets the secret), is correct, and achieves strict Nash equilibrium.

arXiv:1501.04212•Physical Review A•Aug 4, 2015•55 citations

Rational secret sharing with semi-rational players

Yilei Wang, Hao Wang, Qiuliang Xu

Rational secret sharing, first introduced by Halpern and Teague, means that whether players send their shares relies on their utilities, whereas in traditional scheme, players are assumed to contribute their shares willingly. This paper puts forward a rational secret-sharing scheme where players run their reconstruction protocol in point-to-point communication networks other than broadcast channels which are often used in previous papers. Kol and Naor propose an efficient t -out-of- n protocol for rational secret sharing without using cryptographic primitives while it has weak robustness to coalition when short player colludes with any long players. The protocol proposed by Fuchsbauer and Katz runs efficiently in asynchronous or point-to-point networks. Although it achieves strict Nash equilibrium and is stable with respect to trembles, it is susceptible to realise fairness among the whole party. This paper proposes a rational secret-sharing scheme in point-to-point communication networks to achieve fairness and robustness to coalition.

International Journal of Grid and Utility Computing•Jan 1, 2012•5 citations

Semi-quantum Key Distribution Protocol Based on Bell States

Ting Wang, Dongning Zhao, Zhiwei Sun +1 more

A quantum key distribution protocol with traditional Bob has been proposed recently by Boyer et al. using single-particle state.In this paper, a semi-quantum key distribution protocol is described, in which Einstein-Podolsky-Rosen (EPR) pairs of particles are utilized to generate a secret key in remote places.This extends the quantum key distribution protocol with traditional Bob where the single-qubit channel is replaced by the entangled EPR-pair channel.And quantum Alice is able to do any quantum operations, preparing quantum states and performing quantum measurement, but traditional Bob is not able to prepare and measure a particle in the computational basis, reflect the particles.Furthermore, entanglement states are used in our protocol.The analysis shows that our protocol is secure, which can avoid the beam splitter attack automatically, and the proposed protocol is more efficient than Boyer's scheme.

International Journal of Security and Its Applications•Dec 31, 2016•1 citation

Semiquantum secret sharing using entangled states

Qin Li, Wai Hong Chan, Dongyang Long

Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be achieved when all the members are quantum. So what happens if not all the members are quantum? In this paper, we propose two semiquantum secret sharing protocols by using maximally entangled Greenberger-Horne-Zeilinger-type states in which quantum Alice shares a secret with two classical parties, Bob and Charlie, in a way that both parties are sufficient to obtain the secret, but one of them cannot. The presented protocols are also shown to be secure against eavesdropping.

arXiv:0906.1866•Physical Review A•Aug 4, 2010•187 citations
A rational quantum state sharing protocol with the semi-off-line dealer is proposed. Firstly, the dealer Alice shares an arbitrary two-particle entangled state with the players by Einstein–Podolsky–Rosen (EPR) pairs and Greenberger–Horne–Zeilinger (GHZ) states. The EPR pairs are prepared by Charlie instead of the dealer, reducing the workload of the dealer. Secondly, all players have the same probability of reconstructing the quantum state, guaranteeing the fairness of the protocol. In addition, the dealer is semi-off-line, which considerably reduces the information exchanging between the dealer and the players. Finally, our protocol achieves security, fairness, correctness, and strict Nash equilibrium.
We proposed two multiparty quantum secret sharing schemes based on n-particle Greenberger–Horne–Zeilinger-states (GHZ states), which are transformed from Einstein–Podolsky–Rosen pairs by entanglement swapping. In our schemes, the dealer imposes messages by performing local unitary operations (I, σ x, iσ y, σ z) on the n-particle GHZ state she holds, and the agents collaborate to deduce the dealer's messages by performing local unitary operations on their own qubit. The amount of dealer's secret message is positively related with the number of agents. The need of qubits is one-third less than the former schemes and, also, they can be reused for the next new round. The scheme (II) does not have to pre-share the code table, which increases the security without the risk of being stolen.
In this paper, we propose a scheme where Alice shares an arbitrary m-particle unknown state with her agents, Bob and Charlie. Alice starts by distributing 2m Einstein–Podolsky–Rosen pairs with her agents and performs m joint three-particle Greenberger–Horne–Zeilinger state measurements on her particles. Bob, who acts as the controller, performs a product measurement [Formula: see text] on his m qubit states while Charlie retrieves the original state by performing unitary operations on his m particles. Subsequently, we demonstrate our proposed scheme’s feasibility by applying it in electronic voting by sharing an arbitrary single-particle state.
A rational secret sharing scheme is a game in which each party responsible for reconstructing a secret tries to maximize his or her utility by obtaining the secret alone. Quantum secret sharing schemes, derived either from quantum teleportation or from quantum error correcting code, do not succeed when we assume rational participants. This is because all existing quantum secret sharing schemes consider that the secret is reconstructed by a party chosen by the dealer. In this paper, for the first time, we propose a quantum secret sharing scheme which is resistant to rational parties. The proposed scheme is fair (everyone gets the secret), is correct, and achieves strict Nash equilibrium.
Rational secret sharing, first introduced by Halpern and Teague, means that whether players send their shares relies on their utilities, whereas in traditional scheme, players are assumed to contribute their shares willingly. This paper puts forward a rational secret-sharing scheme where players run their reconstruction protocol in point-to-point communication networks other than broadcast channels which are often used in previous papers. Kol and Naor propose an efficient t -out-of- n protocol for rational secret sharing without using cryptographic primitives while it has weak robustness to coalition when short player colludes with any long players. The protocol proposed by Fuchsbauer and Katz runs efficiently in asynchronous or point-to-point networks. Although it achieves strict Nash equilibrium and is stable with respect to trembles, it is susceptible to realise fairness among the whole party. This paper proposes a rational secret-sharing scheme in point-to-point communication networks to achieve fairness and robustness to coalition.
A quantum key distribution protocol with traditional Bob has been proposed recently by Boyer et al. using single-particle state.In this paper, a semi-quantum key distribution protocol is described, in which Einstein-Podolsky-Rosen (EPR) pairs of particles are utilized to generate a secret key in remote places.This extends the quantum key distribution protocol with traditional Bob where the single-qubit channel is replaced by the entangled EPR-pair channel.And quantum Alice is able to do any quantum operations, preparing quantum states and performing quantum measurement, but traditional Bob is not able to prepare and measure a particle in the computational basis, reflect the particles.Furthermore, entanglement states are used in our protocol.The analysis shows that our protocol is secure, which can avoid the beam splitter attack automatically, and the proposed protocol is more efficient than Boyer's scheme.
Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be achieved when all the members are quantum. So what happens if not all the members are quantum? In this paper, we propose two semiquantum secret sharing protocols by using maximally entangled Greenberger-Horne-Zeilinger-type states in which quantum Alice shares a secret with two classical parties, Bob and Charlie, in a way that both parties are sufficient to obtain the secret, but one of them cannot. The presented protocols are also shown to be secure against eavesdropping.