Mochon, Carlos (2004) Serial composition of quantum coin flipping and bounds on cheat detection for bit commitment. Physical Review A, 70 (3). Art. No. 032312. ISSN 1050-2947. http://resolver.caltech.edu/CaltechAUTHORS:MOCpra04b
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:MOCpra04b
Quantum protocols for coin flipping can be composed in series in such a way that a cheating party gains no extra advantage from using entanglement between different rounds. This composition principle applies to coin-flipping protocols with cheat sensitivity as well, and is used to derive two results: There are no quantum strong coin-flipping protocols with cheat sensitivity that is linear in the bias (or bit-commitment protocols with linear cheat detection) because these can be composed to produce strong coin flipping with arbitrarily small bias. On the other hand, it appears that quadratic cheat detection cannot be composed in series to obtain even weak coin flipping with arbitrarily small bias.
|Additional Information:||©2004 The American Physical Society (Received 4 April 2004; published 17 September 2004) The author would like to thank John Preskill, Michael Ben-Or, Rob Spekkens, and Ben Toner. This work was supported in part by the National Science Foundation under Grant No. EIA-0086038 and by the U.S. Department of Energy under Grant No. DE-FG03-92-ER40701.|
|Subject Keywords:||quantum entanglement; quantum cryptography; information theory|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||18 Jul 2006|
|Last Modified:||26 Dec 2012 08:56|
Repository Staff Only: item control page