In this paper, we aim at presenting a detailed classification of the most known authentication protocols using quantum means with calculation of quantum communication complexity. The Quantum Key Distribution protocols were basically proposed to establish secret keys that will be used later for encrypting and decrypting messages. Practically, QKD protocols are vulnerable against the men-in-middle attack. Thereby, in order to prevent masquerading any legitimate user and tampering with the communication, QKD schemes need authentication prior to communication. Many quantum authentication protocols have been proposed in the literature. Each one has a particular approach to authenticate the communicators. We attempt in the present work to introduce the various ways of quantum authentication and to classify them according to some specific criteria with a calculation of the quantum communication complexity.
In this paper, we aim at presenting a detailed classification of the most known authentication protocols using quantum means with calculation of quantum communication complexity. The Quantum Key Distribution protocols were basically proposed to establish secret keys that will be used later for encrypting and decrypting messages. Practically, QKD protocols are vulnerable against the men-in-middle attack. Thereby, in order to prevent masquerading any legitimate user and tampering with the communication, QKD schemes need authentication prior to communication. Many quantum authentication protocols have been proposed in the literature. Each one has a particular approach to authenticate the communicators. We attempt in the present work to introduce the various ways of quantum authentication and to classify them according to some specific criteria with a calculation of the quantum communication complexity.
All Classical cryptographic methods used in our life based on mathematical ideas & computational assumption are actually unsafe, so quantum cryptography is proposed nowadays Quantum key distribution (QKD) promises secure key agreement by using quantum mechanical systems. QKD will be an important part of future cryptographic infrastructures. It can provide long-term confidentiality for encrypted information without reliance on computational assumptions. Although QKD still requires authentication to prevent man-in-the-middle attacks. Firstly, In this paper At quantum key distribution protocol process is introduced. Secondly, several improvements to the basic steps of two references are reviewed because of its defects, mainly about identity authentication in order to prevent communication partners' counterfeit, including errors removing, estimating Attacker's information, secrecy enhancement, etc. At last, based upon original improvements reserved selectively, the whole process of quantum key distribution protocol after improvement & then comparison is introduced in detail.
In this review, we survey the cryptographic task of authentication from the perspective of quantum communication. We review three main flavours of authentication that are often conflated in the literature: authentication of classical messages, authentication of quantum messages, and entity authentication, also covering recent hardware-assisted approaches. We compare representative protocols for each functionality in terms of their security assumptions, set-up requirements, composability, and scalability in large or dynamic networks, and use these criteria to identify and recommend suitable candidates. Finally, applications are surveyed: we provide a detailed case study of authentication and quantum key distribution (QKD), then extend the discussion to protocols beyond QKD, where the role of authentication is more complex. Our take-home message is that an authentication requirement is not an intrinsic limitation of quantum networks: as with all secure communication, each protocol relies on a particular authentication resource, and the security claim of that protocol is meaningful only once the authentication resource and its deployment assumptions are made explicit. At the same time, the existing classical and quantum literature already offers a range of quantum-secure authentication schemes, which can support different applications when carefully matched to the required functionality, assumptions, and security guarantees.
The security of the previous quantum key distribution (QKD) protocols, which is guaranteed by the nature of physics law, is based on the legitimate users. However, impersonation of the legitimate communicators by eavesdroppers, in practice, will be inevitable. In fact, the previous QKD protocols is unsecure without authentication in practical communication. In this paper, we proposed an improved QKD protocol that can simultaneously distribute the quantum secret key and verify the communicators' identity. This presented authentication scheme is provably secure.
In order to perform Quantum Cryptography procedures it is often essencial to ensure that the parties of the communication are authentic. Such task is accomplished by quantum authentication protocols which are distributed algorithms based on the intrinsic properties of Quantum Mechanics. The choice of an authentication protocol must consider that quantum states are very delicate and that the channel is subject to eavesdropping. However, even in face of the various existing definitions of quantum authentication protocols in the literature, little is known about them in this perspective, and this lack of knowledge may unfavor comparisons and wise choices. In the attempt to overcome this limitation, in the present work we aim at showing an approach to evaluate quantum authentication protocols based on the determination of their quantum communication complexity. Based on our investigation, no similar methods to analyze quantum authentication protocols were found in the literature. Pursuing this further, our approach has advantages that need to be highlighted: it characterizes a systematic procedure to evaluate quantum authentication protocols; its evaluation is intuitive, based only on the protocol execution; the resulting measure is a concise notation of what resources a quantum authentication protocol demands and how many communications are performed; it allows comparisons between protocols; it makes possible to analyze the communication effort when an eavesdropping occurs; and, lastly, it is likely to be applied in almost any quantum authentication protocol. To illustrate the proposed approach, we also bring results about its application in ten existing quantum authentication protocols (data origin authentication and identity authentication). Such evaluations increase the knowledge about the existing protocols, presenting its advantages, limitations and contrasts.
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.
A novel approach to secure data transmission, quantum communication draws on fundamental principles of quantum physics. It ensures that the transmitted information is private and accurate. To provide security, quantum networks implement physical constraints such as the no-cloning rule and quantum entanglement. In contrast, computational complexity is employed by classical networks. However, with the proliferation of multiuser quantum networks, identity verification has become more challenging. People with malicious intentions might easily disrupt services in long-distance quantum networks by impersonating legitimate nodes and sharing entangled resources and quantum channels. This highlights the absolute necessity of secure authentication systems tailored to quantum environments. Enhancements to recent quantum authentication systems have been made utilizing techniques that are resistant to quantum computing. Researchers are looking into quantum digital signatures, entanglement-assisted protocols, and quantum key distribution (QKD) authentication to make multi-party communications more secure. In order to prevent attacks where a user establishes a fraudulent identity or account, these strategies can be applied to quantum networks. This study takes a look at current quantum authentication systems and gives them the once-over, focusing on how well they could handle multiple users. The article delves into the evolution of authentication systems to accommodate the distributed model, where nodes can function as senders, receivers, or relays. We aim to strike a compromise between practicality and security in our lightweight, low-latency protocols. Additionally, the paper discusses quantum-specific issues, such as side-channel attacks and device malfunctions, and how authentication techniques can help prevent them. Finally, this study demonstrates that authentication is the critical component of secure quantum communication for multiple users. The most secure quantum key distribution methods are still vulnerable to attacks from inside or outside the system if proper authentication is not in place.