arXiv subjects

Chi-Hang Fred Fung

Publications and source records attributed to Chi-Hang Fred Fung.

At least 37 records · Page 2Linked to original sources

arXiv2013

Two-way deterministic quantum key distribution against detector side channel attacks

In a two-way deterministic quantum key distribution (DQKD) protocol, Bob randomly prepares qubits in one of four states and sends them to Alice. To encode a bit, Alice performs an operation on each received qubit and returns it to Bob. Bob then measures the backward qubits to learn about Alice's operations and hence the key bits. Recently, we proved the unconditional security of the final key of this protocol in the ideal device setting. In this paper, we prove that two-way DQKD protocols are immune to all detector side channel attacks at Bob's side, while we assume ideal detectors at Alice's side for error testing. Our result represents a step forward in making DQKD protocols secure against general detector side channel attacks.

quant-ph↗

arXiv2013

Source attack of decoy-state quantum key distribution using phase information

Quantum key distribution (QKD) utilizes the laws of quantum mechanics to achieve information-theoretically secure key generation. This field is now approaching the stage of commercialization, but many practical QKD systems still suffer from security loopholes due to imperfect devices. In fact, practical attacks have successfully been demonstrated. Fortunately, most of them only exploit detection-side loopholes which are now closed by the recent idea of measurement-device-independent QKD. On the other hand, little attention is paid to the source which may still leave QKD systems insecure. In this work, we propose and demonstrate an attack that exploits a source-side loophole existing in qubit-based QKD systems using a weak coherent state source and decoy states. Specifically, by implementing a linear-optics unambiguous-state-discrimination measurement, we show that the security of a system without phase randomization --- which is a step assumed in conventional security analyses but sometimes neglected in practice --- can be compromised. We conclude that implementing phase randomization is essential to the security of decoy-state QKD systems under current security analyses.

quant-ph↗

arXiv2013

Time-Energy Measure for Quantum Processes

Quantum mechanics sets limits on how fast quantum processes can run given some system energy through time-energy uncertainty relations, and they imply that time and energy are tradeoff against each other. Thus, we propose to measure the time-energy as a single unit for quantum channels. We consider a time-energy measure for quantum channels and compute lower and upper bounds of it using the channel Kraus operators. For a special class of channels (which includes the depolarizing channel), we can obtain the exact value of the time-energy measure. One consequence of our result is that erasing quantum information requires $\sqrt{(n+1)/n}$ times more time-energy resource than erasing classical information, where $n$ is the system dimension.

quant-ph↗

arXiv2013

Structural Characterization And Condition For Measurement Statistics Preservation Of A Unital Quantum Operation

We investigate the necessary and sufficient condition for a convex cone of positive semidefinite operators to be fixed by a unital quantum operation $ϕ$ acting on finite-dimensional quantum states. By reducing this problem to the problem of simultaneous diagonalization of the Kraus operators associated with $ϕ$, we can completely characterize the kind of quantum states that are fixed by $ϕ$. Our work has several applications. It gives a simple proof of the structural characterization of a unital quantum operation that acts on finite-dimensional quantum states --- a result not explicitly mentioned in earlier studies. It also provides a necessary and sufficient condition for what kind of measurement statistics is preserved by a unital quantum operation. Finally, our result clarifies and extends the work of Størmer by giving a proof of a reduction theorem on the unassisted and entanglement-assisted classical capacities, coherent information, and minimal output Renyi entropy of a unital channel acting on finite-dimensional quantum state.

quant-ph↗

arXiv2012

Statistical fluctuation analysis for measurement-device-independent quantum key distribution

Measurement-device-independent quantum key distribution with a finite number of decoy states is analyzed under finite-data-size assumption. By accounting for statistical fluctuations in parameter estimation, we investigate vacuum+weak- and vacuum+two-weak-decoy-state protocols. In each case, we find proper operation regimes, where the performance of our system is comparable to the asymptotic case for which the key size and the number of decoy states approach infinity. Our results show that practical implementations of this scheme can be both secure and efficient.

quant-ph↗

arXiv2012

Entanglement transformation between sets of bipartite pure quantum states using local operations

Alice and Bob are given an unknown initial state chosen from a set of pure quantum states. Their task is to transform the initial state to a corresponding final pure state using local operations only. We prove necessary and sufficient conditions on the existence of such a transformation. We also provide efficient algorithms that can quickly rule out the possibility of transforming a set of initial states to a set of final states.

quant-ph↗

arXiv2012

Phase encoding schemes for measurement device independent quantum key distribution and basis-dependent flaw

In this paper, we study the unconditional security of the so-called measurement device independent quantum key distribution (MDIQKD) with the basis-dependent flaw in the context of phase encoding schemes. We propose two schemes for the phase encoding, the first one employs a phase locking technique with the use of non-phase-randomized coherent pulses, and the second one uses conversion of standard BB84 phase encoding pulses into polarization modes. We prove the unconditional security of these schemes and we also simulate the key generation rate based on simple device models that accommodate imperfections. Our simulation results show the feasibility of these schemes with current technologies and highlight the importance of the state preparation with good fidelity between the density matrices in the two bases. Since the basis-dependent flaw is a problem not only for MDIQKD but also for standard QKD, our work highlights the importance of an accurate signal source in practical QKD systems. Note: We include the erratum of this paper in Appendix C. The correction does not affect the validity of the main conclusions reported in the paper, which is the importance of the state preparation in MDIQKD and the fact that our schemes can generate the key with the practical channel mode that we have assumed.

quant-ph↗

arXiv2012

Quantum key distribution with delayed privacy amplification and its application to security proof of a two-way deterministic protocol

Privacy amplification (PA) is an essential post-processing step in quantum key distribution (QKD) for removing any information an eavesdropper may have on the final secret key. In this paper, we consider delaying PA of the final key after its use in one-time pad encryption and prove its security. We prove that the security and the key generation rate are not affected by delaying PA. Delaying PA has two applications: it serves as a tool for significantly simplifying the security proof of QKD with a two-way quantum channel, and also it is useful in QKD networks with trusted relays. To illustrate the power of the delayed PA idea, we use it to prove the security of a qubit-based two-way deterministic QKD protocol which uses four states and four encoding operations.

quant-ph↗

arXiv2011

Unconditional security proof of a deterministic quantum key distribution with a two-way quantum channel

In a deterministic quantum key distribution (DQKD) protocol with a two-way quantum channel, Bob sends a qubit to Alice who then encodes a key bit onto the qubit and sends it back to Bob. After measuring the returned qubit, Bob can obtain Alice's key bit immediately, without basis reconciliation. Since an eavesdropper may attack the qubits traveling on either the Bob-Alice channel or the Alice-Bob channel, the security analysis of DQKD with a two-way quantum channel is complicated and its unconditional security has been controversial. This paper presents a security proof of a single-photon four-state DQKD against general attacks.

quant-ph↗

arXiv2011

Quantum Hacking: Experimental demonstration of time-shift attack against practical quantum key distribution systems

Quantum key distribution (QKD) systems can send signals over more than 100 km standard optical fiber and are widely believed to be secure. Here, we show experimentally for the first time a technologically feasible attack, namely the time-shift attack, against a commercial QKD system. Our result shows that, contrary to popular belief, an eavesdropper, Eve, has a non-negligible probability (~4%) to break the security of the system. Eve's success is due to the well-known detection efficiency loophole in the experimental testing of Bell inequalities. Therefore, the detection efficiency loophole plays a key role not only in fundamental physics, but also in technological applications such as QKD.

quant-ph↗

arXiv2010

Universal Squash Model For Optical Communications Using Linear Optics And Threshold Detectors

The transmission of photons through open-air or an optical fiber is an important primitive in quantum information processing. Theoretical description of such a transmission process often considers only a single photon as the information carrier and thus fails to accurately describe experimental optical implementations where any number of photons may enter a detector. It is important to bridge this big gap between experimental implementations and the theoretical description. One powerful method that emerges from recent efforts to achieve this goal is to consider a squash model that conceptually converts multi-photon states to single-photon states, thereby justifying the equivalence between theory and experiments. However, up to now, only a limited number of protocols admit a squash model; furthermore, a no-go theorem has been proven which appears to rule out the existence of a universal squash model. Here, we observe that an apparently necessary condition demanded by all existing squash models to preserve measurement statistics is too stringent a requirement for many protocols. By chopping this requirement, we show that rather surprisingly, a universal squash model actually exists for a wide range of protocols including quantum key distribution protocols, quantum state tomography, the testing of Bell's inequalities, and entanglement verification, despite the standard no-go theorem.

quant-ph↗

arXiv2009

Practical issues in quantum-key-distribution post-processing

Quantum key distribution (QKD) is a secure key generation method between two distant parties by wisely exploiting properties of quantum mechanics. In QKD, experimental measurement outcomes on quantum states are transformed by the two parties to a secret key. This transformation is composed of many logical steps (as guided by security proofs), which together will ultimately determine the length of the final secret key and its security. We detail the procedure for performing such classical post-processing taking into account practical concerns (including the finite-size effect and authentication and encryption for classical communications). This procedure is directly applicable to realistic QKD experiments, and thus serves as a recipe that specifies what post-processing operations are needed and what the security level is for certain lengths of the keys. Our result is applicable to the BB84 protocol with a single or entangled photon source.

quant-ph↗

arXiv2009

Practical post-processing for quantum-key-distribution experiments

Quantum key distribution (QKD) promises unconditionally secure key generation between two distant parties by wisely exploiting properties of quantum mechanics. In QKD, experimental measurements on quantum states are transformed to a secret key and this has to be done in accordance with a security proof. Unfortunately, many theoretical proofs are not readily implementable in experiments and do not consider all practical issues. Therefore, in order to bridge this "practical gap", we integrate a few existing theoretical results together with new developments, in effect producing a simple and complete recipe for classical post-processing that one can follow to derive a secret key from the measurement outcomes in an actual QKD experiment. This integration is non-trivial and our consideration is both practical and comprehensive in the sense that we take into account the finiteness of the key length and consider the effects on security of several essential primitives (including authentication, error handling, and privacy amplification). Furthermore, we quantify the security of the final secret key that is universally composable. We show that the finite-size effect mainly comes from phase error estimation. Our result is applicable to the BB84 protocol with a single or entangled photon source.

quant-ph↗

arXiv2008

Security proof of differential phase shift quantum key distribution in the noiseless case

Differential phase shift quantum key distribution systems have a high potential for achieving high speed key generation. However, its unconditional security proof is still missing, even though it has been proposed for many years. Here, we prove its security against collective attacks with a weak coherent light source in the noiseless case (i.e. no bit error). The only assumptions are that quantum theory is correct, the devices are perfect and trusted and the key size is infinite. Our proof works on threshold detectors. We compute the lower bound of the secret key generation rate using the information-theoretical security proof method. Our final result shows that the lower bound of the secret key generation rate per pulse is linearly proportional to the channel transmission probability if Bob's detection counts obey the binomial distribution.

quant-ph↗

arXiv2008

Security proof of quantum key distribution with detection efficiency mismatch

In theory, quantum key distribution (QKD) offers unconditional security based on the laws of physics. However, as demonstrated in recent quantum hacking theory and experimental papers, detection efficiency loophole can be fatal to the security of practical QKD systems. Here, we describe the physical origin of detection efficiency mismatch in various domains including spatial, spectral, and time domains and in various experimental set-ups. More importantly, we prove the unconditional security of QKD even with detection efficiency mismatch. We explicitly show how the key generation rate is characterized by the maximal detection efficiency ratio between the two detectors. Furthermore, we prove that by randomly switching the bit assignments of the detectors, the effect of detection efficiency mismatch can be completely eliminated.

quant-ph↗

arXiv2008

Getting Information on Independently Prepared Quantum States -- When Are Individual Measurements as Powerful as Joint Measurements?

Given a composite quantum system in which the states of the subsystems are independently (but not necessarily identically) prepared, we construct separate measurements on the subsystems from any given joint measurement such that the former always give at least as large information as the latter. This construction offers new insights into the understanding of measurements on this type of composite systems. Moreover, this construction essentially proves the intuition that separate measurements on the subsystems are sufficient to extract the maximal information about the separately prepared subsystems, thus making a joint measurement unnecessary. Furthermore, our result implies that individual attacks are as powerful as collective attacks in obtaining information on the raw key in quantum key distribution.

quant-ph↗

arXiv2007

Quantum key distribution with entangled photon sources

A parametric down-conversion (PDC) source can be used as either a triggered single photon source or an entangled photon source in quantum key distribution (QKD). The triggering PDC QKD has already been studied in the literature. On the other hand, a model and a post-processing protocol for the entanglement PDC QKD are still missing. In this paper, we fill in this important gap by proposing such a model and a post-processing protocol for the entanglement PDC QKD. Although the PDC model is proposed to study the entanglement-based QKD, we emphasize that our generic model may also be useful for other non-QKD experiments involving a PDC source. Since an entangled PDC source is a basis independent source, we apply Koashi-Preskill's security analysis to the entanglement PDC QKD. We also investigate the entanglement PDC QKD with two-way classical communications. We find that the recurrence scheme increases the key rate and Gottesman-Lo protocol helps tolerate higher channel losses. By simulating a recent 144km open-air PDC experiment, we compare three implementations -- entanglement PDC QKD, triggering PDC QKD and coherent state QKD. The simulation result suggests that the entanglement PDC QKD can tolerate higher channel losses than the coherent state QKD. The coherent state QKD with decoy states is able to achieve highest key rate in the low and medium-loss regions. By applying Gottesman-Lo two-way post-processing protocol, the entanglement PDC QKD can tolerate up to 70dB combined channel losses (35dB for each channel) provided that the PDC source is placed in between Alice and Bob. After considering statistical fluctuations, the PDC setup can tolerate up to 53dB channel losses.

quant-ph↗

arXiv2007

Phase-Remapping Attack in Practical Quantum Key Distribution Systems

Quantum key distribution (QKD) can be used to generate secret keys between two distant parties. Even though QKD has been proven unconditionally secure against eavesdroppers with unlimited computation power, practical implementations of QKD may contain loopholes that may lead to the generated secret keys being compromised. In this paper, we propose a phase-remapping attack targeting two practical bidirectional QKD systems (the "plug & play" system and the Sagnac system). We showed that if the users of the systems are unaware of our attack, the final key shared between them can be compromised in some situations. Specifically, we showed that, in the case of the Bennett-Brassard 1984 (BB84) protocol with ideal single-photon sources, when the quantum bit error rate (QBER) is between 14.6% and 20%, our attack renders the final key insecure, whereas the same range of QBER values has been proved secure if the two users are unaware of our attack; also, we demonstrated three situations with realistic devices where positive key rates are obtained without the consideration of Trojan horse attacks but in fact no key can be distilled. We remark that our attack is feasible with only current technology. Therefore, it is very important to be aware of our attack in order to ensure absolute security. In finding our attack, we minimize the QBER over individual measurements described by a general POVM, which has some similarity with the standard quantum state discrimination problem.

quant-ph↗