Defeating classical bit commitments with a quantum computer

Details Defeating classical bit commitments with a quantum computer Defeating classical bit commitments with a quantum computer

1998-06-09

arxiv.org/abs/quant-ph/9806031v1

Physics

Quantum Physics

13 pages. Supersedes quant-ph/9712023

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Defeating classical bit commitments with a quantum computer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Defeating classical bit commitments with a quantum computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Defeating classical bit commitments with a quantum computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-631285