Physical Review A · 2015 · 178 citations · 30 references
ComputingComputer SciencePhysicsCryptographyQuantum ComputingQuantum MechanicsCryptographic Protocol DesignInformation-theoretic CryptographyQuantum BitsQuantum CommunicationQuantum ComputationQuantum CryptographyAdversary ModelAsymptotic PropertiesError Rate AnalysisQuantum Key DistributionSecret Key GenerationWorst-case Scenario
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.
30
<i>Quantum Computation and Quantum Information</i>
Michael A. Nielsen, Isaac L. Chuang, Lov K. Grover · American Journal of Physics · 2002 · 22.7K citations
Quantum computation and quantum information
Jim Law · ACM SIGSOFT Software Engineering Notes · 2001 · 19.2K citations
Computing, Computer Science, Physics +13
The security of practical quantum key distribution
Valerio Scarani, H. Bechmann-Pasquinucci, Nicolas J. Cerf et al. · Reviews of Modern Physics · 2009 · 3.7K citations · Full text
Computing, Computer Science, Physics +15
Quantum cryptography using any two nonorthogonal states
Charles H. Bennett · Physical Review Letters · 1992 · 3.1K citations