A Caltech Library Service

On Bit-Commitment Based Quantum Coin Flipping

Nayak, Ashwin and Shor, Peter (2002) On Bit-Commitment Based Quantum Coin Flipping. California Institute of Technology , Pasadena, CA. (Unpublished)

Postscript - Submitted Version
See Usage Policy.

PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


In this paper, we focus on a special framework for quantum coin flipping protocols, bit-commitment based protocols, within which almost all known protocols fit. We show a lower bound of 1/16 for the bias in any such protocol. We also analyse a sequence of multi-round protocol that tries to overcome the drawbacks of the previously proposed protocols, in order to lower the bias. We show an intricate cheating strategy for this sequence, which leads to a bias of 1/4. This indicates that a bias of 1/4 might be optimal in such protocols, and also demonstrates that a cleverer proof technique may be required to show this optimality.

Item Type:Report or Paper (Technical Report)
Additional Information:© 2002 California Institute of Technology. A. N. was supported by Charles Lee Powell Foundation and NSF grants CCR 0049092 and EIA 0086038. Part of this work was done while this author was at DIMACS Center, Rutgers University, and AT&T Labs, and was supported by NSF grants STC 91-19999, CCR 99-06105 and EIA 00-80234.
Group:Computer Science Technical Reports
Funding AgencyGrant Number
Charles Lee Powell FoundationUNSPECIFIED
Subject Keywords:coin flipping, bit commitment, quantum cryptography
Record Number:CaltechCSTR:2002.004
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26927
Deposited By: Imported from CaltechCSTR
Deposited On:23 Apr 2002
Last Modified:07 Mar 2017 15:53

Repository Staff Only: item control page