Defeating classical bit commitments with a quantum computer
Quantum Physics
2007-05-23 v1
Abstract
It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be obtained by forcing the cheater to perform a measurement. Similar situations had been encountered previously in the design of Quantum Oblivious Transfer. The question is whether a classical bit commitment could be used for this specific purpose. We demonstrate that, surprisingly, classical unconditionally concealing bit commitments do not help.
Cite
@article{arxiv.quant-ph/9806031,
title = {Defeating classical bit commitments with a quantum computer},
author = {Gilles Brassard and Claude Crépeau and Dominic Mayers and Louis Salvail},
journal= {arXiv preprint arXiv:quant-ph/9806031},
year = {2007}
}
Comments
13 pages. Supersedes quant-ph/9712023