Searcharxiv⌕ Search

arXiv subjects

Hoi-Kwong Lo

Publications and source records attributed to Hoi-Kwong Lo.

At least 109 records · Page 6Linked to original sources
arXiv2008

Quantum key distribution with an unknown and untrusted source

The security of a standard bi-directional "plug & play" quantum key distribution (QKD) system has been an open question for a long time. This is mainly because its source is equivalently controlled by an eavesdropper, which means the source is unknown and untrusted. Qualitative discussion on this subject has been made previously. In this paper, we present the first quantitative security analysis on a general class of QKD protocols whose sources are unknown and untrusted. The securities of standard BB84 protocol, weak+vacuum decoy state protocol, and one-decoy decoy state protocol, with unknown and untrusted sources are rigorously proved. We derive rigorous lower bounds to the secure key generation rates of the above three protocols. Our numerical simulation results show that QKD with an untrusted source gives a key generation rate that is close to that with a trusted source.

quant-ph↗
arXiv2008

Multi-partite quantum cryptographic protocols with noisy GHZ states

We propose a wide class of distillation schemes for multi-partite entangled states that are CSS-states. Our proposal provides not only superior efficiency, but also new insights on the connection between CSS-states and bipartite graph states. We then apply our distillation schemes to the tri-partite case for three cryptographic tasks--namely, (a) conference key agreement, (b) quantum sharing of classical secrets and (c) third-man cryptography. Moreover, we construct ``prepare-and-measure'' protocols for the above three cryptographic tasks which can be implemented with the generation of only a single entangled pair at a time. This gives significant simplification over previous experimental implementations which require two entangled pairs generated simultaneously. We also study the yields of those protocols and the threshold values of the fidelity above which the protocols can function securely. Rather surprisingly, our protocols will function securely even when the initial state does not violate the standard Bell-inequalities for GHZ states.

quant-ph↗
arXiv2008

Quantum key distribution with triggering parametric down conversion sources

Parametric down-conversion (PDC) sources can be used for quantum key distribution (QKD). One can use a PDC source as a triggered single photon source. Recently, there are various practical proposals of the decoy state QKD with triggering PDC sources. In this paper, we generalize the passive decoy state idea, originally proposed by Mauerer and Silberhorn. The generalized passive decoy state idea can be applied to cases where either threshold detectors or photon number resolving detectors are used. The decoy state protocol proposed by Adachi, Yamamoto, Koashi and Imoto (AYKI) can be treated as a special case of the generalized passive decoy state method. By simulating a recent PDC experiment, we compare various practical decoy state protocols with the infinite decoy protocol and also compare the cases using threshold detectors and photon-number resolving detectors. Our simulation result shows that with the AYKI protocol, one can achieve a key generation rate that is close to the theoretical limit of infinite decoy protocol. Furthermore, our simulation result shows that a photon-number resolving detector appears to be not very useful for improving QKD performance in this case. Although our analysis is focused on the QKD with PDC sources, we emphasize that it can also be applied to other QKD setups with triggered single photon sources.

quant-ph↗
arXiv2008

Random multiparty entanglement distillation

We describe various results related to the random distillation of multiparty entangled states - that is, conversion of such states into entangled states shared between fewer parties, where those parties are not predetermined. In previous work [Phys. Rev. Lett. 98, 260501 (2007)] we showed that certain output states (namely Einstein-Podolsky-Rosen (EPR) pairs) could be reliably acquired from a prescribed initial multipartite state (namely the W state) via random distillation that could not be reliably created between predetermined parties. Here we provide a more rigorous definition of what constitutes ``advantageous'' random distillation. We show that random distillation is always advantageous for W-class three-qubit states (but only sometimes for Greenberger-Horne-Zeilinger (GHZ)-class states). We show that the general class of multiparty states known as symmetric Dicke states can be readily converted to many other states in the class via random distillation. Finally we show that random distillation is provably not advantageous in the limit of multiple copies of pure states.

quant-ph↗
arXiv2007

Possibility, Impossibility and Cheat-Sensitivity of Quantum Bit String Commitment

Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum worlds. But when committing to a string of n bits at once, how far can we stretch the quantum limits? In this paper, we introduce a framework for quantum schemes where Alice commits a string of n bits to Bob in such a way that she can only cheat on a bits and Bob can learn at most b bits of information before the reveal phase. Our results are two-fold: we show by an explicit construction that in the traditional approach, where the reveal and guess probabilities form the security criteria, no good schemes can exist: a+b is at least n. If, however, we use a more liberal criterion of security, the accessible information, we construct schemes where a=4log n+O(1) and b=4, which is impossible classically. We furthermore present a cheat-sensitive quantum bit string commitment protocol for which we give an explicit tradeoff between Bob's ability to gain information about the committed string, and the probability of him being detected cheating.

quant-ph↗
arXiv2007

Experimental study on Gaussian-modulated coherent states quantum key distribution over standard telecom fiber

In this paper, we present a fully fiber-based one-way Quantum Key Distribution (QKD) system implementing the Gaussian-Modulated Coherent States (GMCS) protocol. The system employs a double Mach-Zehnder Interferometer (MZI) configuration in which the weak quantum signal and the strong Local Oscillator (LO) go through the same fiber between Alice and Bob, and are separated into two paths inside Bob's terminal. To suppress the LO leakage into the signal path, which is an important contribution to the excess noise, we implemented a novel scheme combining polarization and frequency multiplexing, achieving an extinction ratio of 70dB. To further minimize the system excess noise due to phase drift of the double MZI, we propose that, instead of employing phase feedback control, one simply let Alice remap her data by performing a rotation operation. We further present noise analysis both theoretically and experimentally. Our calculation shows that the combined polarization and frequency multiplexing scheme can achieve better stability in practice than the time-multiplexing scheme, because it allows one to use matched fiber lengths for the signal and the LO paths on both sides of the double MZI, greatly reducing the phase instability caused by unmatched fiber lengths. Our experimental noise analysis quantifies the three main contributions to the excess noise, which will be instructive to future studies of the GMCS QKD systems. Finally, we demonstrate, under the "realistic model" in which Eve cannot control the system within Bob's terminal, a secure key rate of 0.3bit/pulse over a 5km fiber link. This key rate is about two orders of magnitude higher than that of a practical BB84 QKD system.

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

Quantum Cryptography: from Theory to Practice

Quantum cryptography can, in principle, provide unconditional security guaranteed by the law of physics only. Here, we survey the theory and practice of the subject and highlight some recent developments.

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↗
arXiv2007

Random bipartite entanglement from W and W-like states

We describe a protocol for distilling maximally entangled bipartite states between random pairs of parties from those sharing a tripartite W state, and show that, rather surprisingly, the total distillation rate (the total number of EPR pairs distilled per W, irrespective of who shares them) may be done at a higher rate than distillation of bipartite entanglement between specified pairs of parties. Specifically, the optimal distillation rate for specified entanglement for the W has been previously shown to be the asymptotic entanglement of assistance of 0.92 EPR pairs per W, while our protocol can asymptotically distill 1 EPR pair per W between random pairs of parties, which we conjecture to be optimal. We thus demonstrate a tradeoff between the overall asymptotic rate of EPR distillation and the distribution of final EPR pairs between parties. We further show that by increasing the number of parties in the protocol that there exist states with fixed lower-bounded distillable entanglement for random parties but arbitrarily small distillable entanglement for specified parties.

quant-ph↗
arXiv2007

Quantum key distribution with "dual detectors"

To improve the performance of a quantum key distribution (QKD) system, high speed, low dark count single photon detectors (or low noise homodyne detectors) are required. However, in practice, a fast detector is usually noisy. Here, we propose a "dual detectors" method to improve the performance of a practical QKD system with realistic detectors: the legitimate receiver randomly uses either a fast (but noisy) detector or a quiet (but slow) detector to measure the incoming quantum signals. The measurement results from the quiet detector can be used to bound eavesdropper's information, while the measurement results from the fast detector are used to generate secure key. We apply this idea to various QKD protocols. Simulation results demonstrate significant improvements in both BB84 protocol with ideal single photon source and Gaussian-modulated coherent states (GMCS) protocol; while for decoy-state BB84 protocol with weak coherent source, the improvement is moderate. We also discuss various practical issues in implementing the "dual detectors" scheme.

quant-ph↗
arXiv2007

Security of quantum key distribution using weak coherent states with nonrandom phases

We prove the security of the Bennett-Brassard (BB84) quantum key distribution protocol in the case where the key information is encoded in the relative phase of a coherent-state reference pulse and a weak coherent-state signal pulse, as in some practical implementations of the protocol. In contrast to previous work, our proof applies even if the eavesdropper knows the phase of the reference pulse, provided that this phase is not modulated by the source, and even if the reference pulse is bright. The proof also applies to the case where the key is encoded in the photon polarization of a weak coherent-state pulse with a known phase, but only if the phases of the four BB84 signal states are judiciously chosen. The achievable key generation rate scales quadratically with the transmission in the channel, just as for BB84 with phase-randomized weak coherent-state signals (when decoy states are not used). For the case where the phase of the reference pulse is strongly modulated by the source, we exhibit an explicit attack that allows the eavesdropper to learn every key bit in a parameter regime where a protocol using phase-randomized signals is provably secure.

quant-ph↗
arXiv2006

Discrete Rotational Symmetry and Quantum Key Distribution Protocols

We study the role of discrete rotational symmetry in quantum key distribution by generalizing the well-known Bennett-Brassard 1984 (BB84) and Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocols. We observe that discrete rotational symmetry results in the protocol's invariance to continuous rotations, thus leading to a simplified relation between bit and phase error rates and consequently a straightforward security proof.

quant-ph↗
arXiv2006

Security of quantum bit string commitment depends on the information measure

Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum world. However, when committing to a string of n bits at once, how far can we stretch the quantum limits? In this letter, we introduce a framework of quantum schemes where Alice commits a string of n bits to Bob, in such a way that she can only cheat on a bits and Bob can learn at most b bits of information before the reveal phase. Our results are two-fold: we show by an explicit construction that in the traditional approach, where the reveal and guess probabilities form the security criteria, no good schemes can exist: a+b is at least n. If, however, we use a more liberal criterion of security, the accessible information, we construct schemes where a=4 log n+O(1) and b=4, which is impossible classically. Our findings significantly extend known no-go results for quantum bit commitment.

quant-ph↗
arXiv2006

Experimental quantum key distribution with active phase randomization

Phase randomization is an important assumption made in many security proofs of practical quantum key distribution (QKD) systems. Here, we present the first experimental demonstration of QKD with reliable active phase randomization. One key contribution is a polarization-insensitive phase modulator, which we added to a commercial phase-coding QKD system to randomize the global phase of each bit. We also proposed a simple but useful method to verify experimentally that the phase is indeed randomized. Our result shows very low QBER (<1%). We expect this active phase randomization process to be a standard part in future QKD set-ups due to its significance and feasibility.

quant-ph↗
arXiv2006

Simulation and Implementation of Decoy State Quantum Key Distribution over 60km Telecom Fiber

Decoy state quantum key distribution (QKD) has been proposed as a novel approach to improve dramatically both the security and the performance of practical QKD set-ups. Recently, many theoretical efforts have been made on this topic and have theoretically predicted the high performance of decoy method. However, the gap between theory and experiment remains open. In this paper, we report the first experiments on decoy state QKD, thus bridging the gap. Two protocols of decoy state QKD are implemented: one-decoy protocol over 15km of standard telecom fiber, and weak+vacuum protocol over 60km of standard telecom fiber. We implemented the decoy state method on a modified commercial QKD system. The modification we made is simply adding commercial acousto-optic modulator (AOM) on the QKD system. The AOM is used to modulate the intensity of each signal individually, thus implementing the decoy state method. As an important part of implementation, numerical simulation of our set-up is also performed. The simulation shows that standard security proofs give a zero key generation rate at the distance we perform decoy state QKD (both 15km and 60km). Therefore decoy state QKD is necessary for long distance secure communication. Our implementation shows explicitly the power and feasibility of decoy method, and brings it to our real-life.

quant-ph↗