{
  "annotation_id": "f3aa1e37-1b3c-472e-ac9e-de7419a7179c",
  "date_created": "2026-03-02T18:01:52.673000Z",
  "date_modified": "2026-03-02T18:01:52.673000Z",
  "file_hash": "a6c134f3f2df0ad0aae11f65fce7ed801dfc3f6b8196638bece33f0305ed89f9",
  "private": false,
  "record": {
    "abstract": "It is generally believed that unconditionally secure quantum bit commitment\nis impossible, due to widespread acceptance of an impossibility proof that\nutilizes quantum entaglement cheating. In this paper, we delineate how the\nimpossibiliy proof formulation misses various types of quantum bit commitment\nprotocols based on two-way quantum communications. We point out some of the\ngaps in the impossibility proof reasoning, and present corresponding\ncounterexamples. Four different types of bit commitment protocols are\nconstructed with several new protocol techniques. A specific Type 4 protocol is\ndescribed and proved unconditionally secure. Security analysis of a Type 1\nprotocol and a Type 2 protocol are also sketched. The security of Type 3\nprotocols is as yet open. A development of quantum statistical decision theory\nand quantum games is needed to provie a complete security analysis of many such\nprotocols.",
    "arxiv_id": "quant-ph/0207089",
    "authors": [
      "Horace P. Yuen"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum bit commitment and unconditional security",
    "url": "https://arxiv.org/abs/quant-ph/0207089"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "14ad21c3-99a4-4eef-86ef-a11224c88094",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}