{
  "annotation_id": "d2216dc0-5ad5-4495-8ec9-0585d6aedd28",
  "date_created": "2026-03-02T18:01:52.611000Z",
  "date_modified": "2026-03-02T18:01:52.611000Z",
  "file_hash": "a13d4beb7103590234608265850a99ca1b86c55f7cf692c0ba4258a59f940e50",
  "private": false,
  "record": {
    "abstract": "This paper addresses the controversy between Mayers, Lo and Chau on one side,\nand Yuen on the opposite side, on whether there exist or not unconditionally\nsecure protocols. For such purpose, a complete classification of all possible\nbit commitment protocols is given, including all possible cheating attacks. For\nthe simplest class of protocols (non-aborting and with complete and perfect\nverification), it is shown how naturally a game-theoretical situation arises.\nFor these protocols, bounds for the cheating probabilities are derived, which\nturn out to be different from those given in the impossibility proof. The whole\nclassification and analysis has been carried out using a \"finite open system\"\napproach. The discrepancy with the impossibility proof is explained on the\nbasis of the implicit adoption of a \"closed system approach\"--equivalent to\nmodeling the commitment as performed by two fixed machines interacting\nunitarily in a overall \"closed system\". However, it is shown that the closed\nsystem approach for the classification of commitment protocols unavoidably\nleads to infinite dimensions, which then invalidate the continuity argument at\nthe basis of the impossibility proof.",
    "arxiv_id": "quant-ph/0209150",
    "authors": [
      "Giacomo Mauro D\u0027Ariano"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "The quantum bit commitment: a complete classification of protocols",
    "url": "https://arxiv.org/abs/quant-ph/0209150"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "877fe1f6-57c9-4956-843a-c91b3d8a72a8",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}