A symmetric device-independent quantum key distribution (DIQKD) protocol is proposed in this paper, with Holevo limit and subadditivity of von Neumann entropy, one can bound Eve's ability with collective attack. Together with symmetry of this protocol, the state Eve prepared for Alice and Bob, and at the same time, her eavesdropping on Alice's and Bob's measurements can be definitely inferred at the assumption that Eve aims at maximizing her information gain. The optimal state under this circumstance can be solely bounded with Alice and Bob's statistical results on the quantity of Clauser-Horne-Shimony-Holt (CHSH) polynomial $S$, that is, our symmetric DIQKD has the same secure basis as that of Ekert91 protocol.
Security of quantum key distribution against sophisticated attacks is among the most important issues in quantum information theory. In this work we prove security against a very important class of attacks called collective attacks (under a compatible noise model) which use quantum memories and gates, and which are directed against the final key. Although attacks stronger than the collective attacks can exist in principle, no explicit example was found and it is conjectured that security against collective attacks implies also security against any attack.
We suggest an attack on a symmetric non-ideal quantum coin-tossing protocol suggested by Mayers Salvail and Chiba-Kohno. The analysis of the attack shows that the protocol is insecure.
We present strong attacks against quantum key distribution schemes which use quantum memories and quantum gates to attack directly the final key. We analyze a specific attack of this type, for which we find the density matrices available to the eavesdropper and the optimal information which can be extracted from them. We prove security against this attack and discuss security against any attack allowed by the rules of quantum mechanics.
In this paper, we give a simple proof of the fact that the optimal collective attacks against continous-variable quantum key distribution with a Gaussian modulation are Gaussian attacks. Our proof makes use of symmetry properties of the quantum key distribution protocol in phase-space.
We consider the collective eavesdropping of the BB84 and six-state protocols. Since these protocols are symmetric in the eigenstates of conjugate bases, we consider collective attacks having the same kind of symmetry. We then show how these symmetric collective attacks are sufficiently strong in order to minimize the Devetak-Winter rates. In fact, it is quite easy to construct simple examples able to reach the unconditionally-secure key-rates of these protocols.
We introduce a new class of quantum quantum key distribution protocols, tailored to be robust against photon number splitting (PNS) attacks. We study one of these protocols, which differs from the BB84 only in the classical sifting procedure. This protocol is provably better than BB84 against PNS attacks at zero error.
In this paper, we briefly show how the quantum key distribution with blind polarization bases [Kye et al., Phys. Rev. Lett. 95, 040501 (2005)] can be made secure against the invisible photon attack.
In this paper, we briefly show how the quantum key distribution with blind polarization bases [Kye et al., Phys. Rev. Lett. 95, 040501 (2005)] can be made secure against the impersonation attack.
A general study of arbitrary finite-size coherent attacks against continuous-variable quantum cryptographic schemes is presented. It is shown that, if the size of the blocks that can be coherently attacked by an eavesdropper is fixed and much smaller than the key size, then the optimal attack for a given signal-to-noise ratio in the transmission line is an individual gaussian attack. Consequently, non-gaussian coherent attacks do not need to be considered in the security analysis of such quantum cryptosystems.
We discuss the robustness of two-way quantum communication protocols against Trojan horse attack and introduce a novel attack, delay-photon Trojan horse attack. Moreover, we present a practical way for two-way quantum communication protocols to prevent the eavesdropper from stealing the information transmitted with Trojan horse attacks. It means that two-way quantum communication protocols is also secure in a practical application.
We analyze the security against collective attacks for a homodyne-based continuous-variable quantum key distribution protocol using binary coherent states and postselection. We derive a lower bound of the secret key rate in an asymptotic scenario, and numerically optimize it for the case of a symmetric Gaussian channel.
We derive a proof of security for the Differential Phase Shift Quantum Key Distribution (DPSQKD) protocol under the assumption that Eve is restricted to individual attacks. The security proof is derived by bounding the average collision probability, which leads directly to a bound on Eve's mutual information on the final key. The security proof applies to realistic sources based on pulsed coherent light. We then compare individual attacks to sequential attacks and show that individual attacks are more powerful.
This paper proves that several interactive proof systems are zero-knowledge against quantum attacks. This includes a few well-known classical zero-knowledge proof systems as well as quantum interactive proof systems for the complexity class HVQSZK, which comprises all problems having "honest verifier" quantum statistical zero-knowledge proofs. It is also proved that zero-knowledge proofs for every language in NP exist that are secure against quantum attacks, assuming the existence of quantum computationally concealing commitment schemes. Previously no non-trivial proof systems were known to be…
We investigate limitations imposed by sequential attacks on the performance of differential-phase-shift quantum key distribution protocols that use pulsed coherent light. In particular, we analyze two sequential attacks based on unambiguous state discrimination and minimum error discrimination, respectively, of the signal states emitted by the source. Sequential attacks represent a special type of intercept-resend attacks and, therefore, they do not allow the distribution of a secret key.
We investigate a new strategy for incoherent eavesdropping in Ekert's entanglement based quantum key distribution protocol. We show that under certain assumptions of symmetry the effectiveness of this strategy reduces to that of the original single qubit protocol of Bennett and Brassard.
This paper presents the security analysis on the quantum stream cipher so called Yuen-2000 protocol (or $αη$ scheme) against the fast correlation attack, the typical attack on stream ciphers. Although a very simple experimental model of the quantum stream cipher without a random mapper may be decrypted in the information theoretic sense by the fast correlation algorithm, it is not a basic feature of Yuen 2000 protocol. In fact, we clarify that there exists a randomization scheme which attains the perfect correlation immunity against such attacks under an approximation. And in this scheme, the …
I prove the security of quantum key distribution against individual attacks for realistic signals sources, including weak coherent pulses and downconversion sources. The proof applies to the BB84 protocol with the standard detection scheme (no strong reference pulse). I obtain a formula for the secure bit rate per time slot of an experimental setup which can be used to optimize the performance of existing schemes for the considered scenario.
We investigate the performance of Gaussianmodulated coherent-state QKD protocols in the presence of canonical attacks, which are collective Gaussian attacks resulting in Gaussian channels described by one of the possible canonical forms. We present asymptotic key rates and then we extend the results to the finite-size regime using a recently-developed toolbox for composable security.
We investigate limitations imposed by detector dead-times on the performance of sequential attacks against a differential-phase-shift (DPS) quantum key distribution (QKD) protocol with weak coherent pulses. In particular, we analyze sequential attacks based on unambiguous state discrimination of the signal states emitted by the source and we obtain ultimate upper bounds on the maximal distance achievable by a DPS QKD scheme both in the so-called trusted and untrusted device scenarios, respectively.
A fully general approach to the security analysis of continuous-variable quantum key distribution (CV-QKD) is presented. Provided that the quantum channel is estimated via the covariance matrix of the quadratures, Gaussian attacks are shown to be optimal against all eavesdropping strategies, including collective and coherent attacks. The proof is made strikingly simple by combining a physical model of measurement, an entanglement-based description of CV-QKD, and a recent powerful result on the extremality of Gaussian states [Phys. Rev. Lett. 96, 080502 (2006)].
It is shown that an existing method to study ideal individual attacks on the BB84 QKD protocol using error discard can be adapted to reconciliation with error correction, and that an optimal attack can be explicitly found. Moreover, this attack fills Luetkenhaus bound, independently of whether error positions are leaked to Eve, proving that it is tight. In addition, we clarify why the existence of such optimal attacks is not in contradiction with the established ``old-style'' theory of BB84 individual attacks, as incorrectly suggested recently in a news feature.
We experimentally implemented an eavesdropping attack against the Ekert protocol for quantum key distribution based on the Wigner inequality. We demonstrate a serious lack of security of this protocol when the eavesdropper gains total control of the source. In addition we tested a modified Wigner inequality which should guarantee a secure quantum key distribution.
We provide a security analysis of continuous-variable quantum key distribution (CVQKD) with discrete modulation against general attacks in a realistic finite-size regime. To realize this goal, we first prove security of the continuous-variable quantum key distribution protocol with discrete modulation against collective attacks by using the reliable tomography of the covariance matrix, leading to the reliable and tight error bounds in the derived confidence regions. Combining the proof with de Finetti reduction, the discrete-modulation-based continuous-variable quantum key distribution (DM-CVQ…
We consider the two-way quantum cryptographic protocol with coherent states assuming direct reconciliation. A detailed security analysis is performed considering a two-mode coherent attack, that represents the residual eavesdropping once the parties have reduced the general attack by applying symmetric random permutations. In this context we provide a general analytical expression for the keyrate, discussing the impact of the residual two-mode correlations on the security of the scheme. In particular we identify the optimal eavesdropping against two-way quantum communication, which is given by…
Wiesner's quantum money [5] is a simple, information-theoretically secure quantum cryptographic protocol. In his protocol, a mint issues quantum bills and anyone can query the mint to authenticate a bill. If the mint returns bogus bills when it is asked to authenticate them, then the protocol can be broken in linear time.
Device and semi-device independent quantum randomness generators (DI- and SDI-QRNGs) are crucial for applications requiring private randomness. However, they are vulnerable to detection inefficiency attacks and this limits severely their usage for practical purposes. Here, we present a method for protecting SDI-QRNGs in prepare-and-measure scenarios against detection inefficiency attacks. The key idea is the introduction of a blocking device that adds failures in the communication between the preparation and measurement devices. We prove that, for any detection efficiency, there is a blocking …
We propose a countermeasure against the so-call tailored bright illumination attacl dor Differential-Phase-Shift QKD (DPS-QKD). By Monitoring a rate of coincidence detection at a pair of superconducting nanowire single photon detectors (SSPDs) which is connected at each of the output ports of Bob's Mach-Zehnder interferometer, Alice and Bob can detect and defeat this kind of attack.
We study the amplification of security against quantum attacks provided by iteration of block ciphers. In the classical case, the Meet-in-the-middle attack is a generic attack against those constructions. This attack reduces the time required to break double iterations to only twice the time it takes to attack a single block cipher, given that the attacker has access to a large amount of memory. More abstractly, it shows that security by composition does not achieve exact multiplicative amplification. We present a quantized version of this attack based on an optimal quantum algorithm for the E…
The Quantum Key Distribution (QKD) protocol BB84 has been proven secure against several important types of attacks: the collective attacks and the joint attacks. Here we analyze the security of a modified BB84 protocol, for which information is sent only in the z basis while testing is done in both the z and the x bases, against collective attacks. The proof follows the framework of a previous paper (Boyer, Gelles, and Mor, 2009), but it avoids the classical information-theoretical analysis that caused problems with composability. We show that this modified BB84 protocol is as secure against c…
Semiconductor avalanche photodiodes (APDs) are commonly used for single photon detection in quantum key distribution. Recently, many attacks using bright illumination have been proposed to manipulate gated InGaAs APDs. In order to devise effective counter-measures, careful analysis of these attacks must be carried out to distinguish between incorrect operation and genuine loopholes. Here, we show that correctly-operated, gated APDs are immune to continuous-wave illumination attacks, while monitoring the photocurrent for anomalously high values is a straightforward counter-measure against attac…
Quantum Cryptography uses the counter-intuitive properties of Quantum Mechanics for performing cryptographic tasks in a secure and reliable way. The Quantum Key Distribution (QKD) protocol BB84 has been proven secure against several important types of attacks: collective attacks and joint attacks. Here we analyze the security of a modified BB84 protocol, for which information is sent only in the z basis while testing is done in both the z and the x bases, against collective attacks. The proof follows the framework of a previous paper (Boyer, Gelles, and Mor, 2009), but it avoids a classical in…
Quantum Key Distribution or QKD provides symmetric key distribution using the quantum mechanics/channels with new security properties. The security of QKD relies on the difficulty of the quantum state discrimination problem. We discover that the recent developments in $\mathcal{PT}$ symmetry can be used to expedite the quantum state discrimination problem and therefore to attack the BB84 QKD scheme. We analyze the security of the BB84 scheme and show that the attack significantly increases the eavesdropping success rate over the previous Hermitian quantum state discrimination approach. We desi…
We present an active anti-latching system for superconducting nanowire single-photon detectors. We experimentally test it against a bright-light attack, previously used to compromise security of quantum key distribution. Although our system detects continuous blinding, the detector is shown to be partially blindable and controllable by specially tailored sequences of bright pulses. Improvements to the countermeasure are suggested.
