2021/01/10 by Nayana Das, Goutam Paul, Ritajit Majumdar
Computer Science · Mathematics · Physics and Astronomy · #Alice (programming language) #Alice and Bob #Authentication (law) #Authentication protocol #Basis (linear algebra) #Code (set theory) #Communication source #Computer network #Computer science #Computer security #Cryptographic protocol #Cryptography #ENCODE #Mathematics #Message authentication code #Overhead (engineering) #Physics #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #Qubit #Scheme (mathematics) #Set (abstract data type) #Theoretical computer science #Universal composability #cs.CR #quant-ph
paper · pdf · doi:10.1007/s10773-021-04952-4
published as International Journal of Theoretical Physics (2021)
openalex publication_date 2021/01/10 · arxiv created 2021/01/14 · openalex created_date 2021/11/22 · arxiv updated 2022/02/23 · openalex updated_date 2026/08/05
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 eaves-dropper 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.