Abstract

In this paper we use properties of quantum mixed states to find bounds on various measures of their distinguishability. These bounds are used for analyzing strong joint attacks against quantum key distribution which use quantum probes, quantum memories, and quantum gates to attack directly the final key. We present a wide class of joint attacks, and we prove security against them.

Keywords

Quantum key distributionComputer scienceQuantum cryptographyKey (lock)QuantumCryptographyClass (philosophy)Quantum informationJoint (building)Theoretical computer sciencePhysicsComputer securityQuantum mechanics

Affiliated Institutions

Related Publications

Quantum cryptography based on Bell’s theorem

Practical application of the generalized Bell's theorem in the so-called key distribution process in cryptography is reported. The proposed scheme is based on the Bohm's version...

1991 Physical Review Letters 10250 citations

Quantum computational networks

The theory of quantum computational networks is the quantum generalization of the theory of logic circuits used in classical computing machines. Quantum gates are the generaliza...

1989 Proceedings of the Royal Society of L... 1253 citations

Publication Info

Year
1997
Type
article
Volume
79
Issue
20
Pages
4034-4037
Citations
77
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

77
OpenAlex

Cite This

Eli Biham, Tal Mor (1997). Bounds on Information and the Security of Quantum Cryptography. Physical Review Letters , 79 (20) , 4034-4037. https://doi.org/10.1103/physrevlett.79.4034

Identifiers

DOI
10.1103/physrevlett.79.4034