Rational participants want to maximize their benefits. The protocol with rational participants will be more realistic than the protocol with honest, semi-honest and dishonest participants. We research the rational non-hierarchical quantum state sharing in this paper. General steps of some known quantum state sharing protocol are summarized. Based on these steps, a new rational protocol is proposed. It means that lots of common protocols could be modified to rational protocols. Our protocol is widely applicable. Analyses show that the proposed protocol is rational and secure. It is also all-win for agents. Furthermore, number of deceiving agents is considered to redefine the utilities of agents.
Rational participants want to maximize their benefits. The protocol with rational participants will be more realistic than the protocol with honest, semi-honest and dishonest participants. We research the rational non-hierarchical quantum state sharing in this paper. General steps of some known quantum state sharing protocol are summarized. Based on these steps, a new rational protocol is proposed. It means that lots of common protocols could be modified to rational protocols. Our protocol is widely applicable. Analyses show that the proposed protocol is rational and secure. It is also all-win for agents. Furthermore, number of deceiving agents is considered to redefine the utilities of agents.
The traditional quantum secret sharing does not succeed in the presence of rational participants. A rational participant's motivation is to maximize his utility, and will try to get the secret alone. Therefore, in the reconstruction, no rational participant will send his share to others. To tackle with this problem, we propose a rational quantum secret sharing scheme in this paper. We adopt the game theory to analyze the behavior of rational participants and design a protocol to prevent them from deviating from the protocol. As proved, the rational participants can gain their maximal utilities when they perform the protocol faithfully, and the Nash equilibrium of the protocol is achieved. Compared to the traditional quantum secret sharing schemes, our scheme is fairer and more robust in practice.
ABSTRACT Quantum secret sharing (QSS) holds a significant place in quantum cryptography. Unlike traditional QSS schemes, which often simplistically model participants as either completely honest or fully malicious, rational QSS introduces a more realistic framework by modeling participants as rational entities who strategically act to maximize their own utility. In this paper, for the first time, a rational quantum multi‐secret sharing scheme designed to share a classical bit string by configuring multiple effective reconstruction rounds is proposed. Further, a novel method is proposed to facilitate equilibrium achievement—deception deterrence. In terms of efficiency, the scheme achieves, for the first time, an effective reconstruction round ratio and a communication efficiency are independent of the total number of reconstruction rounds configured in the scheme, overcoming the communication efficiency limitation inherent in existing schemes. In terms of equilibrium achievement, the proposed new method not only returns to the essence of strategic interaction among rational participants themselves but also avoids the substantial verification cost.
Abstract Hierarchical quantum state sharing (HQSTS) provides a way for the quantum state from one party to another among multiple parties asymmetrically. In the process, it is necessary to ensure the legitimacy and authenticity of participants to defend against attacks caused by neglecting authentication. Hence, we propose a three-phase probabilistic HQSTS protocol with identity authentication. Firstly, the legitimacy of participants is verified in the identity authentication phase, which effectively prevents impersonation and deception. Secondly, the sender Alice sends the target quantum state to three agents asymmetrically, which implies that there is a hierarchy of agents regarding their ability to recover the secret state. The high authority agent can recover the state without the cooperation of all agents, while the low authority agent has to recover the state with the cooperation of all agents. Thirdly, based on the non-maximally entangled cluster states, the sharing of the arbitrary three-qubit states is realized, which increases the amount of information transmitted. Using the Qiskit framework, the quantum circuit and simulation results for a particular case are given to verify the feasibility and correctness of our protocol. Moreover, the security of the protocol is analyzed from the perspective of both internal and external attacks.
In the setting of ( , ) mn rational secret sharing, n rational players wish to share a secret s , arbitrarily m players can reconstruct it, they always choose the strategies which can bring them more utilities.The security requirement includes privacy, correctness and fairness.Fairness is a central objective of the rational secret sharing scheme, complete fair means either all players get the secret s or none of them get it, but most existing schemes do not meet this nature.In this work, a rational secret sharing protocol is proposed, which neither need particular communication channel, nor assume the existence of honest minority, in addition, the scheme can resist the collusion attack with () k k m players, and can achieve sequential equilibrium.Theoretical analysis shows that the proposed protocol is complete fair.
Quantum secret sharing (QSS) is one important branch of quantum cryptography.Based on the studies of multi-shared quantum bits,a new dynamic quantum bit sharing protocol was proposed.The participation of the shared members is hierarchical in this protocol.The quantum information leader,in the absence of the establishment of a new quantum channel,can remove some of the participants in the secret reconstruction system.After the layoffs,the leader can also update the quantum information using quantum operations,and the remaining effective partici-pants can recover the new quantum information without performing additional operations.In addition,the correct-ness,security and the hierarchy of the participants of the protocol were discussed.
A scheme that probabilistically realizes hierarchical quantum state sharing of an arbitrary unknown qubit state with a four-qubit non-maximally entangled 丨X） state is presented in this paper. In the scheme, the sender Alice distributes a quantum secret with a Bell-state measurement and publishes her measurement outcomes via a classical channel to three agents who are divided into two grades. One agent is in the upper grade, while the other two agents are in the lower grade. Then by introducing an ancillary qubit, the agent of the upper grade only needs the assistance of any one of the other two agents for probabilistically obtaining the secret, while an agent of the lower grade needs the help of both the other two agents by using a controlled-NOT operation and a proper positive operator-valued measurement instead of the usual projective measurement. In other words, the agents of two different grades have different authorities to reconstruct Alice＇s secret in a probabilistic manner. The scheme can also be modified to implement the threshold-controlled teleportation.