D. Mayers, Quantum Key Distribution and String Oblivious Transfer in Noisy Channels, Los Alamos preprint archive qunat-ph/9606003, June 96, Proceedings of Crypto '96, LNCS vol. 1109.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and all ancillas are finally measured collectively. The first hints that such collective measurements will not destroy the security obtained by privacy amplification were provided in [8] The first 4 complete examples (which contain privacy amplification and error correction) were provided in [14, 9] (Mayers work was based on an earlier work of Yao) In this paper we restrict ourself to collective attacks [9, 10] where each qubit is attached to a separate probe, unentangled to any other probe. The measurement is delayed until after all the classical data is obtained, and is performed ....

D. Mayers, Quantum key distribution and string oblivious transfer in noisy channel, in Advances in cryptology - CRYPTO'96, LNCS 1109, Springer-Verlag, Berlin, 1996, pp. 343--357.

....[Mal94] and modal logics. Malinowski [Mal94] has considered a quantum logic and shown that it has no decision procedure. Havel [Hav98] gives a geometric algebra (with multiple particles) for expressing the operations of a Bulk QC. ffl Quantum Programming Languages and Their Compilers. Malhas [May96] defines a quantum version of the lambda calculus (the lambda calculus is a formal programming system similar to lisp) and Malhas [May97] shows that it can efficiently simulate quantum computations. Tucci [Tuc 98] describes a procedure for compiling unitary quantum transformations into elementary ....

....cryptography. Bennett et al. [BBB 92] Hughes et al. [HLM 96] describes experiments of quantum cryptography, including optical fibers. Bennett et al. [BBC 91] gave a protocol for quantum oblivious transfer. Mayers [May95] gives quantum oblivious transfer and key distribution protocols and Mayers [May96] extends the protocols to noisy channels. Lo, Chau [LC98] give a quantum key distribution protocol which is unconditionally secure over arbitrarily long distance. Brassard, Crpeau [BC90] gave quantum bit commitment and quantum coin tossing protocols. Brassard et al. [BCJ93] gives quantum bit ....

[Article contains additional citation context not shown here]

D. Mayers. Quantum key distribution and string oblivious transfer in noisy channels. In Neal Koblitz, editor, Advances in Cryptology -- CRYPTO '96, volume 1109 of Lecture Notes in Computer Science, pages 343-357, (August 1996). Springer-Verlag.

....physics. For example, Shor [29] has shown that integers can be factored in expected polynomial time by quantum computers, a quantum key distribution protocol of Bennett and Brassard [10] that does not rely on intractability assumptions has been proven secure under a wide variety of attacks [23, 24], and Raz [26] has shown an exponential separation between quantum and classical two party communication complexity models. In this paper we introduce the quantum analogue of another concept interactive proof systems and provide strong evidence that additional power is gained by interactive ....

D. Mayers. Quantum key distribution and string oblivious transfer in noisy channels. In Advances in Cryptology: Proceedings of Crypto'96, volume 1109 of Lecture Notes in Computer Science, pages 343--357. Springer-Verlag, 1996.

.... in noisy channels, the techniques presented by Hoi Kwong Lo and Hoi Fung Chau may well prove useful [52] In addition to the above, we are aware of one claim of unconditional security for BB84 against all possible attacks consistent with quantum mechanics, which is due to Dominic Mayers [58], drawing on work by Andrew C. C. Yao [76] and earlier work of Mayers in collaboration with Salvail [61] In practice, it is not sufficient to prove the security of quantum key distribution if the proof simply states the existence of a positive constant so that secure key distribution is ....

.... to oblivious transfer of strings rather than bits, and considered the possibility 1 Note that Wiesner also showed how to cheat his own quantum multiplexing technique in the paper that introduced it [74] Is there something wrong with us quantum cryptographers of errors on the quantum channel [58]. The proof that a secure quantum bit commitment protocol is sufficient to implement secure quantum oblivious transfer was complete. Recall that it is believed in the classical world that one cannot build secure oblivious transfer from bit commitment alone. In parallel with the work outlined in ....

Mayers, D., "Quantum key distribution and string oblivious transfer in noisy channels", Advances in Cryptology --- Proceedings of Crypto '96, August 1996, Springer -- Verlag.

....with transmission errors may be found in [2] Mayers and Salvail [22] have later shown that the second restriction may be reduced to general measurements involving only one photon at a time, and finally Yao [30] showed that no restrictions on the type of measurements is necessary. Lately, Mayers [21] has shown a result similar to Yao s for the more robust protocol of [2] Similarly, a new protocol for quantum bit commitment has been developed by Brassard and Cr epeau [6] in order to close the gap and obtain a secure one out of two Oblivious Transfer. Moreover, an extension due to Brassard, ....

D. Mayers, "Quantum Key Distribution and String Oblivious Transfer on Noisy Channels ", manuscript posted on Los Alamos reprint archive quant-ph, June 96; To appear in Advances in Cryptology: Proceedings of Crypto '96, Lecture Notes in Computer Science, Springer-Verlag, 1996.

....cryptography. Bennett et al. [BBB 92] Hughes et al. [HLM 96] describes experiments of quantum cryptography, including optical fibers. Bennett et al. [BBC 91] gave a protocol for quantum oblivious transfer. Mayers [May95] gives quantum oblivious transfer and key distribution protocols and Mayers [May96] extends the protocols to noisy channels. Lo, Chau [LC98] give a quantum key distribution protocol which is unconditionally secure over arbitrarily long distance. Brassard, Crpeau [BC90] gave quantum bit commitment and quantum coin tossing protocols. Brassard et al. [BCJ93] gives quantum bit ....

D. Mayers. Quantum key distribution and string oblivious transfer in noisy channels. In Neal Koblitz, editor, Advances in Cryptology -- CRYPTO '96, volume 1109 of Lecture Notes in Computer Science, pages 343-357, (August 1996). Springer-Verlag.

....provides the ability to expand an initially short and secret random secret key shared between a pair of trusted parties into a much longer one without compromising its security. The BB84 scheme was the first proposed quantum secret key expansion protocol[3] and was shown secure by Mayers [12, 14]. Secret key expansion being incompatible with classical information theory indicates that quantum cryptography is more powerful than its classical counterpart. However, quantum information has also fundamental limits when cryptography between two potentially collaborative but untrusted parties is ....

Mayers, D., "Quantum Key Distribution and String Oblivious Transfer in Noisy Channels", Advances in Cryptology : CRYPTO '96 : Proceedings, Lecture Notes in Computer Science, no 1109, Springer--Verlag, August 1996, pp. 343 -- 357.

.... quantum protocols depend on the security of bit commitment [3,5,19] On the other hand, we disagree with the following sentence from Lo and Chau: One might wonder if all of quantum cryptography may stumble under closer scrutinies because our earlier proof of security for quantum key distribution [11,13] would hold even if secure quantum bit commitment is not possible despite the fact that it is based on an earlier proof of security for quantum oblivious transfer that fails in the absence of a secure bit commitment scheme. The reason is that the proof of security for quantum key distribution ....

D. Mayers, Quantum Key Distribution and String Oblivious Transfer on Noisy Channels, Los Alamos preprint archive quant-ph/9606003, June 96. Also in: Advances in Cryptology: Proceeding of Crypto '96, Lecture Notes in Computer Science (to be published)

No context found.

D. Mayers, Quantum Key Distribution and String Oblivious Transfer in Noisy Channels, Los Alamos preprint archive qunat-ph/9606003, June 96, Proceedings of Crypto '96, LNCS vol. 1109.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC