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

Quantum Information Processing

Improving security of the ping-pong protocol

P. Zawadzki

Published Feb 1, 2012• 16 citations
Publisher

Abstract

A security layer for the asymptotically secure ping-pong protocol is proposed and analyzed in the paper. The operation of the improvement exploits inevitable errors introduced by the eavesdropping in the control and message modes. Its role is similar to the privacy amplification algorithms known from the quantum key distribution schemes. Messages are processed in blocks which guarantees that an eavesdropper is faced with a computationally infeasible problem as long as the system parameters are within reasonable limits. The introduced additional information preprocessing does not require quantum memory registers and confidential communication is possible without prior key agreement or some shared secret.

DOI
10.1007/s11128-012-0363-1

Related papers

THE PING-PONG PROTOCOL WITH A PRIOR PRIVACY AMPLIFICATION

P. Zawadzki

A modified version of the well known ping-pong protocol is proposed and analyzed in the paper. The operation of the improved version exploits inevitable errors introduced by the eavesdropping in the message mode — a feature which has not been exploited so far. A proposed protocol improvement is in its role similar to the privacy amplification known from the quantum key distribution schemes, but no randomization of transferred information is introduced and deterministic character of communication is preserved. Messages are processed in blocks which guarantees that an eavesdropper is faced with a computationally infeasible problem as long as the system parameters are within reasonable limits. Information processing does not require quantum memory registers and confidential communication is possible without prior key agreement or some shared secret.

International Journal of Quantum Information•Apr 1, 2012•8 citations

An efficient modification to the ping-pong protocol to enhance the security

Hargeet Kaur, Kavit Shah

Ping-Pong protocol is a Quantum Secure Direct Communication protocol that fails to transfer a secure key or secret message optimally in a lossy or noisy channel. The reason is an eavesdropper who possibly hides in the light of these channel losses and gains information about the secure key bits or secret messages. We propose an efficient modification to the control mode of the original Ping-Pong protocol leading to the detection of an eavesdropper with a much higher probability which may not allow her to hide in the light of lossy channels. Assuming that Eve knows and makes a fixed number of right guesses about the modification in the protocol, an optimum ratio of modification can be evaluated. In addition, it is shown that incorporation of the proposed modification in the protocol doubles the eavesdropper’s detection probability for certain eavesdropping operations.

AIP conference proceedings•Jan 1, 2023•0 citations

On the Security of Quantum Key Distribution Ping-Pong Protocol

M. Yoshida, Takayuki Miyadera, Hideki Imai

Computational based cryptography might not guarantee long term security if computational algorithms, computers, and so on are made remarkable progress. Therefore, quantum cryptography with unconditionally security attracts attention. In this paper, we consider security of a two-way quantum key distribution protocol, so called Ping-Pong protocol. As a result, we introduce not only robustness but also a different information disturbance theorem, which denotes a trade-off relationship between information gain for an eavesdropper and error rate, from the related works for an attack model.

Journal of Quantum Information Science•Jan 1, 2013•4 citations

Security of ping-pong protocol based on pairs of completely entangled qudits

P. Zawadzki

Quantum secure direct communication protocols offer confidential transmission of classic information over quantum channel without prior key agreement. The ping-pong based protocols provide asymptotic security and detailed analysis of security level provided by each variant of the protocol is required. The paper presents a general method of calculation of the eavesdropped information as a function of the attack detection probability. The method is applied to the ping-pong protocol based on completely entangled pairs of qudits. The upper and lower bounds on the amount of the leaked information and eavesdropping detection probability are provided.

Quantum Information Processing•Sep 21, 2011•30 citations

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

Efficiency increasing method for quantum secure direct communication protocols

Sergiy O. Gnatyuk, Тетяна Олександрівна Жмурко, Paweł Fałat

Particularly vulnerable spot for violation of information security is a data network, since it is impossible to guarantee the data protection when transferring them through a public environment (Internet, telephone lines, radio). Therefore, the information transmitted on different networks, particularly in need of security and the main way of providing it, is using the cryptographic methods. However, recent research has shown that classical cryptography gives a cause to look for new prospects and it could be quantum cryptography. Among all possible quantum cryptography technologies, quantum secure direct communication (e.g. Ping-Pong protocol) does not use any cryptographic transformations, so there is no key distribution problem and eavesdropping can be detected during transfer, thereby improving information transmitting reliability. In this paper security amplification method for Ping-Pong protocol was proposed. This method uses generated ternary pseudorandom sequence and transformations in Galois field. Accordingly, this could increase the protocol asymptotical security and accelerate its work at least 3 times.

IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)•Sep 1, 2015•23 citations
A security layer for the asymptotically secure ping-pong protocol is proposed and analyzed in the paper. The operation of the improvement exploits inevitable errors introduced by the eavesdropping in the control and message modes. Its role is similar to the privacy amplification algorithms known from the quantum key distribution schemes. Messages are processed in blocks which guarantees that an eavesdropper is faced with a computationally infeasible problem as long as the system parameters are within reasonable limits. The introduced additional information preprocessing does not require quantum memory registers and confidential communication is possible without prior key agreement or some shared secret.
A modified version of the well known ping-pong protocol is proposed and analyzed in the paper. The operation of the improved version exploits inevitable errors introduced by the eavesdropping in the message mode — a feature which has not been exploited so far. A proposed protocol improvement is in its role similar to the privacy amplification known from the quantum key distribution schemes, but no randomization of transferred information is introduced and deterministic character of communication is preserved. Messages are processed in blocks which guarantees that an eavesdropper is faced with a computationally infeasible problem as long as the system parameters are within reasonable limits. Information processing does not require quantum memory registers and confidential communication is possible without prior key agreement or some shared secret.
Ping-Pong protocol is a Quantum Secure Direct Communication protocol that fails to transfer a secure key or secret message optimally in a lossy or noisy channel. The reason is an eavesdropper who possibly hides in the light of these channel losses and gains information about the secure key bits or secret messages. We propose an efficient modification to the control mode of the original Ping-Pong protocol leading to the detection of an eavesdropper with a much higher probability which may not allow her to hide in the light of lossy channels. Assuming that Eve knows and makes a fixed number of right guesses about the modification in the protocol, an optimum ratio of modification can be evaluated. In addition, it is shown that incorporation of the proposed modification in the protocol doubles the eavesdropper’s detection probability for certain eavesdropping operations.
Computational based cryptography might not guarantee long term security if computational algorithms, computers, and so on are made remarkable progress. Therefore, quantum cryptography with unconditionally security attracts attention. In this paper, we consider security of a two-way quantum key distribution protocol, so called Ping-Pong protocol. As a result, we introduce not only robustness but also a different information disturbance theorem, which denotes a trade-off relationship between information gain for an eavesdropper and error rate, from the related works for an attack model.
Quantum secure direct communication protocols offer confidential transmission of classic information over quantum channel without prior key agreement. The ping-pong based protocols provide asymptotic security and detailed analysis of security level provided by each variant of the protocol is required. The paper presents a general method of calculation of the eavesdropped information as a function of the attack detection probability. The method is applied to the ping-pong protocol based on completely entangled pairs of qudits. The upper and lower bounds on the amount of the leaked information and eavesdropping detection probability are provided.
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.
Particularly vulnerable spot for violation of information security is a data network, since it is impossible to guarantee the data protection when transferring them through a public environment (Internet, telephone lines, radio). Therefore, the information transmitted on different networks, particularly in need of security and the main way of providing it, is using the cryptographic methods. However, recent research has shown that classical cryptography gives a cause to look for new prospects and it could be quantum cryptography. Among all possible quantum cryptography technologies, quantum secure direct communication (e.g. Ping-Pong protocol) does not use any cryptographic transformations, so there is no key distribution problem and eavesdropping can be detected during transfer, thereby improving information transmitting reliability. In this paper security amplification method for Ping-Pong protocol was proposed. This method uses generated ternary pseudorandom sequence and transformations in Galois field. Accordingly, this could increase the protocol asymptotical security and accelerate its work at least 3 times.