G. Brassard, C. Cr'epeau, D. Mayers, L. Salvail, Defeating Classical Bit Commitments with a Quantum Computer, Los Alamos preprint archive quant-ph/9806031, May 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Multi-party Quantum Computation - Smith (2001) (Correct)
....is one of the participants in the system and not an outside eavesdropper, much less is known. Some proofs were also attempted for tasks such as bit commitment [BCJL93] but those proofs were later discovered to be awed, since bit commitment was proven impossible [May96, LC97a, May97, LC96, LC97b, BCMS98] There have also been several works on quanutm coin tossing. Although arbitrarily small error is known to be impossible, several works have focused on reducing the error as much as possible [LC96, MS99, ATVY00, Amb01] Yet another line of work has focused on how to achieve certain twoparty tasks ....
Gilles Brassard, Claude Crepeau, Dominic Mayers, and Louis Salvail. Defeating classical bit commitments with a quantum computer. quantph /9806031, June 1998.
Alternative Computational Models: A Comparison of Biomolecular and .. - Reif (1998) (1 citation) (Correct)
....long distance. Brassard, Crpeau [BC90] gave quantum bit commitment and quantum coin tossing protocols. Brassard et al. [BCJ93] gives quantum bit commitment scheme provably unbreakable by both parties. Yao [Yao95] proved quantum protocols secure against coherent measurements. Brassard et al. [BCM 98] shows how to defeat classical bit commitments with a quantum computer. Chau, Lo [CL98] gives further methods for qubit commitment. Crpeau et al. [CS95] gives protocols for quantum oblivious mutual identification. Lo, Chau [LC98] have recently argued that quantum bit commitment and ideal quantum ....
G. Brassard, C. Crpeau, D. Mayers, L. Salvail, Defeating classical bit commitments with a quantum computer, (Online preprint quant-ph/9806031), (1998).
Quantum Information Processing: Compression, Coding, and Related.. - Reif (1985) (Correct)
....long distance. Brassard, Crpeau [BC90] gave quantum bit commitment and quantum coin tossing protocols. Brassard et al. [BCJ93] gives quantum bit commitment scheme provably unbreakable by both parties. Yao [Yao95] proved quantum protocols secure against coherent measurements. Brassard et al. [BCM 98] shows how to defeat classical bit commitments with a quantum computer. Chau, Lo [CL98] gives further methods for qubit commitment. Crpeau et al. [CS95] gives protocols for quantum oblivious mutual identification. Lo, Chau [LC98] have recently argued that quantum bit commitment and ideal quantum ....
G. Brassard, C. Crpeau, D. Mayers, L. Salvail, Defeating classical bit commitments with a quantum computer, (Online preprint quant-ph/9806031), (1998).
The Security of Quantum Bit Commitment Schemes - Brassard, Crepeau, Mayers.. Self-citation (Gilles Mayers Salvail) (Correct)
....in the basis of your choice. For a detailed description of these flawed quantum bit commitment schemes and how to break them, the reader is encouraged to consult a preliminary version of the full paper, currently available on the Los Alamos National Laboratory e Print quantum physics archive [6]. ....
Brassard, Gilles, Claude Cr epeau, Dominic Mayers and Louis Salvail, "Defeating classical bit commitments with a quantum computer", available as quant-ph/9806031 in the LANL e-Print archive at URL http://xxx.lanl.gov/archive/quant-ph, June 1998.
The Security of Quantum Bit Commitment Schemes - Brassard, Crépeau.. Self-citation (Gilles Cr'epeau Mayers Salvail) (Correct)
....in the basis of your choice. For a detailed description of these flawed quantum bit commitment schemes and how to break them, the reader is encouraged to consult a preliminary version of the full paper, currently available on the Los Alamos National Laboratory e Print quantum physics archive [6]. ....
Brassard, Gilles, Claude Cr' epeau, Dominic Mayers and Louis Salvail, "Defeating classical bit commitments with a quantum computer", available as quant-ph/9806031 in the LANL e-Print archive at URL http://xxx.lanl.gov/archive/quant-ph, June 1998.
Unconditionally Secure Quantum Bit Commitment Schemes - Dunkelman (2000) (Correct)
No context found.
G. Brassard, C. Cr'epeau, D. Mayers, L. Salvail, Defeating Classical Bit Commitments with a Quantum Computer, Los Alamos preprint archive quant-ph/9806031, May 1999.
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