Searcharxiv⌕ Search

arXiv subjects

Chi-Hang Fred Fung

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

41 records · Page 3Linked to original sources

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↗

Security proof of a three-state quantum key distribution protocol without rotational symmetry

Standard security proofs of quantum key distribution (QKD) protocols often rely on symmetry arguments. In this paper, we prove the security of a three-state protocol that does not possess rotational symmetry. The three-state QKD protocol we consider involves three qubit states, where the first two states, |0_z> and |1_z>, can contribute to key generation and the third state, |+>=(|0_z>+|1_z>)/\sqrt{2}, is for channel estimation. This protocol has been proposed and implemented experimentally in some frequency-based QKD systems where the three states can be prepared easily. Thus, by founding on the security of this three-state protocol, we prove that these QKD schemes are, in fact, unconditionally secure against any attacks allowed by quantum mechanics. The main task in our proof is to upper bound the phase error rate of the qubits given the bit error rates observed. Unconditional security can then be proved not only for the ideal case of a single-photon source and perfect detectors, but also for the realistic case of a phase-randomized weak coherent light source and imperfect threshold detectors. Our result on the phase error rate upper bound is independent of the loss in the channel. Also, we compare the three-state protocol with the BB84 protocol. For the single-photon source case, our result proves that the BB84 protocol strictly tolerates a higher quantum bit error rate than the three-state protocol; while for the coherent-source case, the BB84 protocol achieves a higher key generation rate and secure distance than the three-state protocol when a decoy-state method is used.

quant-ph↗

Time-shift attack in practical quantum cryptosystems

Recently, a new type of attack, which exploits the efficiency mismatch of two single photon detectors (SPD) in a quantum key distribution (QKD) system, has been proposed. In this paper, we propose another "time-shift" attack that exploits the same imperfection. In our attack, Eve shifts the arrival time of either the signal pulse or the synchronization pulse or both between Alice and Bob. In particular, in a QKD system where Bob employs time-multiplexing technique to detect both bit "0" and bit "1" with the same SPD, Eve, in principle, could acquire full information on the final key without introducing any error. Finally, we discuss some counter measures against our and earlier attacks.

quant-ph↗

Decoy state quantum key distribution with two-way classical post-processing

Decoy states have recently been proposed as a useful method for substantially improving the performance of quantum key distribution protocols when a coherent state source is used. Previously, data post-processing schemes based on one-way classical communications were considered for use with decoy states. In this paper, we develop two data post-processing schemes for the decoy-state method using two-way classical communications. Our numerical simulation (using parameters from a specific QKD experiment as an example) results show that our scheme is able to extend the maximal secure distance from 142km (using only one-way classical communications with decoy states) to 181km. The second scheme is able to achieve a 10% greater key generation rate in the whole regime of distances.

quant-ph↗

On the performance of two protocols: SARG04 and BB84

We compare the performance of BB84 and SARG04, the later of which was proposed by V. Scarani et al., in Phys. Rev. Lett. 92, 057901 (2004). Specifically, in this paper, we investigate SARG04 with two-way classical communications and SARG04 with decoy states. In the first part of the paper, we show that SARG04 with two-way communications can tolerate a higher bit error rate (19.4% for a one-photon source and 6.56% for a two-photon source) than SARG04 with one-way communications (10.95% for a one-photon source and 2.71% for a two-photon source). Also, the upper bounds on the bit error rate for SARG04 with two-way communications are computed in a closed form by considering an individual attack based on a general measurement. In the second part of the paper, we propose employing the idea of decoy states in SARG04 to obtain unconditional security even when realistic devices are used. We compare the performance of SARG04 with decoy states and BB84 with decoy states. We find that the optimal mean-photon number for SARG04 is higher than that of BB84 when the bit error rate is small. Also, we observe that SARG04 does not achieve a longer secure distance and a higher key generation rate than BB84, assuming a typical experimental parameter set.

quant-ph↗