{
  "annotation_id": "2d55c8ea-824e-403c-aa47-27f3912560f9",
  "date_created": "2026-03-02T18:01:39.315000Z",
  "date_modified": "2026-03-02T18:01:39.315000Z",
  "file_hash": "c42ac35cee8190500b2c941bd5b063f62afcadf4cc893e835035184325585d89",
  "private": false,
  "record": {
    "abstract": "Bit commitment involves the submission of evidence from one party to another\nso that the evidence can be used to confirm a later revealed bit value by the\nfirst party, while the second party cannot determine the bit value from the\nevidence alone. It is widely believed that secure quantum bit commitment is\nimpossible due to quantum entanglement cheating, which is codified in a general\nimpossibility theorem. In this paper, the scope of this general impossibility\nproof is extended and analyzed, and gaps are found. Three specific protocols\nare described for which the entanglement cheating as given in the impossibility\nproof fails to work. One of these protocols, QBC2, is proved to be\nunconditionally secure.",
    "arxiv_id": "quant-ph/0006109",
    "authors": [
      "Horace P. Yuen"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Unconditionally Secure Quantum Bit Commitment Is Possible",
    "url": "https://arxiv.org/abs/quant-ph/0006109"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0fac0a87-c05a-4ea9-8513-7c2bf4c269a4",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}