C. H. Bennett, T. Mor, and J. A. Smolin, Parity bit in quantum cryptography, Phys. Rev. A, 54(1996), 2675--2684.  Home/Search   Document Not in Database   Summary   APS   Related Articles   Check

.... collaboration with Massimo Palma and Asher Peres [34] Norbert Lutkenhaus also studied the security of quantum cryptography against eavesdropping [54] A particularly promising approach is due to Eli Biham and Tal Mor, where they consider what they call the collective attack [17, 18] See also [14] for a study of the security of the parity bit in quantum cryptography. Even though they have retracted their claim of an ultimate proof of security for quantum cryptography in noisy channels, the techniques presented by Hoi Kwong Lo and Hoi Fung Chau may well prove useful [52] In addition to ....

Bennett, C. H., T. Mor and J. Smolin, "The parity bit in quantum cryptography", Physical Review A, Vol. 54, no. 3, September 1996, in press.

....bit. 80 4.1 A measurement interpreted as an interaction with another system. 88 4.2 Quantum Key Distribution. 97 xiii List of Acronyms BC Bit Commitment see page 20. BCJL Reference [BCJL93] BMS Reference [BMS96] EPR Reference [EPR35] GOT Generalized Oblivious Transfer see page 43. MPC Multi Party Computation see page 2. OT Oblivious Transfer usually ( 2 1 ) OT is meant. 2 1 ) OT One out of Two Oblivious Transfer see page 20. POK Proof of Knowledge see page 21. POVM Positive Operator Valued ....

....and therefore it seems legitimate to talk of the notion of exponential indistinguishability for two families of quantum states. This notion could be useful when defining the security of quantum protocols; indeed, this was initially the main motivation for this research. For instance, in [BMS96] it is proven that the Shannon distinguishability of the parity (i.e. the overall exclusive or) of a quantum bit string decreases exponentially with the length of the string. This statement as such can be proven very easily using the techniques 52 presented here, as will be shown in Section 8, ....

[Article contains additional citation context not shown here]

BENNETT, C. H., T. MOR AND J. SMOLIN, "The parity bit in quantum cryptography", Physical Review A 54, 3 (1996), p. 2675, also available at http://xxx.lanl.gov/ps/quant-ph/9604040.

....joint attacks. Such attacks are beyond current technology, but obviously, a cryptosystem is not absolutely secure if some future technology could break it. Thus, proving security against any attack allowed by the rules of physics is a vital step. In this paper we complete the work started in [8, 9, 10] to conclude that, under a compatible error model, the four state scheme [3] for quantum key distribution is secure against any collective attack, an important subclass of the joint attacks. The first version of our paper appeared in the public domain 1 already in 1998 but has not yet been ....

....receiving all classical data. In the collective attack, each of Alice s qubits is attacked via a separate ancilla 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 ....

[Article contains additional citation context not shown here]

C. H. Bennett, T. Mor, and J. A. Smolin, Parity bit in quantum cryptography, Phys. Rev. A, 54(1996), 2675--2684.

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