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.
We study eavesdropping in quantum key distribution with the six state protocol,when the signal states are mixed with white noise. This situation may arise either when Alice deliberately adds noise to the signal states before they leave her lab, or in a realistic scenario where Eve cannot replace the noisy quantum channel by a noiseless one. We find Eve's optimal mutual information with Alice, for individual attacks, as a function of the qubit error rate. Our result is that added quantum noise can make quantum key distribution more robust against eavesdropping.
The security of a cryptographic key that is generated by communication through a noisy quantum channel relies on the ability to distill a shorter secure key sequence from a longer insecure one. We show that -- for protocols that use quantum channels of any dimension and completely characterize them by state tomography -- the noise threshold for classical advantage distillation is substantially lower than the threshold for quantum entanglement distillation because the eavesdropper can perform powerful coherent attacks. The earlier claims that the two noise thresholds are identical, which were b…
The security of quantum cryptography is guaranteed by the no-cloning theorem, which implies that an eavesdropper copying transmitted qubits in unknown states causes their disturbance. Nevertheless, in real cryptographic systems some level of disturbance has to be allowed to cover, e.g., transmission losses. An eavesdropper can attack such systems by replacing a noisy channel by a better one and by performing approximate cloning of transmitted qubits which disturb them but below the noise level assumed by legitimate users. We experimentally demonstrate such symmetric individual eavesdropping on…
In this article we deal with the security of the BB84 quantum cryptography protocol over noisy channels using generalized privacy amplification. For this we estimate the fraction of bits needed to be discarded during the privacy amplification step. This estimate is given for two scenarios, both of which assume the eavesdropper to access each of the signals independently and take error correction into account. One scenario does not allow a delay of the eavesdropper's measurement of a measurement probe until he receives additional classical information. In this scenario we achieve a sharp bound.…
We provide a complete proof of the security of quantum cryptography against any eavesdropping attack including coherent measurements even in the presence of noise. Polarization-based cryptographic schemes are shown to be equivalent to EPR-based schemes. We also show that the performance of a noisy channel approaches that of a noiseless one as the error rate tends to zero. (i.e., the secrecy capacity $C_s (ε) \to C_s (0)$ as $ε\to 0$.) One implication of our results is that one can {\it double} the efficiency of a most well-known quantum cryptographic scheme proposed by Bennett and Brassard sim…
When the 4-state or the 6-state protocol of quantum cryptography is carried out on a noisy (i.e. realistic) quantum channel, then the raw key has to be processed to reduce the information of an adversary Eve down to an arbitrarily low value, providing Alice and Bob with a secret key. In principle, quantum algorithms as well as classical algorithms can be used for this processing. A natural question is: up to which error rate on the raw key is a secret-key agreement at all possible? Under the assumption of incoherent eavesdropping, we find that the quantum and classical limits are precisely the…
We report that, for the generation of a secure cryptographic key from correlations established through a noisy quantum channel, the quantum and classical advantage distillation procedures are not equivalent, when coherent eavesdropping attacks are duly taken into account. The quantum procedure can tolerate markedly more noise in the channel than the classical procedure.
The theory of quantum cryptography aims to guarantee unconditional information-theoretic security against an omnipotent eavesdropper. In many practical scenarios, however, the assumption of an all-powerful adversary is excessive and can be relaxed considerably. In this paper we study secret key distillation across a lossy and noisy quantum wiretap channel between Alice and Bob, with a separately parameterized realistically lossy quantum channel to the eavesdropper Eve. We show that under such restricted eavesdropping, the key rates achievable can exceed the secret key distillation capacity aga…
We present a quantum secure direct communication protocol where the channels are not maximally entangled states. The communication parties utilize decoy photons to check eavesdropping. After ensuring the security of the quantum channel, the sender encodes the secret message and transmits it to the receiver by using Controlled-NOT operation and von Neumann measurement. The protocol is simple and realizable with present technology. We also show the protocol is secure for noisy quantum channel.
We extend the security proof for continuous variable quantum key distribution protocols using post selection to account for arbitrary eavesdropping attacks by employing the concept of an equiv- alent protocol where the post-selection is implemented as a projective quantum measurement. We demonstrate that the security can be calculated using only experimentally accessible quantities and finally explicitly evaluate the performance for the case of a noisy Gaussian channel in the limit of unbounded key length.
In secure quantum communication protocols, a set of single qubits prepared using 2 or more mutually unbiased bases or a set of $n$-qubit ($n\geq2$) entangled states of a particular form are usually used to form a verification string which is subsequently used to detect traces of eavesdropping. The qubits that form a verification string are referred to as decoy qubits, and there exists a large set of different quantum states that can be used as decoy qubits. In the absence of noise, any choice of decoy qubits provides equivalent security. In this paper, we examine such equivalence for noisy env…
A multiparty quantum secret sharing (QSS) protocol is proposed by using swapping quantum entanglement of Bell states. The secret messages are imposed on Bell states by local unitary operations. The secret messages are split into several parts and each part is distributed to a party so that no action of a subset of all the parties but their entire cooperation is able to read out the secret messages. In addition, the dense coding is used in this protocol to achieve a high efficiency. The security of the present multiparty QSS against eavesdropping has been analyzed and confirmed even in a noisy …
A quantum random-number generator (QRNG) can theoretically generate unpredictable random numbers with perfect devices and is an ideal and secure source of random numbers for cryptography. However, the practical implementations always contain imperfections, which will greatly influence the randomness of the final output and even open loopholes to eavesdroppers. Recently, Thewes et al. experimentally demonstrated a continuous-variable eavesdropping attack, based on heterodyne detection, on a trusted continuous-variable QRNG in Phys. Rev. A 100, 052318 (2019), yet like in many other practical con…
Entanglement is essential to many quantum information applications, but it is easily destroyed by quantum decoherence arising from interaction with the environment. We report the first experimental demonstration of an entanglement-based protocol that is resilient to loss and noise which destroy entanglement. Specifically, despite channel noise 8.3 dB beyond the threshold for entanglement breaking, eavesdropping-immune communication is achieved between Alice and Bob when an entangled source is used, but no such immunity is obtainable when their source is classical. The results prove that entang…
We extend the security proof for continuous variable quantum key distribution protocols using post selection to account for arbitrary eavesdropping attacks by employing the concept of an equivalent protocol where the post-selection is implemented as a series of quantum operations including a virtual distillation. We introduce a particular `Gaussian' post selection and demonstrate that the security can be calculated using only experimentally accessible quantities. Finally we explicitly evaluate the performance for the case of a noisy Gaussian channel in the limit of unbounded key length and fin…
In quantum key distribution, one conservatively assumes that the eavesdropper Eve is restricted only by physical laws, whereas the legitimate parties, namely the sender Alice and receiver Bob, are subject to realistic constraints, such as noise due to environment-induced decoherence. In practice, Eve too may be bound by the limits imposed by noise, which can give rise to the possibility that decoherence works to the advantage of the legitimate parties. A particular scenario of this type is one where Eve can't replace the noisy communication channel with an ideal one, but her eavesdropping chan…
A protocol for quantum secure direct communication using blocks of EPR pairs is proposed. A set of ordered $N$ EPR pairs is used as a data block for sending secret message directly. The ordered $N$ EPR set is divided into two particle sequences, a checking sequence and a message-coding sequence. After transmitting the checking sequence, the two parties of communication check eavesdropping by measuring a fraction of particles randomly chosen, with random choice of two sets of measuring bases. After insuring the security of the quantum channel, the sender, Alice encodes the secret message direct…
Nonlocality inequalities for multi-party systems act as contextuality inequalities for single qudit systems of suitable dimensions. In this paper, we propose the procedure for adaptation of nonlocality-based quantum conferencing protocols (QCPs) to contextuality-based QCPs. Unlike the nonlocality-based protocols, the proposed protocols do not involve nonlocal states. These protocols can also be implemented in a class of noisy channels without any compromise in the key generation rate. As an illustration of the procedure, we present a QCP based on Mermin's contextuality inequality. As a signifi…
A quantum key distribution system may be probed by an eavesdropper Eve by sending in bright light from the quantum channel and analyzing the back-reflections. We propose and experimentally demonstrate a setup for mounting such a Trojan-horse attack. We show it in operation against the quantum cryptosystem Clavis2 from ID~Quantique, as a proof-of-principle. With just a few back-reflected photons, Eve discerns Bob's secret basis choice, and thus the raw key bit in the Scarani-Acín-Ribordy-Gisin 2004 protocol, with higher than 90% probability. This would clearly breach the security of the cryptos…
The role of the side channels in the continuous-variable quantum key distribution is studied. It is shown how the information leakage through a side channel from the trusted sender station increases the vulnerability of the protocols to the eavesdropping in the main quantum communication channel. Moreover, the untrusted noise infusion by an eavesdropper on the trusted receiving side breaks the security even for a purely attenuating main quantum channel. As a method to compensate for the effect of the side-channel leakage on the sender side, we suggest several types of manipulations on the side…
Alice is transmitting a private message to Bob across a bosonic wiretap channel with the help of a public feedback channel to which all parties, including the fully-quantum equipped Eve, have completely noiseless access. We find that by altering the model such that Eve's copy of the initial round of feedback is corrupted by an iota of noise, one step towards physical relevance, the capacity can be increased dramatically. It is known that the private capacity with respect to the original model for a pure-loss bosonic channel is at most $- \log(1-η)$ bits per mode, where $η$ is the transmissivit…
After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In principle, both classical and quantum protocols can be used for this processing. It is a natural question which type of protocols is more powerful. We prove for general states but under the assumption of incoherent eavesdropping that Alice and Bob share some so-called intrinsic information in their classical random variables, resulting from optimal measurements, …
In conventional quantum key distribution (QKD) protocols, security is guaranteed by estimating the amount of leaked information through monitoring signal disturbance, which, in practice, is generally caused by environmental noise and device imperfections rather than eavesdropping. Such estimation therefore tends to overrate the amount of leaked information in practice, leads to a fundamental threshold of the bit error rate. The threshold becomes a bottleneck of the development of practical QKD systems. In classical communication, according to Shannon's communication theory, information can tra…
