Keyless Semi-Quantum Point-to-point Communication Protocol with Low Resource Requirements

TL;DR

This paper introduces two novel semi-quantum communication protocols that are resource-efficient, resistant to certain attacks, and suitable for portable devices, relying on physical principles for security.

Contribution

The paper proposes two new keyless semi-quantum protocols with constant resource requirements, improving efficiency and attack detection over existing methods.

Findings

Protocols achieve constant minimal EPT and quregister size

They can detect Measure and Replay Attacks effectively

REKSQPC tolerates transmission impairments

Abstract

Full quantum capability devices can provide secure communications, but they are challenging to make portable given the current technology. Besides, classical portable devices are unable to construct communication channels resistant to quantum computers. Hence, communication security on portable devices cannot be guaranteed. Semi-Quantum Communication (SQC) attempts to break the quandary by lowering the receiver's required quantum capability so that secure communications can be implemented on a portable device. However, all SQC protocols have low qubit efficiency and complex hardware implementations. The protocols involving quantum entanglement require linear Entanglement Preservation Time (EPT) and linear quregister size. In this paper, we propose two new keyless SQC protocols that address the aforementioned weaknesses. They are named Economic Keyless Semi-Quantum Point-to-point Communication (EKSQPC) and Rate Estimation EKSQPC (REKSQPC). They achieve theoretically constant minimal EPT and quregister size, regardless of message length. We show that the new protocols, with low overhead, can detect Measure and Replay Attacks (MRAs). REKSQDC is tolerant to transmission impairments and environmental perturbations. The protocols are based on a new quantum message transmission operation termed Tele-Fetch. Like QKD, their strength depends on physical principles rather than mathematical complexity.