Abstract In challenge-response authentication, the claimants are required to prove that they are legitimate users while minimizing the exposure of their confidential information. We propose a quantum challenge-response identification protocol using single qubit unitary operators that utilizes the mechanism of challenge-response, unlike most existing protocols that use (one-time) password authentication. We utilized the commutation relations of single qubit unitary operators to design this protocol that ensures the security of confidential information during identification in a quantum computing environment. For security analysis, we estimated the average fidelity of two quantum states after performing operations with the unitary operators based on the random numbers generated by two users. Subsequently, we evaluated the amount of information acquired by an eavesdropper to show that the proposed protocol is robust against impersonation and intercept-measurement attacks. Finally, we described the advantages of the protocol by comparing it with the existing quantum identification protocols.
Abstract In challenge-response authentication, the claimants are required to prove that they are legitimate users while minimizing the exposure of their confidential information. We propose a quantum challenge-response identification protocol using single qubit unitary operators that utilizes the mechanism of challenge-response, unlike most existing protocols that use (one-time) password authentication. We utilized the commutation relations of single qubit unitary operators to design this protocol that ensures the security of confidential information during identification in a quantum computing environment. For security analysis, we estimated the average fidelity of two quantum states after performing operations with the unitary operators based on the random numbers generated by two users. Subsequently, we evaluated the amount of information acquired by an eavesdropper to show that the proposed protocol is robust against impersonation and intercept-measurement attacks. Finally, we described the advantages of the protocol by comparing it with the existing quantum identification protocols.
Oblivious transfer is a powerful cryptographic primitive that is complete for secure multi-party computation. In oblivious transfer protocols a user sends one or more messages to a receiver, while the sender remains oblivious as to which messages have been received. Protocols for oblivious transfer cannot exist in a classical or fully-quantum world, but can be implemented by restricting the users' power. The isolated qubits model is a cryptographic model in which users are restricted to single-qubit operations and are not allowed to use entangling operations. Furthermore, all parties are allowed to store qubits for a long time before measuring them. In this model, a secure single-bit one-out-of-two randomised oblivious transfer protocol was recently presented by Liu. Motivated by this result, we construct a protocol for secure string one-out-of-two randomised oblivious transfer by simplifying and generalising the existing proof. We then study for the first time interactive protocols for more complex two-party functionalities in this model based on the security of our construction. In order to guarantee the composability of our construction, users are restricted to measurement at the end of each sub-protocol. It is then possible to construct secure one-out-of-two and one-out-of-k oblivious transfer protocols in the isolated qubits model. Moreover, we study secure password-based identification, where a user identifies himself to another user by evaluating the equality function on their inputs, or passwords. We use the oblivious transfer constructions mentioned above as sub-protocols to construct a secure identification protocol. Finally, we prove that constructing a secure identification protocol non-interactively is impossible, even using oblivious transfer.
Authentication is one of the significant issues for all kinds of network communications. Most of the authentication protocols designed and implemented so far for entity authentication are based on classical cryptographic techniques to prevent themselves from different types of attacks. These protocols use either password or challenge for authentication. In this article, the design of the proposed quantum secure entity authentication protocol is shown. The proposed protocol is based on the challenge response method. Due to quantum computer capability to break mathematical complexity-based cryptographic techniques, the proposed protocol uses the one-time pad (OTP) to secure itself from attacks, i.e., eavesdropping, reply attack, password guessing attack, man-in-the-middle attack, brute-force attack, quantum computer attack, etc. Security of the proposed protocol was analyzed, and it shows that the proposed protocol may prevent itself from different types of attacks. Further, analysis for quantum Secure was carried out. From the analysis, it is found that if the OTP key is truly random and cannot be reused, then a computer with infinite capacity or quantum computer cannot break the encrypted challenge and response. The proposed protocol may be used for entity authentication for the client, server, process, and user.
Identity authentication plays a critical role in safeguarding communication information. In this study, we propose a semi-quantum mutual identity authentication protocol that leverages single particles as resources, significantly reducing quantum resource usage as well as system complexity and operational difficulty. The protocol operates without third-party involvement, simplifying the structure and enabling mutual authentication between quantum and classical participants through straightforward single-qubit measurement and reordering operations. Additionally, if the authentication process fails, the protocol can immediately identify which participant’s identity is unauthorized, thereby enhancing security. Security analysis demonstrates that the proposed protocol can defend against impersonation attacks, intercept-measure-resend attacks, entangle-measure attacks, and Trojan horse attacks. Compared to existing protocols, our protocol offers advantages in practicality.
Authentication is one of the significant issues for all kinds of network communications. Most of the authentication protocols designed and implemented so far for entity authentication are based on classical cryptographic techniques to prevent themselves from different types of attacks. These protocols use either password or challenge for authentication. In this article, the design of the proposed quantum secure entity authentication protocol is shown. The proposed protocol is based on the challenge response method. Due to quantum computer capability to break mathematical complexity-based cryptographic techniques, the proposed protocol uses the one-time pad (OTP) to secure itself from attacks, i.e., eavesdropping, reply attack, password guessing attack, man-in-the-middle attack, brute-force attack, quantum computer attack, etc. Security of the proposed protocol was analyzed, and it shows that the proposed protocol may prevent itself from different types of attacks. Further, analysis for quantum Secure was carried out. From the analysis, it is found that if the OTP key is truly random and cannot be reused, then a computer with infinite capacity or quantum computer cannot break the encrypted challenge and response. The proposed protocol may be used for entity authentication for the client, server, process, and user.
In quantum secure multi-party summation protocols, some attackers can impersonate legitimate participants in the summation process, and easily steal the summation results from the participants. This is often overlooked for existing secure multi-party summation protocols, thus rendering them insecure. Based on commutative encryption, a quantum secure multi-party summation protocol with identity authentication is proposed in this paper. In the protocol, each participant encodes a secret integer on photons via unitary operations. At the same time, a one-way hash function technique with a key is utilized to perform identity authentication operations for each participant. Finally, the summation is calculated with the help of a semi-trusted third party. The analysis of the protocol shows that the proposed protocol is correct and resistant to common and impersonation attacks. Compared to related protocols, the use and measurement of single photons makes the protocol easier to implement into existing technology. Furthermore, the simulation experiments on the IBM Q Experience cloud platform demonstrate the effectiveness of the presented protocol.
An interesting protocol for quantum identity authentication on a basis of the classic shared secret has been presented recently (Hong et al. in Quantum Inf Process 16(10): 236, 2017 ). It requires few resources and it is technologically feasible. Its seminal analysis focuses on average eavesdropper’s information gain per single protocol run—a parameter suitable for estimation of the security margin applicable to the protocols aiming at provision of confidentiality. However, the security requirements of the authentication process are very stringent—no single bit of the secret can be revealed, otherwise the eavesdropper can collect subsequent bits of the secret in successive protocol runs. The failure of the seminal version to meet this requirement is demonstrated. The sequential processing of qubits and the static nature of the compared data is the rationale behind the improvement. The introduced changes make that partial information gained in some authentication attempt gives the eavesdroppers no advantage in breaking the next ones. They are forced to consider each authentication transaction as a separate puzzle that can be solved according to all-or-nothing paradigm. The improvement retains conceptual simplicity and technological feasibility of the seminal version of the protocol.