scispace - formally typeset
Journal ArticleDOI

Quantum cryptography based on Bell's theorem.

Artur Ekert
- 05 Aug 1991 - 
- Vol. 67, Iss: 6, pp 661-663
TLDR
Practical application of the generalized Bells theorem in the so-called key distribution process in cryptography is reported, based on the Bohms version of the Einstein-Podolsky-Rosen gedanken experiment andBells theorem is used to test for eavesdropping.
Abstract
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.

read more

Citations
More filters
Journal ArticleDOI

Overcoming the rate-distance limit of quantum key distribution without quantum repeaters.

TL;DR: This work introduces an alternative scheme for QKD whereby pairs of phase-randomized optical fields are first generated at two distant locations and then combined at a central measuring station, enabling a form of quantum key distribution that can exceed the secret-key capacity without using quantum repeaters and that has security independent of the measuring devices.
Posted Content

Unconditional security in Quantum Cryptography

TL;DR: 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.
Journal ArticleDOI

Secure quantum key distribution with realistic devices

TL;DR: This review gives both sides of the story, with the current best theory of quantum security, and an extensive survey of what makes quantum cryptosystem safe in practice.
BookDOI

Advances in Cryptology — CRYPTO ’96

Neal Koblitz
TL;DR: This work presents new, simple, and practical constructions of message authentication schemes based on a cryptographic hash function, and proves that NMAC and HMAC are proven to be secure as long as the underlying hash function has some reasonable cryptographic strengths.