Results 1 
4 of
4
Experimental Quantum Cryptography
 Journal of Cryptology
, 1992
"... We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share no secret information initially: 1) exchange a random quantum transmission, consisting of very faint flashes of polarized light; 2) by subsequent public discussion of the ..."
Abstract

Cited by 198 (20 self)
 Add to MetaCart
We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share no secret information initially: 1) exchange a random quantum transmission, consisting of very faint flashes of polarized light; 2) by subsequent public discussion of the sent and received versions of this transmission estimate the extent of eavesdropping that might have taken place on it, and finally 3) if this estimate is small enough, distill from the sent and received versions a smaller body of shared random information, which is certifiably secret in the sense that any third party's expected information on it is an exponentially small fraction of one bit. Because the system depends on the uncertainty principle of quantum physics, instead of usual mathematical assumptions such as the difficulty of factoring, it remains secure against an adversary with unlimited computing power. A preliminary version of this paper was presented at Eurocrypt '90, May 21 ...
The Strong Secret Key Rate of Discrete Random Triples
 COMMUNICATION AND CRYPTOGRAPHY
, 1994
"... Three parties, Alice, Bob and Eve, know the sequences of random variables X N = [X 1 ; X 2 ; : : : XN ], Y N = [Y 1 ; Y 2 ; : : : Y N ] and Z N = [Z 1 ; Z 2 ; : : : ZN ], respectively, where the triples (X i Y i Z i ), for 1 i N , are generated by a discrete memoryless source according ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
Three parties, Alice, Bob and Eve, know the sequences of random variables X N = [X 1 ; X 2 ; : : : XN ], Y N = [Y 1 ; Y 2 ; : : : Y N ] and Z N = [Z 1 ; Z 2 ; : : : ZN ], respectively, where the triples (X i Y i Z i ), for 1 i N , are generated by a discrete memoryless source according to some probability distribution PXY Z . Motivated by Wyner's and Csisz'ar and Korner's pioneering definition of, and work on, the secrecy capacity of a broadcast channel, the secret key rate of PXY Z was defined by Maurer as the maximal rate M=N at which Alice and Bob can generate secret shared random key bits S 1 ; : : : ; SM by exchanging messages over an insecure public channel accessible to Eve, such that the rate at which Eve obtains information about the key is arbitrarily small, i.e., such that lim N!1 I(S 1 ; : : : ; SM ; Z N ; C t )=N = 0, where C t is the collection of messages exchanged between Alice and Bob over the public channel. However, this definition is n...
Quantum cryptography
 Contemporary Physics
, 1995
"... LAUR95806 Quantum cryptography is a new method for secret communications offering the ultimate security assurance of the inviolability of a Law of Nature. In this paper we shall describe the theory of quantum cryptography, its potential relevance and the development of a prototype system at Los A ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
LAUR95806 Quantum cryptography is a new method for secret communications offering the ultimate security assurance of the inviolability of a Law of Nature. In this paper we shall describe the theory of quantum cryptography, its potential relevance and the development of a prototype system at Los Alamos, which utilises the phenomenon of singlephoton interference to perform quantum cryptography over an optical fiber communications link. 1.
On the SecretKey Rate of Binary Random Variables
 in Proc. 1994 IEEE Int. Symp. on Information Theory
, 1994
"... Martin J. Gander Department of Computer Science Stanford University Stanford, CA 943052140, USA Ueli M. Maurer Inst. for Theoretical Computer Science ETH Zurich CH8092 Zurich, Switzerland Consider two parties, Alice and Bob, who would like to communicate securely over an insecure channel t ..."
Abstract
 Add to MetaCart
Martin J. Gander Department of Computer Science Stanford University Stanford, CA 943052140, USA Ueli M. Maurer Inst. for Theoretical Computer Science ETH Zurich CH8092 Zurich, Switzerland Consider two parties, Alice and Bob, who would like to communicate securely over an insecure channel to which an eavesdropper Eve has perfect access. Alice and Bob are assumed to be able to authenticate each others messages (e.g., by speaker identification) , and the motivation of this paper is to demonstrate protocols that allow Alice and Bob to exchange messages in a provablyconfidential manner. It is wellknown that a conventional cryptosystem together with a shared secret key, or a publickey cryptosystem [3] when no secret key is shared, can be used for achieving this goal. However, no cryptosystem (conventional or publickey) has yet been proven to be computationallysecure.