We prove that the teleportation based quantum cryptography protocol presented in [Opt. Commun. 283, 184 (2010)], which is built using only orthogonal states encoding the classical bits that are teleported from Alice to Bob, is asymptotically secure against all types of individual and collective attacks. We then investigate modifications to that protocol leading to greater secret-key rates and to security against coherent attacks. In other words, we show an unconditional secure quantum key distribution protocol that does not need non-orthogonal quantum states to encode the bits of the secret key sent from \nAlice to Bob. We also revisit the security proof of the BB84 protocol by exploring the non-uniqueness of the Schmidt decomposition of its entanglement-based representation. This allows us to arrive at a secure transmission of the key for a slightly greater quantum bit error rate (quantum communication channel’s noise) when compared to its standard security analysis. After that, we investigate how different types of the noise usually present in realistic implementations of the BB84 protocolo affect its operation.
We prove that the teleportation based quantum cryptography protocol presented in [Opt. Commun. 283, 184 (2010)], which is built using only orthogonal states encoding the classical bits that are teleported from Alice to Bob, is asymptotically secure against all types of individual and collective attacks. We then investigate modifications to that protocol leading to greater secret-key rates and to security against coherent attacks. In other words, we show an unconditional secure quantum key distribution protocol that does not need non-orthogonal quantum states to encode the bits of the secret key sent from \nAlice to Bob. We also revisit the security proof of the BB84 protocol by exploring the non-uniqueness of the Schmidt decomposition of its entanglement-based representation. This allows us to arrive at a secure transmission of the key for a slightly greater quantum bit error rate (quantum communication channel’s noise) when compared to its standard security analysis. After that, we investigate how different types of the noise usually present in realistic implementations of the BB84 protocolo affect its operation.
Quantum cryptography is a well-stated field within quantum applications where quantum information is used to set secure communications, authentication, and secret keys. Now used in quantum devices with those purposes, particularly Quantum Key Distribution (QKD), which proposes a secret key between two parties free of effective eavesdropping, at least at a higher level than classical cryptography. The best-known quantum protocol to securely share a secret key is the BB84 one. Other protocols have been proposed as adaptations of it. Most of them are based on the quantum indeterminacy for non-orthogonal quantum states. Their security is commonly based on the large length of the key. In the current work, a BB84-like procedure for QKD based on double quantum teleportation allows the sharing of the key statement using several parties. Thus, the quantum bits of information are assembled among three parties via entanglement, instead of travelling through a unique quantum channel as in the traditional protocol. Asymmetry in the double teleportation plus post-measurement retains the secrecy in the process. Despite requiring more complex control and resources, the procedure dramatically reduces the probability of success for an eavesdropper under individual attacks, because of the ignorance of the processing times in the procedure. Quantum Bit Error Rate remains in the acceptable threshold and it becomes configurable. The article depicts the double quantum teleportation procedure, the associated control to introduce the QKD scheme, the analysis of individual attacks performed by an eavesdropper, and a brief comparison with other protocols.
Quantum key distribution is the best known application of quantum cryptography. Previously proposed proofs of security of quantum key distribution contain various technical subtleties. Here, a conceptually simpler proof of security of quantum key distribution is presented. The new insight is the invariance of the error rate of a teleportation channel: we show that the error rate of a teleportation channel is independent of the signals being transmitted. This is because the non-trivial error patterns are permuted under teleportation. This new insight is combined with the recently proposed quantum-to-classical reduction theorem. Our result shows that assuming that Alice and Bob have fault-tolerant quantum computers, quantum key distribution can be made unconditionally secure over arbitrarily long distances even against the most general type of eavesdropping attacks and in the presence of all types of noises.
In this Thesis we study in details one of the most astonishing application of quantum mechanics which totally departs from our common sense: quantum teleportation in continuous variables. We present a review of the postulates of quantum mechanics and quantum optics systems, in particular for Gaussian systems. After this review we apply these postulates in order to present one of the most counter intuitive applications of quantum mechanics, namely, the quantum teleportation protocol. We study in detail this protocol and we propose modifications in its construction aiming at an improvement in its efficiency. These modifications were made in order to take into account the realistic situations encountered in the implementation of the protocol, i.e., the fact that the entanglement, between Alice and Bob, is never perfect and the fact that states teleported by Alice are near the vacuum state. After this analysis we performed an extension of the teleportation protocol by proposing a multi-channel protocol and studied the case of two channels in parallel. Finally, we created the first quantum cryptography protocol that uses the continuous variables teleportation protocol in an active way. We showed that this protocol is robust to the beam splitter attack and that this protocol is the only one working with direct reconciliation and without post-selection over the 50% loss scenario.
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.
Quantum cryptography protocols using entangled qubit pairs can increase the rate and security of information exchange through a quantum channel. Usually those protocols are non-deterministic, i.e. a classical bit is encoded in a quantum state, but the actual bit value cannot be determined. Therefore they request the transmission of additional information through a public channel. By contrast, the ping-pong coding scheme based on entangled photons allows for deterministic and direct key distribution. No qubit has to be discarded and information can be decoded without the need for a subsequent transmission of additional information. Communication through a public channel nevertheless is necessary to ensure asymptotical security against arbitrary eavesdropping attacks.
Quantum information theory has improved communication systems at all levels, such as storage, processing, transmission, security, and responsiveness, but it is the quantum cryptography that has thefastestgrowthintermsofresearchresults.Quantumcryptographyisaphysicalmodelforthegeneration and distribution of cryptographic keys, which takes advantage of the properties of quantum mechanicssuchasoverlappingstates,polarizationofindividualphotons,entanglement,teleportation, anddensecoding,propertiesthatprovidecomputationaladvantagestotransmit,processandencode information at a higher speed and with better security. In addition applications can be developed for factoring numbers in polynomial time and build security systems based on quantum cryptography in order to maintain the confidentiality, integrity and availability of information.
In this context, this paper presents the theoretical concepts of quantum mechanics that allowed simulating a cryptographic method that uses the generation and distribution of quantum keys of the BB84 protocol, as a system secure keys exchange between a transmitter, Alice, and a receiver, Bob, who use the properties of quantum mechanics to distribute the key and not hard-to-solve mathematical problems like those used by cryptography built on a base of classical states. For this cryptographic method, the generation and distribution of the quantum key will be developed in two scenarios, in the first one there will be no entity that tries to intestate the communication between the transmitter and the receiver, in the second scenario there will be an Eve spy in the quantum communication channel that will try to obtain the key that is being transmitted between Alice and Bob.
The generation and distribution of the quantum key using the BB84 protocol with and without a spy will be displayed in a programming and simulation environment developed with the quantum language Qiskit implemented by IBM for its quantum computers, this language is described in the development of the cryptographic method and in Appendix A of this work. The operation of the BB84 protocol is explained step by step and, as from the error rate generated by the intruder in the communication channel, the transmitter and the receiver detect an intrusion into the system. In addition, the simulation of the model shows how to integrate quantum keys with ciphers such as Vernam, and you can obtain perfect security in the encoding and decoding of information