Quantum Key Distribution is a quantum communication technique in which random numbers are encoded on quantum systems, usually photons, and sent from one party, Alice, to another, Bob. Using the data sent via the quantum signals, supplemented by classical communication, it is possible for Alice and Bob to share an unconditionally secure secret key. This is not possible if only classical signals are sent. While this last statement is a long standing result from quantum information theory it turns out only to be true in a non-relativistic setting. If relativistic quantum field theory is considered we show it is possible to distribute an unconditionally secure secret key without sending a quantum signal, instead harnessing the intrinsic entanglement between different regions of space–time. The protocol is practical in free space given horizon technology and might be testable in principle in the near term using microwave technology.
Quantum Key Distribution is a quantum communication technique in which random numbers are encoded on quantum systems, usually photons, and sent from one party, Alice, to another, Bob. Using the data sent via the quantum signals, supplemented by classical communication, it is possible for Alice and Bob to share an unconditionally secure secret key. This is not possible if only classical signals are sent. While this last statement is a long standing result from quantum information theory it turns out only to be true in a non-relativistic setting. If relativistic quantum field theory is considered we show it is possible to distribute an unconditionally secure secret key without sending a quantum signal, instead harnessing the intrinsic entanglement between different regions of space–time. The protocol is practical in free space given horizon technology and might be testable in principle in the near term using microwave technology.
Quantum cryptography provides secret communication, which offers various security factors like confidentiality, integrity, and authentication assurance based on the law of physics. The law of physics states that quantum computing can also be applied into the communication sector, which is particularly in the field of cryptography. Then quantum can significantly distribute the data securely by applying quantum key distribution (QKD), quantum key sharing, etc. In the classical cryptography, it is difficult to compute secret keys using security concepts like key exchange and authentication, etc., and it fails to provide adequate protection during data communication as it needs some effective computation in terms of security. The lack of security in the data communication can be overcome by using the concept of quantum computing. Generally, in quantum computing, elementary quantum systems like polarized photons are used to transmit digital information based on the principle of uncertainty as it gives rise to a significant phenomenon of effective security in terms of communication compared to existing concepts related to cryptography. In quantum computing, the detection ratio for identifying the data which are sent through a communication channel is more difficult as it uses qubits and photons to represent the data that are sent. Quantum channels are used to distribute the information between two users as it passes through the unprotected classical channels as it is unknown to anyone else. Assuming that Alice and Bob use a latent noise channel to send a key, reconciliation is the process of correcting errors between Alice and Bob’s version of the key. This is done by public discussion, which leaks some information about the secret key to an undercover. This chapter gives a discussion on QKD concepts as it helps to provide a secure communication, where the information is broadcasting through a quantum channel. Finally, the various existing quantum protocols are described in relation to some security measures based on QKD, and the standard QKD protocol of BB84 is discussed.
Quantum key distribution, which allows two distant parties to share an unconditionally secure cryptographic key, promises to play an important role in the future of communication. For this reason such technique has attracted many theoretical and experimental efforts, thus becoming one of the most prominent quantum technologies of the last decades. The security of the key relies on quantum mechanics and therefore requires the users to be capable of performing quantum operations, such as state preparation or measurements in multiple bases. A natural question is whether and to what extent these requirements can be relaxed and the quantum capabilities of the users reduced. Here we demonstrate a novel quantum key distribution scheme, where users are fully classical. In our protocol, the quantum operations are performed by an untrusted third party acting as a server, which gives the users access to a superimposed single photon, and the key exchange is achieved via interaction-free measurements on the shared state. We also provide a full security proof of the protocol by computing the secret key rate in the realistic scenario of finite-resources, as well as practical experimental conditions of imperfect photon source and detectors. Our approach deepens the understanding of the fundamental principles underlying quantum key distribution and, at the same time, opens up new interesting possibilities for quantum cryptography networks
Quantum key distribution (QKD) is considered as an ideal method to make secret message unreadable to eaves-dropper but intelligible to the two authorized parties of the communication [1][2][3][4][5][6].In the research of experimental quantum key distribution, single photons and entangled photon pairs are used as the carriers.In quantum key distribution, secret keys are generated first between the communication parties.The security of quantum key distribution is guaranteed by the laws of quantum mechanics.After the quantum key distribution is completed, the communication parties should share secret keys, then the sender encrypts the secret message using the secret keys to form the ciphertext and transmits the ciphertext through a classical channel.The receiver receives the ciphertext and then decrypt the ciphertext to get the secret message.Altogether there are four steps in a secret communication process with QKD: key generation, encryption, transmission and decryption.Here in this review, we review some new development in quantum communication, quantum direct communication (QDC).Quantum direct communication is a form of quantum communication where secret messages can be transmitted through a quantum channel with or without additional classical communications.There are two forms of quantum direct communication, quantum secure direct communication (QSDC) [7{9] and deterministic secure quantum communication (DSQC) [10,11].In QSDC, secret messages are transmitted directly between the communication parties, from sender Alice to receiver Bob, without additional classical communication except those for the necessary eavesdropping check.In other words, the quantum key distribution process and the classical communication of ciphertext are condensed into one single quantum communication procedure in QSDC.Deterministic secure quantum communication is another type of quantum direct communication, such as those proposed in Ref. [10,11], where classical communication is required in order to read out the secret message.As mentioned earlier, to complete a secure communication with the help of QKD, one usually encodes the secret message with an encryption scheme, and the ciphered text is transmitted through a classical channel.With a quantum channel, this procedure can be varied.
Quantum cryptography, or, more precisely, quantum key distribution (QKD) allows two distant parties, Alice and Bob, to expand a previously shared secret key by sending quantum states through a quantum channel. The goal here is for Alice and Bob to communicate securely in the presence of an eavesdropper, Eve. The most well-known QKD protocol is the Bennett-Brassard 1984 (BB84) protocol, which has been proved unconditionally secure against any attacks allowed by quantum mechanics. The main advantage of QKD over conventional cryptography is its absolute security. Thus, it is imperative to evaluate the security and performance of QKD protocols and realistic QKD systems. In this thesis, we study the security and performance aspects of QKD in four parts. In the first part, we study the Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocol. This protocol differs from the BB84 protocol only in the classical post-processing step and uses the same four quantum states as the BB84 protocol. We compared these two protocols and showed that in typical situations, the classical post-processing software for BB84 should be used in order to have a higher performance. In the second part, we prove the security of a three-state protocol. This protocol is similar to the BB84 protocol in that they share the same three qubit states. In the third part, we consider a practical Trojan horse attack on practical QKD systems implementing the BB84 protocol. The attack works by taking advantage of the finite response time of practical phase modulators to remap the states sent out by the legitimate user, Alice. We showed that if Alice and Bob are unaware of our attack, the final key shared between them can be compromised in some situations. In the fourth part, we consider another type of Trojan horse attack, which is based on mismatch between detection efficiencies of detectors. Practical detectors in QKD systems usually do not have identical efficiencies and an eavesdropper Eve may be able to exploit this efficiency mismatch to steal information about the final secret key. We analyze the security of the attack and show that it is possible for Eve to acquire some information on the final secret key if Alice and Bob are unaware of this attack.
The counter-intuitive features of quantum mechanics make it possible to solve problems and perform tasks that are beyond the abilities of non-quantum (classical) computers and communication devices. The field of quantum information processing studies how we can achieve such improvements by representing information as quantum states.One of the early achievements of quantum information processing is the development of quantum key distribution (QKD). QKD protocols allow two participants (Alice and Bob) to achieve the classically-impossible task of generating a secret shared key even if their adversary is computationally unlimited.Unfortunately, the security promises of QKD are true only in theory; practical implementations of QKD deviate from the theoretical protocols, and many of these deviations give rise to practical attacks. In this research thesis, we study the security properties of various QKD protocols in many practical settings:First, we study practical security of semiquantum key distribution (SQKD) protocols, where either Alice or Bob is non-quantum (classical). Following practical security problems in previous SQKD protocols, we suggest a new SQKD protocol (the "Mirror protocol") which can be securely implemented, and we prove it robust and secure against a wide range of attacks (the "uniform collective attacks").Then, we study "composable security" of the first QKD protocol created by Bennett and Brassard (BB84). BB84 has its unconditional security proved against adversaries performing the most general attacks in a theoretical (idealized) setting; however, some security approaches do not prove "composable security", which requires the secret key to remain secret even when Alice and Bob actually use it for cryptographic purposes. We generalize an algebraic security approach for BB84, making it prove composable security of BB84 (and many variants of BB84) against the most general attacks.Finally, we analyze an important practical attack (named "Bright Illumination"), showing how it can be modeled as a theoretical "Reversed-Space" attack.Overall, all results aim to enhance our understanding on how to bridge the gap between theory and practice in various sub-fields of QKD, and they may help solve a major open problem in the field of QKD: constructing a realistic QKD implementation that can be proved truly and unconditionally secure against any possible attack.