{
  "id": "quant-ph/0206123",
  "version": "v1",
  "published": "2002-06-19T03:23:01.000Z",
  "updated": "2002-06-19T03:23:01.000Z",
  "title": "On bit-commitment based quantum coin flipping",
  "authors": [
    "Ashwin Nayak",
    "Peter Shor"
  ],
  "comment": "The lower bound shown in this paper is superceded by a result of Kitaev (personal communication, 2001)",
  "doi": "10.1103/PhysRevA.67.012304",
  "categories": [
    "quant-ph"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2002-06-19T03:23:01.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "quantum coin flipping",
      "bit-commitment",
      "cleverer proof technique",
      "special framework",
      "intricate cheating strategy"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "publisher": "APS",
      "journal": "Phys. Rev. A"
    },
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}