# Quantum cryptography based on Bell's theorem.

@article{Ekert1991QuantumCB, title={Quantum cryptography based on Bell's theorem.}, author={Ekert}, journal={Physical review letters}, year={1991}, volume={67 6}, pages={ 661-663 } }

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 Einstein-Podolsky-Rosen gedanken experiment and Bells theorem is used to test for eavesdropping. © 1991 The American Physical Society.

## 7,630 Citations

### Quantum cryptography based on qutrit Bell inequalities

- Computer Science, Mathematics
- 2003

A cryptographic protocol based upon entangled qutrit pairs is presented and the scheme under a symmetric incoherent attack is analyzed and the region for which the protocol is secure is plotted and compared with the region of violations of certain Bell inequalities.

### Quantum cryptography based on wheeler's delayed choice experiment

- Computer Science, Mathematics
- 1995

### On A Fundamental Theorem of Quantum Cryptography

- Mathematics, Computer Science
- 1993

A fundamental theorem of quantum cryptography is proved which states the conditions under which an eavesdropper can be detected, and any two-alphabet quantum cryptography scheme must sacrifice some of the potential key data to guarantee security.

### Bell's Inequality and Rejected-data Protocols for Quantum Cryptography

- Computer Science, Mathematics
- 1993

A suitably constructed Bell inequality is introduced as a test of the integrity of a single-particle quantum cryptography scheme.

### Security of EPR-based quantum cryptography against incoherent symmetric attacks

- Computer Science, Physics
- 2001

It is shown that under certain assumptions of symmetry the effectiveness of this strategy for incoherent eavesdropping in Ekert's entanglement-based quantum key distribution protocol reduces to that of the original single-qubit protocol of Bennett and Brassard.

### Multidimensional Bell Inequalities and Quantum Cryptography

- Computer Science, MathematicsC2SI
- 2015

The main cryptographic quantum protocols are key distribution schemes, in which two parties generate a shared random secret string and the privacy of the key can be checked using Bell inequalities.

### Efficient multiuser quantum cryptography network based on entanglement

- Computer Science, MathematicsScientific reports
- 2017

An efficient quantum key distribution protocol with a certain entangled state to solve a special cryptographic task and a proof of security of this protocol is provided by generalizing the proof of modified of Lo-Chau scheme.

### Quantum Cryptography - The Issue of Security in Selected Quantum Protocols and the Issue of Data Credibility

- Computer Science
- 2010

The present paper presents the possibilities of using quantum mechanics in cryptography and considers whether there are any practical solutions to the important class of problems regarding the security of transmitted information.

## References

SHOWING 1-2 OF 2 REFERENCES

### Bell Syst

- Tech. J. 2$, 656
- 1949

### Physics (Long Island City

- N. Y.) 1, 195 (1965); J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, Phys. Rev. Lett. 23, 880
- 1969