Year: 2003
Type: preprint
Abstract: This paper presents a simple, but efficient class of non-interactive protocols for quantum authentication of $m$-length clas sical messages. The message is encoded using a classical linear algebraic code $C[n,m,t]$. We assume that Alice and Bob share a classical secret key, $x_{AB}$, of $n$ bits. Alice creates $n$ qubits based on the code word and the key, that indicates the bases used to create each qubit. The quantum states are sent to Bob through a noiseless quantum channel. We calculate the failure probability of the protocol considering several types of attacks.
Source: arXiv (Cornell University)
Authors: Medeiros, Rex A. C., de Assis, Francisco M., Júior, Bernardo L., Lima, Aércio F.
Institution: Universidade Federal de Campina Grande
Language: English
Subfield: Atomic and Molecular Physics, and Optics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1677500377
