Antoni Wojcik
The proposed eavesdropping scheme reveals that the quantum communication protocol recently presented by Bostrom and Felbinger [Phys. Rev. Lett. 89, 187902 (2002)] is not secure as far as quantum channel losses are taken into account.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The security proof of the ping-pong protocol is wrong.
Attack the ping-pong protocol without eavesdropping.
This paper has been withdrawn and replaced by quant-ph/0609207.
This is a comment on PRL90(03)157901 by Antoni Wojcik (quant-ph/0211199)
We briefly review the security of the ping-pong protocol in light of several attack scenarios suggested by various authors since the proposal of the protocol. We refute one recent attack on an ideal quantum channel, and show that a recent claim of falseness of our original security proof is erroneous.
The wrong mutual information, quantum bit error rate and secure transmission efficiency in Wojcik's eavesdropping scheme [PRL90(03)157901]on ping-pong protocol have been pointed out and corrected.
The eavesdropping scheme proposed by Wójcik [Phys. Rev. Lett. {\bf 90},157901(2003)] on the ping-pong protocol [Phys. Rev. Lett. {\bf 89}, 187902(2002)] is improved by constituting a new set of attack operations. The improved scheme has a zero eavesdropping-induced channel loss and produces perfect anticorrelation. Therefore, the eavesdropper Eve can safely attack all the transmitted bits and the eavesdropping information gain can always exceed the legitimate user's information gain in the whole domain of the quantum channel transmission efficiency $η$, i.e., [0,100%]. This means that the ping…
The general individual (non-coherent) attack on the ping-pong protocol with completely entangled pairs of three-dimensional quantum systems (qutrits) is analyzed. The expression for amount of the eavesdropper's information as functions from probability of attack detection is derived. It is shown, that the security of the ping-pong protocol with pairs of qutrits is higher the security of the protocol with pairs of qubits. It is also shown, that with the use by legitimate users in a control mode two mutually unbiased measuring bases the ping-pong protocol with pairs of qutrits, similar to the pr…
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.
Ping-Pong protocol is a type of quantum key distribution which makes use of two entangled photons in the EPR state. Its security is based on the randomization of the operations that Alice performs on the travel photon (qubit), and on the anti-correlation between the two photons in the EPR state. In this paper, we study the security of this protocol against some known quantum attacks, and present a scheme that may enhance its security to some degree.
Communication security with quantum key distribution has been one of the important features of quantum information theory. A novel concept of secured direct communication has been the next step forward without the need to establish any shared secret key. The present paper is based on the ping-pong protocol with three particle GHZ state as the initial state where the receiver can simultaneously receive information from two parties. Possible eavesdropping on the travelling particle has been examined.
We present a quantum communication protocol which keeps all the properties of the ping-pong protocol [Phys. Rev. Lett. 89, 187902 (2002)] but improves the capacity doubly as the ping-pong protocol. Alice and Bob can use the variable measurement basises in control mode to detect Eve's eavesdropping attack. In message mode, Alice can use one unitary operations to encode two bits information. Bob only needs to perform a Bell type measurement to decode Alice's information. A classical message authentification method can protect this protocol against the eavesdropping hiding in the quantum channel …
We introduce an attack scheme for eavesdropping the ping-pong quantum communication protocol proposed by Bostr$\ddot{o}$m and Felbinger [Phys. Rev. Lett. \textbf{89}, 187902 (2002)] freely 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 a same state, and measures the photons return with the measuring basis with which Eve prepares the fake signal except for one photon. This attack increase neither the quantum channel losses nor the erro…
The ping-pong protocol adapted for quantum key distribution is studied in the trusted quantum noise scenario, wherein the legitimate parties can add noise locally. For a well-studied attack model, we show how non-unital quantum non-Markovianity of the added noise can improve the key rate. We also point out that this noise-induced advantage cannot be obtained by Alice and Bob by adding local classical noise to their post-measurement data.
The crucial issue of quantum communication protocol is its security. In this paper, we show that all the deterministic and direct two-way quantum communication protocols, sometimes called ping-pong (PP) protocols, are insecure when an eavesdropper uses the invisible photon to eavesdrop on the communication. With our invisible photon eavesdropping (IPE) scheme, the eavesdropper can obtain full information of the communication with zero risk of being detected. We show that this IPE scheme can be implemented experimentally with current technology. Finally, a possible improvement of PP communicati…
We analyse Ping-Pong protocol from the point of view of a game. The analysis helps us in understanding the different strategies of a sender and an eavesdropper to gain the maximum payoff in the game. The study presented here characterizes strategies that lead to different Nash equilibriums. We further demonstrate the condition for Pareto optimality depending on the parameters used in the game. Moreover, we also analysed LM05 protocol and compared it with PP protocol from the point of view of a generic two-way QKD game with or without entanglement. Our results provide a deeper understanding of …
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 i…
We consider a man-in-the-middle attack on two-way quantum key distribution ping-pong and LM05 protocols in which an eavesdropper copies all messages in the message mode, while being undetectable in the mode. Under the attack there is therefore no disturbance in the message mode and the mutual information between the sender and the receiver is always constant and equal to one and messages copied by the eavesdropper are always genuine. An attack can only be detected in the control mode but the level of detection at which the protocol should be aborted is not defined. We examine steps of the prot…
In this paper we propose an extended version of the ping-pong protocol and study its security. The proposed protocol incorporates the usage of mutually unbiased bases in the control mode. We show that, by increasing the number of bases, it is possible to improve the security of this protocol. We also provide the upper bounds on eavesdropping average non-detection probability and propose a control mode modification that increases the attack detection probability.
Based on an EPR pair of qubits and allowing asymptotically secure key distribution, a secure communication protocol is presented. Bob sends either of the EPR pair qubits to Alice. Alice receives the travel qubit. Then she can encode classical information by local unitary operations on this travel qubit. Alice send the qubit back to Bob. Bob can get Alice's information by measurement on the two photons in Bell operator basis. If Eve in line, she has no access to Bob's home qubit. All her operations are restricted to the travel qubit. In order to find out which opeartion Alice performs, Eve's op…
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$ sho…
The existence of an undetectable eavesdropping of dense coded information has been already demonstrated by Pavičić for the quantum direct communication based on the ping-pong paradigm. However, a) the explicit scheme of the circuit is only given and no design rules are provided, b) the existence of losses is implicitly assumed, c) the attack has been formulated against qubit based protocol only and it is not clear whether it can be adapted to higher dimensional systems. These deficiencies are removed in the presented contribution. A new generic eavesdropping scheme built on a firm theoretical …
A continuous variable ping-pong scheme, which is utilized to generate deterministically private key, is proposed. The proposed scheme is implemented physically by using Gaussian-modulated squeezed states. The deterministic way, i.e., no basis reconciliation between two parties, leads a two-times efficiency comparing to the standard quantum key distribution schemes. Especially, the separate control mode does not need in the proposed scheme so that it is simpler and more available than previous ping-pong schemes. The attacker may be detected easily through the fidelity of the transmitted signal,…
Superluminal local operations in quantum field theory: A ping-pong ball test
该研究证明量子场论与经典相对论场论中均存在能引发局域区域内超光速效应的瞬时空间旋转类局域操作，表明相关不可能测量场景并非量子场论独有。
We show an improved ping-pong protocol which is based on the protocol showed by Kim Bostrom and Timo Felbinger [Phys. Rev. Lett. 89, 187902 (2002); quant-ph/0209040]. We show that our protocol is asymptotically secure key distribution and quasisecure direct communication using a single photon resource. And this protocol can be can be carried out with great efficiency and speed using today's technology.
Two-way quantum key distribution protocols utilize bi-directional quantum communication to establish a shared secret key. Due to the increased attack surface, security analyses remain challenging. Here we investigate a high-dimensional variant of the Ping Pong protocol and perform an information theoretic security analysis in the finite-key setting. Our methods may be broadly applicable to other QKD protocols, especially those relying on two-way channels. Along the way, we show some fascinating benefits to high-dimensional quantum states applied to two-way quantum communication.
We demonstrate a prototype-implementation of deterministic information encoding for quantum key distribution (QKD) following the ping-pong coding protocol [K. Bostroem, T. Felbinger, Phys. Rev. Lett. 89 (2002) 187902-1]. Due to the deterministic nature of this protocol the need for post-processing the key is distinctly reduced compared to non-deterministic protocols. In the course of our implementation we analyze the practicability of the protocol and discuss some security aspects of information transfer in such a deterministic scheme.
We consider testing the ability of quantum network nodes to execute multi-round quantum protocols. Specifically, we examine protocols in which the nodes are capable of performing quantum gates, storing qubits and exchanging said qubits over the network a certain number of times. We propose a simple ping-pong test, which provides a certificate for the capability of the nodes to run certain multi-round protocols. We first show that in the noise-free regime the only way the nodes can pass the test is if they do indeed possess the desired capabilities. We then proceed to consider the case where op…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。