Proposal for quantum rational secret sharing

Maitra, Arpita; De, Sourya Joyee; Paul, Goutam; Pal, A. K.

doi:10.1103/physreva.92.022305

Cited by 46 publications

(39 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4. For consistency, the data is analyzed for p = 0, instead of p = 0.5 because at p = 0 there is Nash equilibrium that is common to all values of entanglement, and has the theoretical payoffs for players (A, B 1 , B 2 ) equal to (11,10,9) with the strategy choices of the three players given by {I, X, I} as well as {Z, Y, Z}. The trend is that the deviation from the theoretically calculated payoff grows as entanglement increases.…”

Section: Resultsmentioning

confidence: 99%

“…Since their introduction, quantum games have been studied in a variety of contexts. With the growing prevalence of quantum computers and quantum networks, quantum games emerge as strong candidates for real world applications in quantum security protocols [10], distributed quantum computing algorithms [11], or improving the efficiency of classical network routing algorithms [12].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Demonstration of a Bayesian quantum game on an ion-trap quantum computer

Solmeyer

Linke

Figgatt

et al. 2018

Quantum Sci. Technol.

View full text Add to dashboard Cite

We demonstrate a Bayesian quantum game on an ion trap quantum computer with five qubits. The players share an entangled pair of qubits and perform rotations on their qubit as the strategy choice. Two five-qubit circuits are sufficient to run all 16 possible strategy choice sets in a game with four possible strategies. The data are then parsed into player types randomly in order to combine them classically into a Bayesian framework. We exhaustively compute the possible strategies of the game so that the experimental data can be used to solve for the Nash equilibria of the game directly. Then we compare the payoff at the Nash equilibria and location of phase-change-like transitions obtained from the experimental data to the theory, and study how it changes as a function of the amount of entanglement.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Demonstration of a Bayesian quantum game on an ion-trap quantum computer

Solmeyer

Linke

Figgatt

et al. 2018

Quantum Sci. Technol.

View full text Add to dashboard Cite

show abstract

“…New utility definitions are given according to incentives for rational players. In 2015, Maitra et al [Maitra, Joyee, Paul et al (2015)] firstly introduced the concept of rational agent to QSS (to be exact, NQSTS). A rational protocol to share a known quantum state among n agents is investigated.…”

Section: Introductionmentioning

confidence: 99%

“…Hence, only one agent will obtain the state finally. Another difference between protocols in Maitra et al [Maitra, Joyee, Paul et al (2015)] and Dou et al [Dou, Xu, Chen et al (2018)] is that Byzantine assumption holds in the latter protocol, but fail-stop assumption holds in the former one. However, steps in Dou et al's protocol [Dou, Xu, Chen et al (2018)] are learned from Li et al's protocol [Li, Zhou, Li et al (2006)].…”

Section: Introductionmentioning

confidence: 99%

Rational Non-Hierarchical Quantum State Sharing Protocol

Dou¹,

Xu²,

Chen³

et al. 2019

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

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.

show abstract

“…Then, in quantum domain, Liu et al [18] designed a QSS protocol based on partially and maximally entangled states, in which a secure and fair reconstruction mechanism is firstly organized to realize each participant can learn or cannot learn the secret simultaneously. Later, Maitra et al [19] proposed a rational secret sharing scheme for the first time, in which the rational participant tries to maximize his or her utility by obtaining the secret alone, but it is impossible to occur, because the protocol is usually fair (everyone gets the secret).…”

Section: Introductionmentioning

confidence: 99%

Continuous Variable Quantum Secret Sharing with Fairness

et al. 2019

View full text Add to dashboard Cite

The dishonest participants have many advantages to gain others’ shares by cheating in quantum secret sharing (QSS) protocols. However, the traditional methods such as identity authentication and message authentication can not resolve this problem due to the reason that the share has already been released to dishonest participants before realizing the deception. In this paper, a continuous variable QSS (CVQSS) scheme is proposed with fairness which ensures all participants can acquire or can not acquire the secret simultaneously. The quantum channel based on two-mode squeezing states provides secure communications through which it can send shares successfully, as long as setting the squeezing and modulation parameters according to the quantum channel transmission efficiency and the Shannon information of shares. In addition, the Chinese Remainder Theorem (CRT) can provides tunable threshold structures according to demands of the complex quantum network and the strategy for fairness can be incorporated with other sharing schemes, resulting in perfect compatibility for practical implementations.

show abstract

Proposal for quantum rational secret sharing

Cited by 46 publications

References 36 publications

Demonstration of a Bayesian quantum game on an ion-trap quantum computer

Demonstration of a Bayesian quantum game on an ion-trap quantum computer

Rational Non-Hierarchical Quantum State Sharing Protocol

Continuous Variable Quantum Secret Sharing with Fairness

Contact Info

Product

Resources

About