CaltechAUTHORS
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 . (Unpublished) http://resolver.caltech.edu/CaltechCSTR:2002.004

 Preview
Postscript
See Usage Policy.

338Kb
 Preview
PDF
See Usage Policy.

260Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechCSTR:2002.004

## Abstract

In this paper, we focus on a special framework for quantum coin flipping protocols, {\em 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) Computer Science Technical Reports coin flipping, bit commitment, quantum cryptography CaltechCSTR:2002.004 http://resolver.caltech.edu/CaltechCSTR:2002.004 You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format. 26927 CaltechCSTR Imported from CaltechCSTR 23 Apr 2002 26 Dec 2012 14:09

Repository Staff Only: item control page