Quantum cryptography with imperfect apparatus

@article{Mayers1998QuantumCW,
  title={Quantum cryptography with imperfect apparatus},
  author={Dominic Mayers and Andrew Chi-Chih Yao},
  journal={Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)},
  year={1998},
  pages={503-509}
}
  • D. MayersA. Yao
  • Published 15 September 1998
  • Mathematics
  • Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
Quantum key distribution, first proposed by C.H. Bennett and G. Brassard (1984), 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… 
View on IEEE
arxiv.org
404 Citations
Highly Influential Citations
26
Background Citations
174
Methods Citations
48
Results Citations
5

Figures from this paper

404 Citations

Quantum Cryptography Based Solely on Bell's Theorem

A new protocol is introduced which is efficient in terms of both classical and quantum communication, and that can tolerate noise in the quantum channel, and it is proved that it offers device-independent security under the sole assumption that certain non-signaling conditions are satisfied.

Robust device independent quantum key distribution

The proof of security builds upon a number of techniques, including randomness extractors that are secure against quantum storage as well as ideas originating in the coding strategy used in the proof of the Holevo-Schumacher-Westmoreland theorem which apply to bound correlations across multiple rounds in a way not unrelated to information-theoretic proofs of the parallel repetition property for multiplayer games.

Fully device-independent quantum key distribution.

This work rigorously proves the device-independent security of a slight variant of Ekert's original entanglement-based protocol against the most general (coherent) attacks, and achieves a linear key rate and tolerates a constant noise rate in the devices.

Advances in quantum key distribution and quantum randomness generation

This thesis discusses some progress in quantum key distribution and quantum randomness generation, and presents a study on reference-frame-independent protocols whose knowledge can help design more efficient protocols, and a framework to the security analysis of distributed-phase-reference protocols, which have been missing for many years.

A practical trojan horse for bell-inequality-based quantum cryptography

The old truth of cryptography still holds: you have to trust the manufacturer of your cryptographic device, even when you do violate the Bell inequality.

Device-independent quantum key distribution

This thesis shows how device-independent quantum key distribution can be achieved when imposing an additional condition, which demands that the behaviour of the system shared between the honest parties and the adversary can be obtained by measuring some kind of entangled quantum state.

Unconditional security in quantum cryptography

Basic techniques to prove the unconditional security of quantum crypto graphy are described and a practical variation on the protocol in which the channel is noisy and photos may be lost during the transmission is considered.

Fully device independent quantum key distribution

This work rigorously proves the device-independent security of an entanglement-based protocol building on Ekert's original proposal for quantum key distribution and builds on techniques from the classical theory of pseudo-randomness to achieve a new quantitative understanding of the non-local nature of quantum correlations.

Practical device-independent quantum cryptography via entropy accumulation

A property of entropy, termed “entropy accumulation”, is presented, which asserts that the total amount of entropy of a large system is the sum of its parts, which is used to prove the security of cryptographic protocols, including device-independent quantum key distribution, while achieving essentially optimal parameters.

Simple and tight device-independent security proofs

A flexible protocol is provided and a security proof is given that provides quantitative bounds that are asymptotically tight, even in the presence of general quantum adversaries, which is likely that these protocols can be practically implemented in the near future.
...

References

SHOWING 1-10 OF 29 REFERENCES

Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels.

The concept of quantum privacy amplification and a cryptographic scheme incorporating it which is provably secure over a noisy channel is introduced and implemented using technology that is currently being developed.

Quantum oblivious transfer is secure against all individual measurements

  • D. MayersL. Salvail
  • Computer Science, Mathematics
    Proceedings Workshop on Physics and Computation. PhysComp '94
  • 1994
It is shown that the BBCS-protocol implementing one of the most important cryptographic primitives-'oblivious transfer'-is secure against any individual measurement allowed by quantum mechanics.

Security of quantum protocols against coherent measurements

  • A. Yao
  • Computer Science, Mathematics
    STOC '95
  • 1995
Some mathematical techniques for analyzing probabilistic events in Hilbert spaces are developed, and the security of a canonical quantum oblivious transfer protocol against coherent measurements is proved.

OPTIMAL EAVESDROPPING IN QUANTUM CRYPTOGRAPHY. I. INFORMATION BOUND AND OPTIMAL STRATEGY

It is shown that both bounds can be attained simultaneously by an optimal eavesdropping probe, and an upper bound to the accessible information in one basis, for a given error rate in the conjugate basis is derived.

Quantum Cryptography over Underground Optical Fibers

Quantum cryptography is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light whose…

Quantum cryptography using any two nonorthogonal states.

  • Bennett
  • Physics
    Physical review letters
  • 1992
It is shown that in principle any two nonorthogonal quantum states suffice, and a practical interferometric realization using low-intensity coherent light pulses is described.

Parity bit in quantum cryptography.

  • BennettMorSmolin
  • Computer Science, Mathematics
    Physical review. A, Atomic, molecular, and optical physics
  • 1996
This paper finds the measurement which provides the optimal mutual information about the parity bit and calculates that information, and proves that this information decreases exponentially with the length of the string in the case where the single bit states are almost fully overlapping.

FREE-SPACE QUANTUM-KEY DISTRIBUTION

Nonproliferation and International Security,Los Alamos, NM 87545(February 1, 2008)A working free-space quantum key distribution (QKD)system has been developed and tested over a 205-m indooroptical…

OPTIMAL EAVESDROPPING IN QUANTUM CRYPTOGRAPHY. II. A QUANTUM CIRCUIT

It is shown that the optimum strategy of the eavesdropper can be expressed in terms of a quantum circuit in a way which makes it obvious why certain parameters take on particular values.

Quantum cryptography based on Bell's theorem.

  • Ekert
  • Mathematics, Physics
    Physical review letters
  • 1991
Practical application of the generalized Bells theorem in the so-called key distribution process in cryptography is reported. The proposed scheme is based on the Bohms version of the…