We propose a Quantum Authentication and Key distribution protocol based on one-time n using one-way Hash function. The designated users can authenticate each other and the arbitrator using their one-time ID and distribute a quantum secret key using remained GHZ states after authentication procedure. Though the help of the arbitrator is needed in the process of authentication and key distribution, our protocol prevents the arbitrator from finding out the shared secret key even if the arbitrator becomes an active attacker. Unconditional security can be proved in our protocol as the other QKD protocols.
We propose a Quantum Authentication and Key distribution protocol based on one-time n using one-way Hash function. The designated users can authenticate each other and the arbitrator using their one-time ID and distribute a quantum secret key using remained GHZ states after authentication procedure. Though the help of the arbitrator is needed in the process of authentication and key distribution, our protocol prevents the arbitrator from finding out the shared secret key even if the arbitrator becomes an active attacker. Unconditional security can be proved in our protocol as the other QKD protocols.
Based on the entanglement feature of Greenberger-Horne-Zeilinger states, a multi-user quantum key distribution with mutual authentication is proposed. In the protocol, a semi-trusted third party, who may misbehave on its own but will conspire with none of the participants, is introduced to help arbitrary two users on a quantum network to achieve this secure task. Firstly, the third party prepares a three-particle entangled state. Then, he keeps one particle in his hand, and sends two particles to these two users respectively. Meanwhile, a keyed one-way hash function is utilized to generate an authentication message, in terms of which three parties respectively make an appropriate single-particle measurement on the particles in their hands. According to the measurement results, the third party can verify the identity of one user. It implies that one user is able to authenticate the other user with the assistance of the third party. After that, two participants use the remainder measurement results to generate a common session key. Moreover, the practical implementation of the presented protocol is discussed, which illustrates that this protocol is feasible under the current techniques. In the end, the security of the presented protocol is analyzed. It is shown that this protocol is secure in theory by proving that the presented protocol can stand against several common attacks.
Quantum Key Distribution (QKD) is a secret key agreement technique that consists of two parts: quantum transmission and measurement on a quantum channel, and classical post-processing on a public communication channel. It enjoys provable unconditional security provided that the public communication channel is immutable. Otherwise, QKD is vulnerable to a man-in-the-middle attack. Immutable public communication channels, however, do not exist in practice. So we need to use authentication that implements the properties of an immutable channel as well as possible. One scheme that serves this purpose well is the Wegman-Carter authentication (WCA), which is built upon Almost Strongly Universal2 (ASU2) hashing. This scheme uses a new key in each authentication attempt to select a hash function from an ASU2 family, which is then used to generate the authentication tag for a message. The main focus of this dissertation is on authentication in the context of QKD. We study ASU2 hash functions, security of QKD that employs a computationally secure authentication, and also security of authentication with a partially known key. Specifically, we study the following. First, Universal hash functions and their constructions are reviewed, and as well as a new construction of ASU2 hash functions is presented. Second, security of QKD that employs a specific computationally secure authentication is studied. We present detailed attacks on various practical implementations of QKD that employs this authentication. We also provide countermeasures and prove necessary and sufficient conditions for upgrading the security of the authentication to the level of unconditional security. Third, Universal hash function based multiple authentication is studied. This uses a fixed ASU2 hash function followed by one-time pad encryption, to keep the hash function secret. We show that the one-time pad is necessary in every round for the authentication to be unconditionally secure. Lastly, we study security of the WCA scheme, in the case of a partially known authentication key. Here we prove tight information-theoretic security bounds and also analyse security using witness indistinguishability as used in the Universal Composability framework.
Quantum key distribution (QKD) is a method using some properties of quantum mechanics to create a secret shared cryptographic key even if an eavesdropper has access to unlimited computational power. All QKD protocols require that the parties have access to an authentic channel. Otherwise, QKD is vulnerable to man-in-themiddle attacks. This paper studies QKD from this point of view, emphasizing the necessity and sufficiency of using unconditionally secure authentication in QKD. In this work, a hybrid unconditionally secure authentication strategy is proposed for QKD protocols. It is based on a mixture of normal application of authentication codes and the so-called "counter-based" authentication method such that to achieve a better trade off between security and efficiency (in terms of the required size of initially shared secret data). Based on this strategy, a complete authenticated QKD protocol is described for a specific implementation of the well-known BB84 protocol. Some advantages of our protocol in comparison to other proposals are also highlighted.
A deniable authentication protocol enables a receiver to identify the true source of given message, but not to prove the identity of the sender to a third party.This property is very useful for providing secure negotiation over the Internet.Recently, Shi et al. proposed a quantum deniable authentication protocol based on the property of unitary transformation and quantum one-way function.A trusted center (TC) is introduced in their protocol, and a much amount of quantum resources, such as entanglement, quantum memory and quantum one-way function, are required.In this paper, a deniable authentication protocol without a trust center is proposed based on the quantum key distribution (QKD).In the presented protocol, the QKD is used firstly to share a secret key between the sender and the receiver.Then, the shared key is used to identify the true source of sender's message by the receiver.Finally, the simulation based proof shows that the receiver cannot prove the identity of the sender to any third party.
Quantum key distribution (QKD) is a method using some properties of quantum mechanics to create a secret shared cryptographic key even if an eavesdropper has access to unlimited computational power. All QKD protocols require that the parties have access to an authentic channel. Otherwise, QKD is vulnerable to man-in-the-middle attacks. This paper studies QKD from this point of view, emphasizing the necessity and sufficiency of using unconditionally secure authentication in QKD. In this work, a new technique of using unconditionally secure authentication is proposed for quantum cryptosystems. This technique is based on a hybrid of normal application of authentication codes and the so-called “counter-based” authentication method such that to achieve a better trade-off between security and efficiency (in terms of the required size of initially shared secret data). Based on this strategy, an authenticated version of a typical QKD protocol (the well-known BB84 protocol) is described. Some advantages of our protocol in comparison to other proposals are also highlighted.
Quantum key distribution protocols allow two honest distant parties to establish a common truly random secret key in the presence of powerful adversaries, provided that the two users share a short secret key beforehand. This pre-shared secret key is used mainly for authentication purposes in the post-processing of classical data that have been obtained during the quantum communication stage, and it prevents a man-in-the-middle attack. The necessity of a pre-shared key is usually considered to be the main drawback of quantum key distribution protocols, and it becomes even stronger for large networks involving more than two users. Here, we discuss the conditions under which physical unclonable functions can be integrated in currently available quantum key distribution systems in order to facilitate the generation and the distribution of the necessary pre-shared key with the smallest possible cost in the security of the systems. Moreover, the integration of physical unclonable functions in quantum key distribution networks allows for real-time authentication of the devices that are connected to the network.