Abstract : Much of the work on quantum networks, both entangled and unentangled, has been about the uses of quantum networks to enhance end host security. The most famous such application, of course, is quantum key distribution (QKD), detecting eavesdroppers and creating shared, secret random numbers for use as encryption keys (Bennett and Brassard, 1984). Typically the study of these applications involves information theoretic analysis of the amount of information that an attacker can glean from the use of the network. In this project, we addressed security and quantum networks from an entirely different angle: we investigated the security of the networks themselves. We wanted to know if a single mis-behaving node, or a small number of them, can disrupt operation of the network. Our work produced a first-of-its-kind taxonomy of potential attacks on quantum repeater network operations.
Abstract : Much of the work on quantum networks, both entangled and unentangled, has been about the uses of quantum networks to enhance end host security. The most famous such application, of course, is quantum key distribution (QKD), detecting eavesdroppers and creating shared, secret random numbers for use as encryption keys (Bennett and Brassard, 1984). Typically the study of these applications involves information theoretic analysis of the amount of information that an attacker can glean from the use of the network. In this project, we addressed security and quantum networks from an entirely different angle: we investigated the security of the networks themselves. We wanted to know if a single mis-behaving node, or a small number of them, can disrupt operation of the network. Our work produced a first-of-its-kind taxonomy of potential attacks on quantum repeater network operations.
The main purpose of a quantum key distribution network is to provide secret keys to any users or applications requiring a high level of security, ideally such as to offer the best protection against any computational attack, even of a quantum nature. The keys shared through a point-to-point link between a source and a detector using a quantum key distribution protocol can be proven information-theoretically secure based on the quantum information theory. However, evaluating the security of a quantum key distribution network, especially if it is based on relay nodes, goes far beyond the quantum security of its single quantum links, involving aspects of conventional security for devices and their communication channels. In this contribution, we perform a rigorous threat analysis based on the most recent recommendations and practical network deployment security issues. We show that, at least in the current state of our understanding of quantum cryptography, quantum key distribution networks can only offer computational security and that their supposed resilience to quantum cryptanalysis requires resorting to post-quantum cryptography.
In our modern era of telecommunications and the Internet, information has become a valuable commodity. Sometimes it must therefore be protected against theft - in this case, loss of secret information to an eavesdropper. Most of today's transactions are protected using encryption unproven to be secure against a computational attack by a classical computer and, in fact, the standardly used encryption algorithms are provably vulnerable to the mind-boggling parallelism of a quantum computer, should one ever be physically realized. Enter quantum cryptography. Underlying nearly all forms of encryption is the necessity for a truly secret key, a random string of zeros and ones; the basic notion of quantum cryptography is to employ single photon transmissions (or the closest attainable approximation to these) to distribute the random key material, while removing the threat of an undetected eavesdropper. Now, nearly twenty years since the seminal quantum cryptography paper by Bennett and Brassard (Bennett C H and Brassard G 1984 Proc. IEEE Int. Conf. on Computers, Systems, and Signal Processing (Bangalore) (New York: IEEE) pp 175-9), we take a look at several state-of-the-art implementations, and glimpse how future quantum cryptosystems might look. We start with papers from three of the world's leading experimental quantum cryptography efforts: Stucki et al and Bethune and Risk describe working systems for quantum key distribution (QKD) over telecommunications fibres (at 1550 nanometres and 1300 nanometres, respectively). The former's achievement of quantum key exchange over 67 kilometres of optical fibre is a world record, as is the experimental demonstration by Hughes et al of daylight free-space QKD over a 10 km atmospheric range. Next, Lütkenhaus and Jahma explore the possible vulnerabilities of such systems (which employ attenuated laser pulses instead of actual single photon states) to conceivable future eavesdropping technologies. Enzer et al have implemented a totally new protocol, using polarization-entangled photons, which in some circumstances can tolerate higher error rates than the traditional one of Bennett and Brassard; moreover, the use of entanglement provides a means of `automatic source verification'. Finally, looking to the future, Elliott gives a provocative view of how these technologies may be merged into network operation, and Shapiro describes a method to combine a novel source of entangled photons with a means to transfer the photons' quantum state to trapped-atom quantum memories. If realized, these systems could presage the world's first quantum network. Focus on Quantum Cryptography Contents Quantum key distribution over 67 km with a plug&play system D Stucki, N Gisin, O Guinnard, G Ribordy and H Zbinden Autocompensating quantum cryptography Donald S Bethune and William P Risk Practical free-space quantum key distribution over 10 km in daylight and at night Richard J Hughes, Jane E Nordholt, Derek Derkacs and Charles G Peterson Quantum key distribution with realistic states: photon-number statistics in the photon-number splitting attack Norbert Lütkenhaus and Mika Jahma Entangled-photon six-state quantum cryptography Daphna G Enzer, Phillip G Hadley, Richard J Hughes, Charles G Peterson and Paul G Kwiat Building the quantum network Chip Elliott Architectures for long-distance quantum teleportation Jeffrey H Shapiro Ground to satellite secure key exchange using quantum cryptography J G Rarity, P R Tapster, P M Gorman and P Knight Method for decoupling error correction from privacy amplification Hoi-Kwong Lo Paul G Kwiat University of Illinois at Urbana-Champaign, USA
Secure communication and information protection become more and more important in the modern society. Quantum key distribution (QKD) enables two remote legitimate users to share unconditionally secure keys. Different from the former ones, the security of these keys is based on the principles of quantum physics and could be proved. Combined with one-time pad encryption, QKD can provide us an effective way for secure communication and information protection[1, 2]. Since Bennett and Brassard proposed the famous BB84 protocol[3], QKD or quantum cryptography has become one of the most dynamic research fields. After about twenty years of development, experimental QKD has achieved significant improvements, such as the transmission distance increased from 32 cm[4]to 260 km[5], the speed increased from 200 Hz[4]to 10 GHz[6].
Quantum key distribution (QKD) networks are expected to enable information-theoretical secure (ITS) communication over a large-scale network. Most research on relay-based QKD networks assumes all relays or nodes are completely trustworthy. However, this assumption is unreasonable because the malicious behavior of even a single node can undermine the security of the entire network. Currently, there is no method to directly distinguish between honest nodes and malicious nodes. Moreover, the status of nodes as honest or malicious can be dynamic. Therefore, a solution is needed that can withstand a certain proportion of malicious nodes in QKD networks. We propose a novel paradigm, inspired by distributed systems, to address the active and passive attacks by collaborating with malicious nodes in QKD networks. First, regarding security, we propose the ITS distributed authentication scheme, which additionally ensures two crucial security properties to QKD networks: identity unforgeability and non-repudiation. Second, concerning correctness, we propose an ITS fault-tolerant consensus scheme based on our ITS distributed authentication to ensure global consistency. This enables participating nodes to collaborate correctly and complete end-to-end key distribution within a constant number of communication rounds. Through our simulation, we have shown that our scheme exhibits a significantly lower growth trend in key consumption compared to the original end-to-end pre-shared keys scheme. For instance, in larger networks, such as when the number of nodes is 80, our scheme’s key consumption is only 13.1% of the pre-shared keys scheme.
The main service provided by the coming quantum Internet will be creating entanglement between any two quantum nodes. We discuss and classify attacks on quantum repeaters, which will serve roles similar to those of classical Internet routers. We have modeled the components for and structure of quantum repeater network nodes. With this model, we point out attack vectors, then analyze attacks in terms of confidentiality, integrity, and availability. While we are reassured about the promises of quantum networks from the confidentiality point of view, integrity and availability present new vulnerabilities not present in classical networks and require care to handle properly. We observe that the requirements on the classical computing/networking elements affect the systems’ overall security risks. This component-based analysis establishes a framework for further investigation of network-wide vulnerabilities.