基于BB84协议的量子密钥分发安全门限研究

本文分析了实际量子密钥分发过程中,量子态可能受到的各种影响因素;建立了相应的信道模型;推得了非理想信道BB84协议判别窃听的安全门限公式.通过计算与仿真,证明该公式用于估计BB84协议的安全通信门限更加准确,判断量子密钥分发过程中是否存在窃听更为有效,同时具有提高通信安全性和密钥分发效率的优点. 关键词： 信道模型 BB84协议 窃听判别 安全门限     

Quantum key agreement protocol based on BB84

This work presents a quantum key agreement (QKA) based on the BB84 protocol. The newly proposed QKA protocol enables two involved parties to jointly establish a shared secret key in such a way that the shared secret key cannot be fully determined by one party alone. In contrast to the traditional key agreement protocols that must be based on some mathematical difficulties, the security of the newly proposed protocol is based on the quantum phenomena, which allows unconditional security as well as detection of eavesdroppers. With the technique of delayed measurement, the proposed protocol has 50% qubit efficiency. Therefore, it is very efficient and feasible for practical applications.     

Simple proof of security of the BB84 quantum key distribution protocol

We prove that the 1984 protocol of Bennett and Brassard (BB84) for quantum key distribution is secure. We first give a key distribution protocol based on entanglement purification, which can be proven secure using methods from Lo and Chau's proof of security for a similar protocol. We then show that the security of this protocol implies the security of BB84. The entanglement purification based protocol uses Calderbank-Shor-Steane codes, and properties of these codes are used to remove the use of quantum computation from the Lo-Chau protocol.     

Cryptographic robustness of practical quantum cryptography: BB84 key distribution protocol

In real fiber-optic quantum cryptography systems, the avalanche photodiodes are not perfect, the source of quantum states is not a single-photon one, and the communication channel is lossy. For these reasons, key distribution is impossible under certain conditions for the system parameters. A simple analysis is performed to find relations between the parameters of real cryptography systems and the length of the quantum channel that guarantee secure quantum key distribution when the eavesdropper’s capabilities are limited only by fundamental laws of quantum mechanics while the devices employed by the legitimate users are based on current technologies. Critical values are determined for the rate of secure real-time key generation that can be reached under the current technology level. Calculations show that the upper bound on channel length can be as high as 300 km for imperfect photodetectors (avalanche photodiodes) with present-day quantum efficiency (η ≈ 20%) and dark count probability (p _dark ～ 10^?7).     

用于BB84相位编码量子密钥分发系统的不间断式主动相位补偿方案

提出一种新的不间断的主动相位补偿方案,在进行量子密钥分发的同时统计不匹配基量子比特在干涉仪不同输出端口上的随机计数分布,给出了由不匹配基量子比特统计数值计算相位漂移参数的计算公式,并由统计数值计算得到相位漂移参数。结果表明：该方案允许系统并行处理量子密钥分发与相位补偿,也充分利用了在原BB84协议中会被丢弃的不匹配基量子比特信息。     

用于BB84相位编码量子密钥分发系统的不间断式主动相位补偿方案

提出一种新的不间断的主动相位补偿方案,在进行量子密钥分发的同时统计不匹配基量子比特在干涉仪不同输出端口上的随机计数分布,给出了由不匹配基量子比特统计数值计算相位漂移参数的计算公式,并由统计数值计算得到相位漂移参数.结果表明:该方案允许系统并行处理量子密钥分发与相位补偿,也充分利用了在原BB84协议中会被丢弃的不匹配基量...     

Practical decoy-state BB84 quantum key distribution with quantum memory

We generalize BB84 quantum key distribution(QKD) to the scenario where the receiver adopts a heralded quantum memory(QM). With the heralded QM, the valid dark count rate of the receiver's single photon detectors can be mitigated obviously, which will lower the quantum bit error rate, and thus improve the performance of decoy-state BB84 QKD systems in long distance range. Simulation results show that, with practical experimental system parameters, decoy-state BB84 QKD with QM can exhibit performance comparable to that of without QM in short distance range, and exhibit performance better than that without QM in long distance range.     

Shor and Preskill's and Mayers's security proof for the BB84 quantum key distribution protocol

We review two security proofs for the BB84 quantum key distribution protocol: Mayers's security proof and the more recent proof of Shor and Preskill. We focus on the basic principles and the intuition in Mayers's proof instead of technical details. We present a variation on Shor's and Preskill's proof which is convenient for purpose of comparison. We explain the connection between these two proofs. Received 14 July 2001     

Implementation of polarization-coded free-space BB84 quantum key distribution

We report on the implementation of a Bennett-Brassard 1984 quantum key distribution protocol over a free-space optical path on an optical table. Attenuated laser pulses and Pockels cells driven by a pseudorandom number generator are employed to prepare polarization-encoded photons. The sifted key generation rate of 23.6 kbits per second and the quantum bit error rate (QBER) of 3% have been demonstrated at the average photon number per pulse μ = 0.16. This QBER is sufficiently low to extract final secret keys from shared sifted keys via error correction and privacy amplification. We also tested the long-distance capability of our system by adding optical losses to the quantum channel and found that the QBER remains the same regardless of the loss.     

Security of biased BB84 quantum key distribution with finite resource

In the original BB84 quantum key distribution protocol, the states are prepared and measured randomly, which lose the unmatched detection results. To improve the sifting efficiency, biased bases selection BB84 protocol is proposed. Meanwhile, a practical quantum key distribution protocol can only transmit a finite number of signals, resulting in keys of finite length. The previous techniques for finite-key analysis focus mainly on the statistical fluctuations of the error rates and yields of the qubits. However, the prior choice probabilities of the two bases also have fluctuations by taking into account the finite-size effect. In this paper, we discuss the security of biased decoy state BB84 protocol with finite resources by considering all of the statistical fluctuations. The results can be directly used in the experimental realizations.     

基于BB84协议的量子保密通信实验

基于BB84量子保密通信协议,利用光子的偏振态传输信息.发送方和接收方通过量子信道来传输量子态,同时双方通过一条经典信道进行基矢比对和其他信息交互,进而两边同时安全地获得和共享一份相同的密钥.     

Quantum election scheme based on anonymous quantum key distribution

An unconditionally secure authority-certified anonymous quantum key distribution scheme using conjugate coding is presented,based on which we construct a quantum election scheme without the help of an entanglement state.We show that this election scheme ensures the completeness,soundness,privacy,eligibility,unreusability,fairness,and verifiability of a large-scale election in which the administrator and counter are semi-honest.This election scheme can work even if there exist loss and errors in quantum channels.In addition,any irregularity in this scheme is sensible.     

On the optimality of individual entangling-probe attacks against BB84 quantum key distribution

Some MIT researchers [Phys. Rev. A 75, 042327 (2007)] have recently claimed that their implementation of the Slutsky-Brandt attack [Phys. Rev. A 57, 2383 (1998); Phys. Rev. A 71, 042312 (2005)] to the BB84 quantum-key-distribution (QKD) protocol puts the security of this protocol “to the test” by simulating “the most powerful individual-photon attack” [Phys. Rev. A 73, 012315 (2006)]. A related unfortunate news feature by a scientific journal [G. Brumfiel, Quantum cryptography is hacked, News @ Nature (april 2007); Nature 447, 372 (2007)] has spurred some concern in the QKD community and among the general public by misinterpreting the implications of this work. The present article proves the existence of a stronger individual attack on QKD protocols with encrypted error correction, for which tight bounds are shown, and clarifies why the claims of the news feature incorrectly suggest a contradiction with the established “old-style” theory of BB84 individual attacks. The full implementation of a quantum cryptographic protocol includes a reconciliation and a privacy-amplification stage, whose choice alters in general both the maximum extractable secret and the optimal eavesdropping attack. The authors of [Phys. Rev. A 75, 042327 (2007)] are concerned only with the error-free part of the so-called sifted string, and do not consider faulty bits, which, in the version of their protocol, are discarded. When using the provably superior reconciliation approach of encrypted error correction (instead of error discard), the Slutsky-Brandt attack is no more optimal and does not “threaten” the security bound derived by Lütkenhaus [Phys. Rev. A 59, 3301 (1999)]. It is shown that the method of Slutsky and collaborators [Phys. Rev. A 57, 2383 (1998)] can be adapted to reconciliation with error correction, and that the optimal entangling probe can be explicitly found. Moreover, this attack fills Lütkenhaus bound, proving that it is tight (a fact which was not previously known).     

Quantum hacking of two-way continuous-variable quantum key distribution using Trojan-horse attack

We present a Trojan-horse attack on the practical two-way continuous-variable quantum key distribution system. Our attack mainly focuses on the imperfection of the practical system that the modulator has a redundancy of modulation pulsewidth, which leaves a loophole for the eavesdropper inserting a Trojan-horse pulse. Utilizing the unique characteristics of two-way continuous-variable quantum key distribution that Alice only takes modulation operation on the received mode without any measurement, this attack allows the eavesdropper to render all of the final keys shared between the legitimate parties insecure without being detected. After analyzing the feasibility of the attack, the corresponding countermeasures are put forward.     

Quantum circuit for optimal eavesdropping in quantum key distribution using phase-time coding

A quantum circuit is constructed for optimal eavesdropping on quantum key distribution proto- cols using phase-time coding, and its physical implementation based on linear and nonlinear fiber-optic components is proposed.     

Cascading attack on trusted-relay quantum key distribution networks

Trusted relays are the main state-of-the-art way to realize quantum key distribution networks.However, it is hard to require that all nodes in the network are fully trusted. In a multipath keytransmission mechanism, the nodes can be weakly trusted because the secret key can be split into many parts and each part is transmitted to the receiver through a different path. However, if the capacity of a node's quantum key pool is poorly designed, an attacker, Eve may eavesdrop on the communicating parties' secret message by initiating a redirection attack. In this paper, we show that Eve can trigger a cascading collapse effect by collapsing one of the edges in the network and forcing the communication parties to transmit the message through the nodes controlled by Eve. The influence of the traffic transfer ratio and the control parameters of the edge load on the breakdown probability of the edge are analyzed using a simulation. In order to effectively defend against the cascading attack, it is important for the designer to handle the relationship between the traffic and the capacity of the quantum key pool of each node in the network.     

Improved two-way six-state protocol for quantum key distribution

A generalized version for a qubit based two-way quantum key distribution scheme was first proposed in the paper [Phys. Lett. A 358 (2006) 85] capitalizing on the six quantum states derived from three mutually unbiased bases. While boasting of a higher level of security, the protocol was not designed for ease of practical implementation. In this work, we propose modifications to the protocol, resulting not only in improved security but also in a more efficient and practical setup. We provide comparisons for calculated secure key rates for the protocols in noisy and lossy channels.     

A frequency-coded quantum key distribution scheme

A frequency-coded quantum key distribution scheme, what we propose here, is that using encoded qubit in different frequency of a photon in four kinds of states. These states satisfy requirements of BB84 protocol and could be produced with the recent advances in technology. Comparing with the scheme proposed in [Bloch et al., Opt. Lett. 32 (2007) 301], our scheme has no intrinsic deficiency that the measurement of one kind of the states will get wrong result with a little probability, and is a perfect BB84 protocol. The characters and feasibility of the scheme are discussed in detail.     

基于非正交态的量子密钥验证方案

研究了量子密钥分发的验证问题,并利用非正交量子态设计了一个协议,该协议既能分发量子密钥,又能验证所分发的量子密钥的真实性,从而防止了以往所提出协议中可能存在的假冒问题 关键词： 量子密钥验证 量子密码 量子物理 密码学     

基于量子远程通信的连续变量量子确定性密钥分配协议

基于量子远程通信的原理, 本文借助双模压缩真空态和相干态, 提出一种连续变量量子确定性密钥分配协议. 在利用零差探测法的情况下协议的传输效率达到了100%. 从信息论的角度分析了协议的安全性, 结果表明该协议可以安全传送预先确定的密钥. 在密钥管理中, 量子确定性密钥分配协议具有量子随机性密钥分配协议不可替代的重要地位和作用. 与离散变量量子确定性密钥分配协议相比, 该协议分发密钥的速率和效率更高, 又协议中用到的连续变量量子态易于产生和操控、适于远距离传输, 因此该协议更具有实际意义.