Improved Key Rate of the Semi-Quantum Key Distribution Protocol

Zhenye Du, Youlong Yang, Kaitian Gao

Walter O. Krawec

Semi-quantum key distribution (SQKD) protocols allow for the establishment of a secret key between two users Alice and Bob, when one of the two users (typically Bob) is limited or "classical" in nature. Recently it was shown that protocols exists when both parties are limited/classical in nature if they utilize the services of a quantum server. These protocols are called mediated SQKD protocols. This server, however, is untrusted and, in fact, adversarial. In this paper, we reconsider a mediated SQKD protocol and derive a new proof of unconditional security for it. In particular, we derive a new lower bound on its key rate in the asymptotic scenario. Furthermore, we show this new lower bound is an improvement over prior work, thus showing that the protocol in question can tolerate higher rates of error than previously thought.

Michel Boyer, Matty Katz, Rotem Liss +1 more

Walter O. Krawec

Semi-quantum key distribution (SQKD) protocols allow for the establishment of a secret key between two users Alice and Bob, when one of the two users (typically Bob) is limited or “classical” in nature. Recently it was shown that protocols exists when both parties are limited/classical in nature if they utilize the services of a quantum server. These protocols are called mediated SQKD protocols. This server, however, is untrusted and, in fact, adversarial. In this paper, we reconsider a mediated SQKD protocol and derive a new proof of unconditional security for it. In particular, we derive a new lower bound on its key rate in the asymptotic scenario. Furthermore, we show this new lower bound is an improvement over prior work, thus showing that the protocol in question can tolerate higher rates of error than previously thought.

Zhenye Du, Youlong Yang, Tong Ning +1 more

Abstract In recent years, mediated semi‐quantum key distribution (MSQKD) has become a hot topic in quantum cryptography. In this study, the original MSQKD protocol is revisited and a new scheme for proving security based on information theory is developed. At first, a new bound on the key rate of the protocol is derived using an entropic uncertainty relation, thus proving the unconditional security of the protocol. In addition, in the asymptotic scenario, a higher noise tolerance that improves the previous results is found. The legitimate communicating parties have to abort the protocol when they observe the error rate is larger than the noise tolerance. Furthermore, the security of a single‐state MSQKD protocol and a single‐state semi‐quantum key distribution (SQKD) protocol is proven using a similar scheme.

Sheila Cobourne