Abstract
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.
- Received 17 January 2015
DOI:https://doi.org/10.1103/PhysRevA.92.022305
©2015 American Physical Society