Quantum direct communication with mutual authenticationQuantum direct communication with mutual authenticationQuantum direct communication with mutual authentication (original) (raw)
Related papers
Quantum Secure Direct Communication with Mutual Authentication using a Single Basis
International Journal of Theoretical Physics, 2021
In this paper, we propose a new theoretical scheme for quantum secure direct communication (QSDC) with user authentication. Different from the previous QSDC protocols, the present protocol uses only one orthogonal basis of single-qubit states to encode the secret message. Moreover, this is a one-time and one-way communication protocol, which uses qubits prepared in a randomly chosen arbitrary basis, to transmit the secret message. We discuss the security of the proposed protocol against some common attacks and show that no eavesdropper can get any information from the quantum and classical channels. We have also studied the performance of this protocol under realistic device noise. We have executed the protocol in IBMQ Armonk device and proposed a repetition code based protection scheme that requires minimal overhead.
Scientific reports, 2015
In this paper, we generalize a secured direct communication process between N users with partial and full cooperation of quantum server. So, N - 1 disjointed users u1, u2, …, uN-1 can transmit a secret message of classical bits to a remote user uN by utilizing the property of dense coding and Pauli unitary transformations. The authentication process between the quantum server and the users are validated by EPR entangled pair and CNOT gate. Afterwards, the remained EPR will generate shared GHZ states which are used for directly transmitting the secret message. The partial cooperation process indicates that N - 1 users can transmit a secret message directly to a remote user uN through a quantum channel. Furthermore, N - 1 users and a remote user uN can communicate without an established quantum channel among them by a full cooperation process. The security analysis of authentication and communication processes against many types of attacks proved that the attacker cannot gain any info...
On quantum authentication protocols
GLOBECOM '05. IEEE Global Telecommunications Conference, 2005., 2005
When it became known that quantum computers could break the RSA (named for its creators-Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have computational power enough to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. We propose an authentication protocol using quantum superposition states instead of quantum entangled particles. Our protocol can be implemented with the current technologies we introduce in this paper.
Measurement device–independent quantum secure direct communication with user authentication
Quantum Information Processing, 2022
Quantum secure direct communication (QSDC) and deterministic secure quantum communication (DSQC) are two important branches of quantum cryptography, where one can transmit a secret message securely without encrypting it by a prior key. In the practical scenario, an adversary can apply detector-side-channel attacks to get some non-negligible amount of information about the secret message. Measurement-device-independent (MDI) quantum protocols can remove this kind of detector-side-channel attacks, by introducing an untrusted third party (UTP), who performs all the measurements during the protocol with imperfect measurement devices. In this paper, we put forward the first MDI-QSDC protocol with user identity authentication, where both the sender and the receiver first check the authenticity of the other party and then exchange the secret message. Then we extend this to an MDI quantum dialogue (QD) protocol, where both the parties can send their respective secret messages after verifying the identity of the other party. Along with this, we also report the first MDI-DSQC protocol with user identity authentication. Theoretical analyses prove the security of our proposed protocols against common attacks.
Europhysics Letters, 2021
Recently, Yan et al. proposed a quantum secure direct communication (QSDC) protocol with authentication using single photons and Einstein-Podolsky-Rosen (EPR) pairs (Yan L. et al., Comput. Mater. Contin., 63 (2020) 1297). In this work, we show that the above QSDC protocol is secure neither against intercept-and-resend attack, nor against impersonation attack. With any of these two types of attacks, an eavesdropper can recover the full secret message. We also propose a suitable modification of this protocol, which not only defeats the above attacks, but also resists all other common attacks. Thus, our modified protocol provides an improvement over the existing one in terms of security.
Quantum Information Processing, 2013
This work proposes a new direction in quantum cryptography called quantum authencryption. Quantum authencryption (QA), a new term to distinguish from authenticated quantum secure direct communications, is used to describe the technique of combining quantum encryption and quantum authentication into one process for off-line communicants. QA provides a new way of quantum communications without the presence of a receiver on line, and thus makes many applications depending on secure one-way quantum communications, such as quantum E-mail systems, possible. An example protocol using single photons and one-way hash functions is presented to realize the requirements on QA.
Man-in-the-middle attack on quantum secure communications with authentication
Quantum Information Processing, 2013
This study points out a man-in-the-middle (MIM) attack on many of quantum secure communication with authentication protocols. The MIM attack is due to a design carelessness on performing public discussions on a nonauthenticated classical channel. A possible solution is proposed to solve the problem.
A highly efficient and secure shared key for direct communications based on quantum channel
2015 Wireless Telecommunications Symposium (WTS), 2015
the reported research in literature for message transformation by a third party does not provide the necessary efficiency and security against different attacks. The data transmitted through the computer network must be confidential and authenticated in advance. In this paper, we develop and improve security of the braided single stage quantum cryptography. This improvement is based on a novel authentication algorithm by using signature verification without using the three stages protocol to share the secret key between the sender and receiver. This approach will work against attacks such as replay and man-in-the-middle by increasing the security as well as the over efficiency, reducing the overhead through using three stages and increasing the speed of the communication between two parties.
Improving Classical Authentication with Quantum Communication
Eprint Arxiv 0806 1231, 2008
We propose a quantum-enhanced protocol to authenticate classical messages, with improved security with respect to the classical scheme introduced by Brassard in 1983. In that protocol, the shared key is the seed of a pseudo-random generator (PRG) and a hash function is used to create the authentication tag of a public message. We show that a quantum encoding of secret bits offers more security than the classical XOR function introduced by Brassard. Furthermore, we establish the relationship between the bias of a PRG and the amount of information about the key that the attacker can retrieve from a block of authenticated messages. Finally, we prove that quantum resources can improve both the secrecy of the key generated by the PRG and the secrecy of the tag obtained with a hidden hash function.