In search of a way to securely transfer information, the scientific world uses entanglement with several qubits. However, the experimental feasibility of implementing communication protocols remains unclear. In this work, we indicate a one-to-one correspondence between a quantum dialogue and the quantum Stackelberg duopoly game. If we consider a controller-dependent communication protocol to be a sequential quantum game, the two players, Alice and Bob, can be compared to two firms, [Formula: see text] and [Formula: see text]. Moreover, the controller Charlie can be assumed to be the arbiter. First mover advantage is a significant feature of the Stackelberg duopoly game, which is explained and proved in the protocol. Further, we propose a controller-independent bidirectional quantum dialogue using four-qubit maximally entangled states. The efficiency of the protocol is determined to be 50%.
In search of a way to securely transfer information, the scientific world uses entanglement with several qubits. However, the experimental feasibility of implementing communication protocols remains unclear. In this work, we indicate a one-to-one correspondence between a quantum dialogue and the quantum Stackelberg duopoly game. If we consider a controller-dependent communication protocol to be a sequential quantum game, the two players, Alice and Bob, can be compared to two firms, [Formula: see text] and [Formula: see text]. Moreover, the controller Charlie can be assumed to be the arbiter. First mover advantage is a significant feature of the Stackelberg duopoly game, which is explained and proved in the protocol. Further, we propose a controller-independent bidirectional quantum dialogue using four-qubit maximally entangled states. The efficiency of the protocol is determined to be 50%.
Consider in an asymmetric scenario that Alice and Bob wish to communicate unequal amount of classical information, we propose an asymmetric quantum dialogue (QD) protocol based on the entanglement swapping between two-qubit bell state and four-qubit cluster state. In this scheme, assume that there are two legitimate participants Alice and Bob. In a dialogue, the information that is delivered by Alice to Bob is twice the amount of her information obtained from Bob. The analysis demonstrates that our protocol is efficient and can meet the requirements of unequal amount of information transmission in a real communication scenario. Moreover, we discuss the security of this protocol and it demonstrates that our protocol could resist an external attack.
In order to solve the security threat of information leakage in quantum dialogue protocols,a controlled quantum dialogue protocol without information leakage was proposed,where the controller Alice controlled the bidirectional communication between two communication parties,Bob and Charlie.The problem of information leakage was avoided by making full use of the measurement correlation property after entanglement swapping between two maximally entangled GHZ states and decreasing the transmission efficiency.Moreover,the Bell-basis measurement rather than the GHZ-basis measurement was needed.Security analysis shows that the active attacks from an outside eavesdropper can be detected,such as the intercept-resend attack,the measurement-resend attack and the entanglement-and-measurement attack.
Abstract A controlled semi-quantum dialogue protocol is proposed that uses semi-quantum cryptography and the concept of ‘control’. In this scheme, the supervisor Charlie prepares a large number of entangled photon pairs and separates them into an S A for verification and an S B for encoding. The quantum-capable party Alice and the classical communication party Bob proceed to encode on the S B sequence only after confirming the security of the channel. Finally, Alice performs measurements and announces the results to finalise the communication. This protocol ensures that secret information is exchanged between Alice and Bob only with Charlie’s permission, while Charlie has no access to the communicators’ secret information during the whole process. In terms of security, the protocol contains two strict security checks and accounts for noise, making it robust against both internal and external attacks, which greatly improves the security and reliability of the protocol. Finally, the efficiency analysis demonstrates that the protocol outperforms other existing protocols in terms of efficiency and its actual efficiency can approach the theoretical limit through optimization.
In this study, a protocol for secure quantum dialogue using entanglement swapping was proposed. The protocol employs two independent communication channels, a classical channel and a quantum channel. In this scheme, the legitimate communicators Alice and Bob can pass the authentication by the classical trusted channel. Afterwards, a quantum channel sequence is provided for them, on which Alice and Bob can communicate with each other directly and privately by virtue of some encoding operations. The first advantage of our protocol is that different from the previews protocols, in the proposed protocol, the server of the quantum channel, Charlie, is not necessarily trusted. The other highlight of our protocol is that in the presented scheme, one party is able to first read the message received from the other party before sending another message back in reply.
Key words: Quantum secure direct communication, entanglement swapping, quantum dialogue.
This paper introduces two information-theoretically quantum secure direct communication protocols that accomplish information exchange between Alice and Bob in the first case, and among Alice, Bob, and Charlie in the second case. Both protocols use a novel method, different from existing similar protocols, to embed the secret information in the entangled compound system. This new way of encoding the secret information is one of the main novelties of this paper, and a distinguishing feature compared to previous works in this field. A second critical advantage of our method is its scalability and extensibility because it can be seamlessly generalized to a setting involving three, or more, players, as demonstrated by the second protocol. This trait is extremely beneficial in many real-life situations, where many spatially separated players posses only part the secret information that must be transmitted to Alice, so that she may obtain the complete secret. Using the three-player protocol, this task can be achieved in one go, without the need to apply a typical QSDC protocol twice, where Alice first receives Bob’s and then Charlie’s information. The proposed protocol does not require pre-shared keys or quantum signatures, making it less complicated and more straightforward. Finally, in anticipation of the coming era of distributed quantum computing, our protocols offer the important practical advantage of straightforward implementation on contemporary quantum computers, as they only require standard CNOT and Hadamard gates.
Quantum cryptography uses quantum mechanics to guarantee secure communication. BB84 is a widely used quantum key distribution that provides a way for two parties, a sender, Alice, and a receiver, Bob, to share an unconditionally secure key in the presence of an eavesdropper, Eve. Three different criteria can be assumed to study the BB84 protocol. They are the efficiency of the protocol, the probability that Eve remains undetected, and the amount of knowledge Eve has about Alice's bit sequence. In a previous approach, we only considered the probability that Eve remains undetected. We viewed this protocol as a three player static game in which Alice and Bob were two cooperative players and Eve was a competitive one. In our game model, Alice's and Bob's objective was to maximize the probability of detecting Eve, while Eve's objective was to minimize this probability. In this paper, our previous effort is extended and we also consider the other two criteria, i.e. the efficiency of the protocol and the amount of knowledge Eve has about Alice's bit sequence. Using these models, we show how game theory can be used to find the strategies for Alice, Bob and Eve.