Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1907.11340 · IEEE Transactions on Quantum Engineering

High-Dimensional Semiquantum Cryptography

Hasan Iqbal, Walter O. Krawec

Published Jan 1, 2020• 30 citations
arXivHTMLPDF

Abstract

A semiquantum key distribution (SQKD) protocol allows two users, one of whom is restricted in their quantum capabilities to being nearly classical, to establish a shared secret key, secure against an all-powerful adversary. The study of such protocols helps to answer the fundamental question of “how quantum” must a protocol be to gain an advantage over classical communication. In this article, we design a new SQKD protocol using high-dimensional quantum states and conduct an information theoretic security analysis. We show that, similar to the fully quantum key distribution case, high-dimensional systems can increase the noise tolerance in the semiquantum case. Furthermore, we prove several general security results which are applicable to other (S)QKD protocols (both high-dimensional ones and standard qubit-based protocols) utilizing a two-way quantum channel.

DOI
10.1109/tqe.2020.3018133

Related papers

Semiquantum key distribution with high quantum noise tolerance

Omar Amer, Walter O. Krawec

Semiquantum key distribution protocols are designed to allow two parties to establish a shared secret key, secure against an all-powerful adversary, even when one of the users is restricted to measuring and preparing quantum states in one single basis. While interesting from a theoretical standpoint, these protocols have the disadvantage that a two-way quantum communication channel is necessary which generally limits their theoretical efficiency and noise tolerance. In this paper, we construct a semiquantum key distribution (SQKD) protocol which actually takes advantage of this necessary two-way channel, and, after performing an information theoretic security analysis against collective attacks, we show it is able to tolerate a channel noise level higher than any prior SQKD protocol to date. We also compare the noise tolerance of our protocol to other two-way fully quantum protocols, along with BB84 with classical advantage distillation. We also comment on some practical issues involving semiquantum key distribution (in particular, concerning the potential complexity in physical implementation of our protocol as compared with other standard QKD protocols). Finally, we develop techniques that can be applied to the security analysis of other (S)QKD protocols reliant on a two-way quantum communication channel.

arXiv:1812.04144•Physical Review A•Aug 16, 2019•34 citations

Multi-Mediated Semi-Quantum Key Distribution

Walter O. Krawec

A semi-quantum key distribution (SQKD) protocol allows two users A and B to establish a shared secret key that is secure against an all-powerful adversary E even when one of the users (e.g., B) is semi-quantum or classical in nature while the other is fully-quantum. A mediated SQKD protocol allows two semi-quantum users to establish a key with the help of an adversarial quantum server. We introduce the concept of a multi-mediated SQKD protocol where two (or more) adversarial quantum servers are used. We construct a new protocol in this model and show how it can withstand high levels of quantum noise, though at a cost to efficiency. We perform an information theoretic security analysis and, along the way, prove a general security result applicable to arbitrary MM-SQKD protocols. Finally, a comparison is made to previous (S)QKD protocols.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2019•11 citations

Semi-Quantum Key Distribution with Limited Measurement Capabilities

Walter O. Krawec, Eric P. Geiss

A semi-quantum key distribution (SQKD) protocol allows a quantum user and a limited "classical" user to establish a shared secret key secure against an all-powerful adversary. In this work, we present a new SQKD protocol where the quantum user is also limited in her measurement capabilities. We describe the protocol, perform an information theoretic analysis of its security, and show its noise tolerance is as high as "fully quantum" QKD protocols.

International Symposium on Information Theory and its Applications•Oct 1, 2018•6 citations

Limited Resource Semi-Quantum Key Distribution

Walter O. Krawec, Eric P. Geiss

A semi-quantum key distribution (SQKD) protocol allows a quantum user and a limited "classical" user to establish a shared secret key secure against an all-powerful adversary. In this work, we present a new SQKD protocol where the quantum user is also limited in her measurement capabilities. We describe the protocol, prove its security, and show its noise tolerance is as high as "fully quantum" QKD protocols.

arXiv:1710.05076•Oct 13, 2017•5 citations

Security of Quantum Key Distribution Protocols

Rotem Liss

The counter-intuitive features of quantum mechanics make it possible to solve problems and perform tasks that are beyond the abilities of non-quantum (classical) computers and communication devices. The field of quantum information processing studies how we can achieve such improvements by representing information as quantum states.One of the early achievements of quantum information processing is the development of quantum key distribution (QKD). QKD protocols allow two participants (Alice and Bob) to achieve the classically-impossible task of generating a secret shared key even if their adversary is computationally unlimited.Unfortunately, the security promises of QKD are true only in theory; practical implementations of QKD deviate from the theoretical protocols, and many of these deviations give rise to practical attacks. In this research thesis, we study the security properties of various QKD protocols in many practical settings:First, we study practical security of semiquantum key distribution (SQKD) protocols, where either Alice or Bob is non-quantum (classical). Following practical security problems in previous SQKD protocols, we suggest a new SQKD protocol (the "Mirror protocol") which can be securely implemented, and we prove it robust and secure against a wide range of attacks (the "uniform collective attacks").Then, we study "composable security" of the first QKD protocol created by Bennett and Brassard (BB84). BB84 has its unconditional security proved against adversaries performing the most general attacks in a theoretical (idealized) setting; however, some security approaches do not prove "composable security", which requires the secret key to remain secret even when Alice and Bob actually use it for cryptographic purposes. We generalize an algebraic security approach for BB84, making it prove composable security of BB84 (and many variants of BB84) against the most general attacks.Finally, we analyze an important practical attack (named "Bright Illumination"), showing how it can be modeled as a theoretical "Reversed-Space" attack.Overall, all results aim to enhance our understanding on how to bridge the gap between theory and practice in various sub-fields of QKD, and they may help solve a major open problem in the field of QKD: constructing a realistic QKD implementation that can be proved truly and unconditionally secure against any possible attack.

•Aug 31, 2022•0 citations

Mediated semiquantum key distribution

Walter O. Krawec

In this work, we design a quantum key distribution protocol, allowing two limited semiquantum or ``classical'' users to establish a shared secret key with the help of a fully quantum server. A semiquantum user can prepare and measure qubits only in the computational basis and so must rely on this quantum server to produce qubits in alternative bases and also to perform alternative measurements. However, we assume that the server is untrusted and we prove the unconditional security of our protocol even in the worst case: when this quantum server is an all-powerful adversary. We also compute a lower bound of the key rate of our protocol, in the asymptotic scenario, as a function of the observed error rate in the channel, allowing us to compute the maximally tolerated error of our protocol. Our results show that a semiquantum protocol may hold similar security to a fully quantum one.

arXiv:1411.6024•Physical Review A•Mar 25, 2015•178 citations
A semiquantum key distribution (SQKD) protocol allows two users, one of whom is restricted in their quantum capabilities to being nearly classical, to establish a shared secret key, secure against an all-powerful adversary. The study of such protocols helps to answer the fundamental question of “how quantum” must a protocol be to gain an advantage over classical communication. In this article, we design a new SQKD protocol using high-dimensional quantum states and conduct an information theoretic security analysis. We show that, similar to the fully quantum key distribution case, high-dimensional systems can increase the noise tolerance in the semiquantum case. Furthermore, we prove several general security results which are applicable to other (S)QKD protocols (both high-dimensional ones and standard qubit-based protocols) utilizing a two-way quantum channel.
Semiquantum key distribution protocols are designed to allow two parties to establish a shared secret key, secure against an all-powerful adversary, even when one of the users is restricted to measuring and preparing quantum states in one single basis. While interesting from a theoretical standpoint, these protocols have the disadvantage that a two-way quantum communication channel is necessary which generally limits their theoretical efficiency and noise tolerance. In this paper, we construct a semiquantum key distribution (SQKD) protocol which actually takes advantage of this necessary two-way channel, and, after performing an information theoretic security analysis against collective attacks, we show it is able to tolerate a channel noise level higher than any prior SQKD protocol to date. We also compare the noise tolerance of our protocol to other two-way fully quantum protocols, along with BB84 with classical advantage distillation. We also comment on some practical issues involving semiquantum key distribution (in particular, concerning the potential complexity in physical implementation of our protocol as compared with other standard QKD protocols). Finally, we develop techniques that can be applied to the security analysis of other (S)QKD protocols reliant on a two-way quantum communication channel.
A semi-quantum key distribution (SQKD) protocol allows two users A and B to establish a shared secret key that is secure against an all-powerful adversary E even when one of the users (e.g., B) is semi-quantum or classical in nature while the other is fully-quantum. A mediated SQKD protocol allows two semi-quantum users to establish a key with the help of an adversarial quantum server. We introduce the concept of a multi-mediated SQKD protocol where two (or more) adversarial quantum servers are used. We construct a new protocol in this model and show how it can withstand high levels of quantum noise, though at a cost to efficiency. We perform an information theoretic security analysis and, along the way, prove a general security result applicable to arbitrary MM-SQKD protocols. Finally, a comparison is made to previous (S)QKD protocols.
The counter-intuitive features of quantum mechanics make it possible to solve problems and perform tasks that are beyond the abilities of non-quantum (classical) computers and communication devices. The field of quantum information processing studies how we can achieve such improvements by representing information as quantum states.One of the early achievements of quantum information processing is the development of quantum key distribution (QKD). QKD protocols allow two participants (Alice and Bob) to achieve the classically-impossible task of generating a secret shared key even if their adversary is computationally unlimited.Unfortunately, the security promises of QKD are true only in theory; practical implementations of QKD deviate from the theoretical protocols, and many of these deviations give rise to practical attacks. In this research thesis, we study the security properties of various QKD protocols in many practical settings:First, we study practical security of semiquantum key distribution (SQKD) protocols, where either Alice or Bob is non-quantum (classical). Following practical security problems in previous SQKD protocols, we suggest a new SQKD protocol (the "Mirror protocol") which can be securely implemented, and we prove it robust and secure against a wide range of attacks (the "uniform collective attacks").Then, we study "composable security" of the first QKD protocol created by Bennett and Brassard (BB84). BB84 has its unconditional security proved against adversaries performing the most general attacks in a theoretical (idealized) setting; however, some security approaches do not prove "composable security", which requires the secret key to remain secret even when Alice and Bob actually use it for cryptographic purposes. We generalize an algebraic security approach for BB84, making it prove composable security of BB84 (and many variants of BB84) against the most general attacks.Finally, we analyze an important practical attack (named "Bright Illumination"), showing how it can be modeled as a theoretical "Reversed-Space" attack.Overall, all results aim to enhance our understanding on how to bridge the gap between theory and practice in various sub-fields of QKD, and they may help solve a major open problem in the field of QKD: constructing a realistic QKD implementation that can be proved truly and unconditionally secure against any possible attack.
In this work, we design a quantum key distribution protocol, allowing two limited semiquantum or ``classical'' users to establish a shared secret key with the help of a fully quantum server. A semiquantum user can prepare and measure qubits only in the computational basis and so must rely on this quantum server to produce qubits in alternative bases and also to perform alternative measurements. However, we assume that the server is untrusted and we prove the unconditional security of our protocol even in the worst case: when this quantum server is an all-powerful adversary. We also compute a lower bound of the key rate of our protocol, in the asymptotic scenario, as a function of the observed error rate in the channel, allowing us to compute the maximally tolerated error of our protocol. Our results show that a semiquantum protocol may hold similar security to a fully quantum one.