|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
39th Annual Symposium on Foundations of Computer Science
Quantum Cryptography with Imperfect Apparatus
Palo Alto, California
November 08-November 11
ISBN: 0-8186-9172-7
| ASCII Text | x | ||
| Dominic Mayers, Andrew Yao, "Quantum Cryptography with Imperfect Apparatus," Foundations of Computer Science, IEEE Annual Symposium on, pp. 503, 39th Annual Symposium on Foundations of Computer Science, 1998. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1998.743501, author = {Dominic Mayers and Andrew Yao}, title = {Quantum Cryptography with Imperfect Apparatus}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1998}, issn = {0272-5428}, pages = {503}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743501}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Quantum Cryptography with Imperfect Apparatus SN - 0272-5428 SP EP A1 - Dominic Mayers, A1 - Andrew Yao, PY - 1998 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
Quantum key distribution, first proposed by Bennett and Brassard, provides a possible key distribution scheme whose security depends only on the quantum laws of physics. So far the protocol has been proved secure even under channel noise and detector faults of the receiver, but is vulnerable if the photon source used is imperfect. In this paper we propose and give a concrete design for a new concept, "self-checking source", which requires the manufacturer of the photon source to provide certain tests; these tests are designed such that, if passed, the source is guaranteed to be adequate for the security of the quantum key distribution protocol, even though the testing devices may not be built to the original specification. The main mathematical result is a structural theorem which states that, for any state in a Hilbert space, if certain EPR-type equations are satisfied, the state must be essentially the orthogonal sum of EPR pairs.
Citation:
Dominic Mayers, Andrew Yao, "Quantum Cryptography with Imperfect Apparatus," focs, pp.503, 39th Annual Symposium on Foundations of Computer Science, 1998
Usage of this product signifies your acceptance of the Terms of Use.
