Quantum Key Distribution with Classical Bob
<|reference_start|>Quantum Key Distribution with Classical Bob: 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? We present a protocol with this constraint, and prove its 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 users could notice.<|reference_end|>
@article{boyer2007quantum,
    title={Quantum Key Distribution with Classical Bob},
    author={Michel Boyer, Dan Kenigsberg and Tal Mor},
    journal={arXiv preprint arXiv:quant-ph/0703107},
    year={2007},
    doi={10.1103/PhysRevLett.99.140501},
    archivePrefix={arXiv},
    eprint={quant-ph/0703107},
    primaryClass={quant-ph cs.CR}
}