Physics – Quantum Physics
Scientific paper
1996-05-16
Physics
Quantum Physics
Replaced to give appropriate reference to D. Mayers' works and to fix a crucial bug in the original proof of the impossibility
Scientific paper
There had been well known claims of ``provably unbreakable'' quantum protocols for bit commitment and coin tossing. However, we, and independently Mayers, showed that all proposed quantum bit commitment (and therefore coin tossing) schemes are, in principle, insecure because the sender, Alice, can always cheat successfully by using an EPR-type of attack and delaying her measurements. One might wonder if secure quantum bit commitment and coin tossing protocols exist at all. Here we prove that an EPR-type of attack by Alice will, in principle, break {\em any} realistic quantum bit commitment and {\em ideal} coin tossing scheme. Therefore, provided that Alice has a quantum computer and is capable of storing quantum signals for an arbitrary length of time, all those schemes are insecure. Since bit commitment and coin tossing are useful primitives for building up more sophisticated protocols such as zero-knowledge proofs, our results cast very serious doubt on the security of quantum cryptography in the so-called ``post-cold-war'' applications.
Chau H. F.
Lo Hoi-Kwong
No associations
LandOfFree
Why quantum bit commitment and ideal quantum coin tossing are impossible 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 Why quantum bit commitment and ideal quantum coin tossing are impossible, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Why quantum bit commitment and ideal quantum coin tossing are impossible will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-147052