You are provided with the abstract of a scientific paper and the abstracts of the papers it references. Your task is to write a Related Work section for the main paper. This section should concisely summarize and integrate the key points from the cited abstracts, reflecting how they relate to the main paper's contributions and context. In your summary, use numerical citation markers like [1], [2], etc., to refer to the corresponding papers.

Main Abstract:
In this work we introduce a novel QKD protocol capable of smoothly transitioning, via user-tuneable parameter, from classical to semi-quantum in order to help understand the effect of quantum communication resources on secure key distribution. We perform an information theoretic security analysis of this protocol to determine what level of "quantumness" is sufficient to achieve security, and we discover some rather interesting properties of this protocol along the way.

Cited Abstract(s):
[1]: In this paper, we investigate single-state, semi-quantum key distribution protocols. These are protocols whereby one party is limited to measuring only in the computational basis, while the other, though capable of measuring in both computational and Hadamard bases, is limited to preparing and sending only a single, publicly known qubit state. Such protocols rely necessarily on a two-way quantum communication channel making their security analysis difficult. However, we will show that, for single-state protocols, we need only consider a restricted attack operation by Eve. We will also describe a new single-state protocol that permits "reflections" to carry information and use our results concerning restricted attacks to show its robustness.

[2]: Semi-quantum key distribution protocols are designed to allow two users to establish a secure secret key when one of the two users is limited to performing certain “classical” operations. There have been several such protocols developed recently, however, due to their reliance on a two-way quantum communication channel (and thus, the attacker's opportunity to interact with the qubit twice), their security analysis is difficult and little is known concerning how secure they are compared to their fully quantum counterparts. In this paper we prove the unconditional security of a particular semi-quantum protocol and derive an expression for its key rate, in the asymptotic scenario.

[3]: 

[4]: Semi-quantum key distribution (SQKD) can share secret keys by using less quantum resource than its fully quantum counterparts, and this likely makes SQKD become more practical and realizable. In this paper, we present a new SQKD protocol by introducing the idea of B92 into semi-quantum key distribution and prove its unconditional security. In this protocol, the sender Alice just sends one qubit to the classical Bob and Bob just prepares one state in the preparation process. Indeed the classical user's measurement is not necessary either. This protocol can reduce some quantum communication and make it easier to be implemented. It can be seen as the semi-quantum version of B92 protocol, comparing to the protocol BKM2007 as the semi-quantum version of BB84 in fully quantum cryptography. We verify it has higher key rate and therefore is more efficient. Specifically we prove it is unconditionally secure by computing a lower bound of the key rate in the asymptotic scenario from information theory aspect. Then we can find a threshold value of errors such that for all error rates less than this value, the secure key can be established between the legitimate users definitely. We make an illustration of how to compute the threshold value in case of the reverse channel is a depolarizing one with parameter @math . Though the threshold value is a little smaller than those of some existed SQKD protocols, it can be comparable to the B92 protocol in fully quantum cryptography.

[5]: Recently, presented a novel semiquantum key distribution protocol [Phys. Rev. Lett. 99 (2007) 140501] by using four quantum states, each of which is randomly prepared in the Z or X basis. Here we present a semi-quantum key distribution protocol by using maximally entangled states in which quantum Alice shares a secret key with classical Bob. Quantum Alice has the ability to prepare Bell states and perform Bell basis or computational basis measurement. Classical Bob is restricted to measuring, preparing a particle in the computational basis, reflecting or reordering the particles. The qubit efficiency of the protocol improves to 50 and the protocol can be modified to a measure-resend protocol or a protocol without quantum memory. We also show that the protocol is secure against eavesdropping.

[6]: Quantum key distribution (QKD) protocols make it possible for two quantum parties to generate a secret shared key. Semiquantum key distribution (SQKD) protocols, such as "QKD with classical Bob" and "QKD with classical Alice" (that have both been proven robust), achieve this goal even if one of the parties is classical. However, existing SQKD protocols are not experimentally feasible with current technology. Here we suggest a new protocol, "Classical Alice with a controllable mirror", that can be experimentally implemented with current technology (using 4-level systems instead of qubits), and we prove it to be robust.

[7]: In the existing semiquantum key distribution (SQKD) protocols, the both parties must measure qubits in some bases. In this paper, we show that the classical party's measurement capability is not necessary by constructing an SQKD protocol without invoking the classical Alice's measurement capability. In particular, we prove that the proposed SQKD protocol is completely robust against joint attacks. Compared with the existing SQKD protocols, the number of the quantum states sent by Alice and Bob is decreased.

[8]: Secure key distribution among two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the other hand, a secure key distribution is possible when both parties are quantum. What is possible when only one party (Alice) is quantum, yet the other (Bob) has only classical capabilities? Recently, a semi-quantum key distribution protocol was presented (Boyer, Kenigsberg and Mor, Physical Review Letters, 2007), in which one of the parties (Bob) is classical, and yet, the protocol is proven to be completely robust against an eavesdropping attempt. Here we extend that result much further. We present two protocols with this constraint, and prove their robustness against attacks: we prove that any attempt of an adversary to obtain information (and even a tiny amount of information) necessarily induces some errors that the legitimate parties could notice. One protocol presented here is identical to the one referred to above, however, its robustness is proven here in a much more general scenario. The other protocol is very different as it is based on randomization.

[9]: 

[10]: Secure key distribution among two remote parties is impossible when both are classical, unless some unproven computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the other hand, a secure key distribution is possible when both parties are quantum. What is possible when only one party (Alice) is quantum, yet the other (Bob) has only classical capabilities? We present a protocol with this constraint and prove its robustness against attacks: we prove that any attempt of an adversary to obtain information necessarily induces some errors that the legitimate users could notice.

[11]: It seems that quantum key distribution (QKD) may be completely insecure when the message sender Alice always encodes her key bits in a fixed basis. In this paper, we present a QKD protocol with classical Alice, i.e. Alice always encodes her key bit in the |0>, |1> basis (we call it classical 0,1 basis) and the eavesdropper Eve knows this fact. We prove that our protocol is completely robust against any eavesdropping attack and present the amount of tolerable noise against Eve's individual attack. Next, we present a QKD protocol to demonstrate that secure key bits can be distributed even if neither Alice nor Bob has quantum capacities, and extend this idea to a QKD network protocol with numerous parties who have only classical capacities. Finally, we discuss that quantum is necessary in QKD for security reasons, but both Alice and Bob may be classical.
Since the framework's introduction in 2007 by , [4]3 [4]5 , numerous SQKD protocols have been proposed [4]3 [4]5 [4]6 [1] [5] [4]1 [7] [6] (just to list a few), some with information theoretic proofs of security [2] [4] [3] . Often one is interested in removing requirements on one or both users while still attempting to attain security against an all-powerful adversary - this is to study the effects of these resources and abilities on the secure communication rate of the resulting protocol. However, no prior SQKD protocols allow for the smooth transition from a purely classical protocol to a semi-quantum one.