Results 1 
8 of
8
Efficient Quantum Key Distribution Scheme And Proof of Its Unconditional Security
 Cryptology, ISSN: 09332790 (Paper) 14321378 (Online) published online 3 March 2004, (10.1007/s001450040142y). (SpringerVerlag
"... We devise a simple modification that essentially doubles the efficiency of the BB84 quantum key distribution scheme proposed by Bennett and Brassard. We also prove the security of our modified scheme against the most general eavesdropping attack that is allowed by the laws of physics. The first majo ..."
Abstract

Cited by 39 (9 self)
 Add to MetaCart
(Show Context)
We devise a simple modification that essentially doubles the efficiency of the BB84 quantum key distribution scheme proposed by Bennett and Brassard. We also prove the security of our modified scheme against the most general eavesdropping attack that is allowed by the laws of physics. The first major ingredient of our scheme is the assignment of significantly different probabilities to the different polarization bases during both transmission and reception, thus reducing the fraction of discarded data. A second major ingredient of our scheme is a refined analysis of accepted data: We separate the accepted data into various subsets according to the basis employed and estimate an error rate for each subset separately. We then show that such a refined data analysis guarantees the security of our scheme against the most general eavesdropping strategy, thus generalizing Shor and Preskill’s proof of security of BB84 to our new scheme. Up till now, most proposed proofs of security of singleparticle type quantum key distribution schemes have relied heavily upon the fact that the bases are chosen uniformly, randomly and independently. Our proof removes this symmetry requirement.
Security of quantum key distribution
, 1998
"... We devise a simple modification that essentially doubles the efficiency of a wellknown quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different polarization bases during both transmission and reception to red ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
(Show Context)
We devise a simple modification that essentially doubles the efficiency of a wellknown quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different polarization bases during both transmission and reception to reduce the fraction of discarded data. The actual probabilities used in the scheme are announced in public. As the number of transmitted signals increases, the efficiency of our scheme can be made to approach 100%. An eavesdropper may try to break such a scheme by eavesdropping mainly along the predominant basis. To defeat such an attack, we perform a refined analysis of accepted data: Instead of lumping all the accepted data together to estimate a single error rate, we separate the accepted data into various subsets according to the basis employed and estimate an error rate for each subset individually.
New Trends in Quantum Computation
 in Proceedings of the 13 th Annual Symposium on Theoretical Aspects of Computer Science
, 1996
"... Abstract. Classical and quantum information are very different. Together they can perform feats that neither could achieve alone, such as quantum computing, quantum cryptography and quantum teleportation. Some of the applications range from helping to preventing spies from reading private communicat ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Classical and quantum information are very different. Together they can perform feats that neither could achieve alone, such as quantum computing, quantum cryptography and quantum teleportation. Some of the applications range from helping to preventing spies from reading private communications. Among the tools that will facilitate their implementation, we note quantum purification and quantum error correction. Although some of these ideas are still beyond the grasp of current technology, quantum cryptography has been implemented and the prospects are encouraging for smallscale prototypes of quantum computation devices before the end of the millennium. 1
Cryptology Column  25 Years of Quantum Cryptography
, 1996
"... The fates of SIGACT News and Quantum Cryptography are inseparably entangled. The exact date of Stephen Wiesner's invention of "conjugate coding" is unknown but it cannot be far from April 1969, when the premier issue of SIGACT Newsor rather SICACT News as it was known at the time ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
The fates of SIGACT News and Quantum Cryptography are inseparably entangled. The exact date of Stephen Wiesner's invention of "conjugate coding" is unknown but it cannot be far from April 1969, when the premier issue of SIGACT Newsor rather SICACT News as it was known at the timecame out. Much later, it was in SIGACT News that Wiesner's paper finally appeared [74] in the wake of the first author's early collaboration with Charles H. Bennett [7]. It was also in SIGACT News that the original experimental demonstration for quantum key distribution was announced for the first time [6] and that a thorough bibliography was published [19]. Finally, it was in SIGACT News that Doug Wiedemann chose to publish his discovery when he reinvented quantum key distribution in 1987, unaware of all previous work but Wiesner's [73, 5]. Most of the first decade of the history of quant
New encoding schemes for quantum authentication
"... We study the potential of general quantum operations, TracePreserving CompletelyPositive Maps (TPCPs), as encoding and decoding mechanisms in quantum authentication protocols. The study shows that these general operations do not offer significant advantage over unitary encodings. We also propose a ..."
Abstract
 Add to MetaCart
(Show Context)
We study the potential of general quantum operations, TracePreserving CompletelyPositive Maps (TPCPs), as encoding and decoding mechanisms in quantum authentication protocols. The study shows that these general operations do not offer significant advantage over unitary encodings. We also propose a practical authentication protocol based on the use of two successive unitary encodings. 1
Cryptology Column 25 Years of Quantum Cryptography 1
, 1996
"... In t roduct ion The fates of SIGACT News and Quantum Cryptography are inseparably entangled. The exact date of Stephen Wiesner's invention of "conjugate coding " is unknown but it cannot be far from April 1969, when the premier issue of SIGACT Newsor rather SICACT News as it was kn ..."
Abstract
 Add to MetaCart
(Show Context)
In t roduct ion The fates of SIGACT News and Quantum Cryptography are inseparably entangled. The exact date of Stephen Wiesner's invention of "conjugate coding " is unknown but it cannot be far from April 1969, when the premier issue of SIGACT Newsor rather SICACT News as it was known at the timecame out. Much later, it was in SIGACT News that Wiesner's paper finally appeared [74] in the wake of the first author's early collaboration with Charles H. Bennett [7]. It was also in SIGACT News that the original experimental demonstration for quantum key distribution was announced for the first time [6] and that a thorough bibliography was published [19]. Finally, it was in SIGACT News that Doug Wiedemann chose to publish his discovery when he reinvented quantum key distribution in 1987, unaware of all previous work but Wiesner's [73, 5]. Most of the first decade of the history of quantum cryptography consisted of this lone unpublished paper by Wiesner. Fortunately, Bennett was among the few initiates who knew of Wiesner's ideas directly from the horse's mouth. His meeting with the first author of this column in 1979 was the beginning of a most fruitful lifelong collaboration. It took us