Defeating classical bit commitments with a quantum computer

Simple item page
dc.creatorBrassard, Gilles
dc.creatorCrépeau, Claude
dc.creatorMayers, Dominic
dc.creatorSalvail, Louis
dc.date1998-06-09
dc.date.accessioned2026-07-07T06:15:11Z
dc.date.available2026-07-07T06:15:11Z
dc.descriptionIt 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.
dc.description13 pages. Supersedes quant-ph/9712023
dc.identifierhttps://arxiv.org/abs/quant-ph/9806031
dc.identifierhttp://arxiv.org/abs/quant-ph/9806031
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93722
dc.subjectQuantum Physics
dc.titleDefeating classical bit commitments with a quantum computer
dc.typetext

Files

Collections

arXiv