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

arXiv:0906.2518

On Ping-Pong protocol and its variant

Takayuki Miyadera, M. Yoshida, Imai, Hideki

Published Jun 14, 2009• 1 citation
arXivHTMLPDF

Abstract

We discuss the Ping-Pong protocol which was proposed by Bostroem and Felbinger. We derive a simple trade-off inequality between distinguishability of messages for Eve and detectability of Eve for legitimate users. Our inequality holds for arbitrary initial states. That is, even if Eve prepares an initial state, she cannot distinguish messages without being detected. We show that the same inequality holds also on another protocol in which Alice and Bob use one-way quantum communication channel twice.

DOI
10.48550/arxiv.0906.2518

Related papers

A “Ping-pong” Protocol with Authentication

Chen Zuning, Zheng Qin

The quantum secure direct communication is a new-style quantum communication scheme. It arouses much interest recently. The ping-pong protocol proposed by Bostroem and Felbinger is one of relatively mature quantum secure direct communication protocols, which is asymptotically secure under Eve's eavesdropping attack. But it ignores the message authentication. Being aimed at this problem, we propose a novel ping-pong protocol with authentication. The former has two operation modes, or the message mode and the control mode, which are used to send message and detect Eve's attack, respectively. But it just detects Eve's eavesdropping attack and does not authenticate the sent message in the control mode. The latter has also the above two operation modes, which employs a braid-based key agreement protocol for both the parties participating in communication to share a secret, whose size and magnitude are undecided in advance. Using the shared secret, it not only detects Eve's eavesdropping attack, but also effectively performs the message authentication in the control mode. It is also asymptotically secure under Eve's eavesdropping attack. The security of the proposed protocol is based on the no-cloning theorem, the correlations of quantum entanglement and the fact that the p-th root finding problem on braid groups is intractable even on quantum computers, as well as classical computers. In addition different from the original ping-pong protocol, the communication was initiated by the sender Alice instead of by the receiver Bob. This corresponds to the way of common communications. The present protocol not only can resist the attacks known recently, but should be experimentally feasible using today's technology.

IEEE Conference on Industrial Electronics and Applications (ICIEA)•Jun 1, 2010•2 citations

Eavesdropping on the Bostroem-Filbinger Communication Protocol in Noisy Quantum Channel

Qing-yu Cai

We show an eavesdropping scheme on Bostr\UNICODE{0xf6}m-Felbinger communication protocol (called ping-pong protocol) [Phys. Rev. Lett. 89, 187902 (2002)] in an ideal quantum channel. A measurement attack can be perfectly used to eavesdrop Alice's information instead of a most general quantum operation attack. In a noisy quantum channel, the direct communication is forbidden. We present a quantum key distribution protocol based on the ping-pong protocol, which can be used in a low noisy quantum channel. And we give a weak upper bound on the bit-error ratio that the detection probability $d$ should be lower than 0.11, which is a requirement criterion when we utilize the ping-pong protocol in a real communication.

arXiv:quant-ph/0404085•Apr 14, 2004•0 citations

Eavesdropping on the `ping-pong' quantum communication protocol freely in a noise channel

Deng Fu-Guo, Xihan Li, Chunyan Li +2 more

We introduce an attack scheme for eavesdropping freely the ping-pong quantum communication protocol proposed by Boström and Felbinger [ Phys. Rev. Lett. 89 , 187902 (2002)] in a noise channel. The vicious eavesdropper, Eve, intercepts and measures the travel photon transmitted between the sender and the receiver. Then she replaces the quantum signal with a multi-photon signal in the same state, and measures the returned photons with the measuring basis, with which Eve prepares the fake signal except for one photon. This attack increases neither the quantum channel losses nor the error rate in the sampling instances for eavesdropping check. It works for eavesdropping the secret message transmitted with the ping-pong protocol. Finally, we propose a way for improving the security of the ping-pong protocol.

arXiv:quant-ph/0507143•Chinese Physics•Jan 24, 2007•36 citations

Eavesdropping on the “Ping-Pong” Quantum Communication Protocol

Antoni Wójcik

Security of the "ping-pong" quantum communication protocol recently proposed by Boström and Felbinger [Phys. Rev. Lett. 89, 187902 (2002)]] is analyzed in the case of considerable quantum channel losses. The eavesdropping scheme is presented, which reveals that the ping-pong protocol is not secure for transmission efficiencies lower than 60%. Our scheme induces 50% losses, which, however, can be hidden in the channel losses if one replaces the original lossy channel with a less lossy one. Finally, a possible improvement of the ping-pong protocol security is proposed.

arXiv:quant-ph/0211199•Physical Review Letters•Apr 15, 2003•336 citations

Insecurity of "Ping-Pong" Quantum Communication Protocol

Ying Guo

Ping-Pong quantum communication protocol may be employed to transmit deterministically information, so it has instrigued mang researchers. However, there are drawbacks on the security due to the symmetry of the employed two-way quantum channel. In this paper we propose a new attack strategy to eavesdrop the initially transmitted information based on the techniques of quantum error correction code (QECC). In addition, an attack strategy of Ping-Pong scheme based either entanglement state or nonorthogonal state is proofed and demonstrated, respectively. Furthermore, information obtained by Eve and the possible probability detected by the legitimate communicators are analyzed by employing information theorems. Detail proofs and analysis illustrate all previous Ping-Pong quantum communication schemes are insecure, i.e., the eavesdropper may obtain all available information without being detected.

Journal of Chinese Computer Systems•Jan 1, 2008•4 citations

Security of modified Ping-Pong protocol in noisy and lossy channel

Yun-Guang Han, Zhen−Qiang Yin, Hong-Wei Li +4 more

The "Ping-Pong" (PP) protocol is a two-way quantum key protocol based on entanglement. In this protocol, Bob prepares one maximally entangled pair of qubits, and sends one qubit to Alice. Then, Alice performs some necessary operations on this qubit and sends it back to Bob. Although this protocol was proposed in 2002, its security in the noisy and lossy channel has not been proven. In this report, we add a simple and experimentally feasible modification to the original PP protocol, and prove the security of this modified PP protocol against collective attacks when the noisy and lossy channel is taken into account. Simulation results show that our protocol is practical.

arXiv:1405.3104•Scientific Reports•May 12, 2014•20 citations
We discuss the Ping-Pong protocol which was proposed by Bostroem and Felbinger. We derive a simple trade-off inequality between distinguishability of messages for Eve and detectability of Eve for legitimate users. Our inequality holds for arbitrary initial states. That is, even if Eve prepares an initial state, she cannot distinguish messages without being detected. We show that the same inequality holds also on another protocol in which Alice and Bob use one-way quantum communication channel twice.
The quantum secure direct communication is a new-style quantum communication scheme. It arouses much interest recently. The ping-pong protocol proposed by Bostroem and Felbinger is one of relatively mature quantum secure direct communication protocols, which is asymptotically secure under Eve's eavesdropping attack. But it ignores the message authentication. Being aimed at this problem, we propose a novel ping-pong protocol with authentication. The former has two operation modes, or the message mode and the control mode, which are used to send message and detect Eve's attack, respectively. But it just detects Eve's eavesdropping attack and does not authenticate the sent message in the control mode. The latter has also the above two operation modes, which employs a braid-based key agreement protocol for both the parties participating in communication to share a secret, whose size and magnitude are undecided in advance. Using the shared secret, it not only detects Eve's eavesdropping attack, but also effectively performs the message authentication in the control mode. It is also asymptotically secure under Eve's eavesdropping attack. The security of the proposed protocol is based on the no-cloning theorem, the correlations of quantum entanglement and the fact that the p-th root finding problem on braid groups is intractable even on quantum computers, as well as classical computers. In addition different from the original ping-pong protocol, the communication was initiated by the sender Alice instead of by the receiver Bob. This corresponds to the way of common communications. The present protocol not only can resist the attacks known recently, but should be experimentally feasible using today's technology.
We show an eavesdropping scheme on Bostr\UNICODE{0xf6}m-Felbinger communication protocol (called ping-pong protocol) [Phys. Rev. Lett. 89, 187902 (2002)] in an ideal quantum channel. A measurement attack can be perfectly used to eavesdrop Alice's information instead of a most general quantum operation attack. In a noisy quantum channel, the direct communication is forbidden. We present a quantum key distribution protocol based on the ping-pong protocol, which can be used in a low noisy quantum channel. And we give a weak upper bound on the bit-error ratio that the detection probability ddd should be lower than 0.11, which is a requirement criterion when we utilize the ping-pong protocol in a real communication.
We introduce an attack scheme for eavesdropping freely the ping-pong quantum communication protocol proposed by Boström and Felbinger [ Phys. Rev. Lett. 89 , 187902 (2002)] in a noise channel. The vicious eavesdropper, Eve, intercepts and measures the travel photon transmitted between the sender and the receiver. Then she replaces the quantum signal with a multi-photon signal in the same state, and measures the returned photons with the measuring basis, with which Eve prepares the fake signal except for one photon. This attack increases neither the quantum channel losses nor the error rate in the sampling instances for eavesdropping check. It works for eavesdropping the secret message transmitted with the ping-pong protocol. Finally, we propose a way for improving the security of the ping-pong protocol.
Security of the "ping-pong" quantum communication protocol recently proposed by Boström and Felbinger [Phys. Rev. Lett. 89, 187902 (2002)]] is analyzed in the case of considerable quantum channel losses. The eavesdropping scheme is presented, which reveals that the ping-pong protocol is not secure for transmission efficiencies lower than 60%. Our scheme induces 50% losses, which, however, can be hidden in the channel losses if one replaces the original lossy channel with a less lossy one. Finally, a possible improvement of the ping-pong protocol security is proposed.
Ping-Pong quantum communication protocol may be employed to transmit deterministically information, so it has instrigued mang researchers. However, there are drawbacks on the security due to the symmetry of the employed two-way quantum channel. In this paper we propose a new attack strategy to eavesdrop the initially transmitted information based on the techniques of quantum error correction code (QECC). In addition, an attack strategy of Ping-Pong scheme based either entanglement state or nonorthogonal state is proofed and demonstrated, respectively. Furthermore, information obtained by Eve and the possible probability detected by the legitimate communicators are analyzed by employing information theorems. Detail proofs and analysis illustrate all previous Ping-Pong quantum communication schemes are insecure, i.e., the eavesdropper may obtain all available information without being detected.
The "Ping-Pong" (PP) protocol is a two-way quantum key protocol based on entanglement. In this protocol, Bob prepares one maximally entangled pair of qubits, and sends one qubit to Alice. Then, Alice performs some necessary operations on this qubit and sends it back to Bob. Although this protocol was proposed in 2002, its security in the noisy and lossy channel has not been proven. In this report, we add a simple and experimentally feasible modification to the original PP protocol, and prove the security of this modified PP protocol against collective attacks when the noisy and lossy channel is taken into account. Simulation results show that our protocol is practical.