Results 1 
3 of
3
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 195 (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 ...
Practical Quantum Oblivious Transfer
, 1992
"... We describe a protocol for quantum oblivious transfer , utilizing faint pulses of polarized light, by which one of two mutually distrustful parties ("Alice") transmits two onebit messages in such a way that the other party ("Bob") can choose which message he gets but cannot obtain information about ..."
Abstract

Cited by 73 (12 self)
 Add to MetaCart
We describe a protocol for quantum oblivious transfer , utilizing faint pulses of polarized light, by which one of two mutually distrustful parties ("Alice") transmits two onebit messages in such a way that the other party ("Bob") can choose which message he gets but cannot obtain information about both messages (he will learn his chosen bit's value with exponentially small error probability and may gain at most exponentially little information about the value of the other bit), and Alice will be entirely ignorant of which bit he received. Neither party can cheat (ie deviate from the protocol while appearing to follow it) in such a way as to obtain more information than what is given by the description of the protocol. Our protocol is easy to modify in order to implement the AllorNothing Disclosure of one out of two string messages, and it can be used to implement bit commitment and oblivious circuit evaluation without complexitytheoretic assumptions, in a way that remains secure e...
Quantum Cryptography: Uncertainty in the Service of Privacy
 Science
, 1992
"... a cryptographic key, enabling Alice to scramble her messages in a way only Bob, knowing the same key, could unscramble. Privacy thus appeared to be generally unavailable to users lacking the means and foresight by which diplomats and spies share secret keys with their intended correspondents. Classi ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
a cryptographic key, enabling Alice to scramble her messages in a way only Bob, knowing the same key, could unscramble. Privacy thus appeared to be generally unavailable to users lacking the means and foresight by which diplomats and spies share secret keys with their intended correspondents. Classical cryptography offered no purely mathematical solution to this "key distribution problem ". Meanwhile the only solution to the discreet communications problem appeared to be for Alice and Bob to confide their secrets in a trusted intermediary, who might later choose to blackmail them. All this was changed by PKC. The idea of PKC is for each user (eg Alice) to randomly choose a pair of mutually inverse transformationsa scrambling transformation and an unscrambling transformationand to publish the directions for performing the former but not the latter. Anyone, including Bob, can then use Alice's public scrambling algorithm to prepare a message that only she can unscramble. Si