{
  "annotation_id": "c029f4e1-b38e-45cc-9457-9aa7f589deb4",
  "date_created": "2026-03-02T18:02:48.363000Z",
  "date_modified": "2026-03-02T18:02:48.363000Z",
  "file_hash": "58a03abf37ac7f3ebeb523af5154626d311ac469631e18a16c83a125c27e8009",
  "private": false,
  "record": {
    "abstract": "If mutually mistrustful parties A and B control two or more appropriately\nlocated sites, special relativity can be used to guarantee that a pair of\nmessages exchanged by A and B are independent. In earlier work, we used this\nfact to define a relativistic bit commitment protocol, RBC1, in which security\nis maintained by exchanging a sequence of messages whose transmission rate\nincreases exponentially in time. We define here a new relativistic protocol,\nRBC2, which requires only a constant transmission rate and could be practically\nimplemented. We prove that RBC2 allows a bit commitment to be indefinitely\nmaintained with unconditional security against all classical attacks. We\nexamine its security against quantum attacks, and show that it is immune from\nthe class of attacks shown by Mayers and Lo-Chau to render non-relativistic\nquantum bit commitment protocols insecure.",
    "arxiv_id": "quant-ph/9906103",
    "authors": [
      "Adrian Kent"
    ],
    "categories": [
      "quant-ph",
      "cs.CR"
    ],
    "journal_ref": "J.Cryptolog. 18 (2005) 313-335",
    "title": "Secure Classical Bit Commitment using Fixed Capacity Communication   Channels",
    "url": "https://arxiv.org/abs/quant-ph/9906103"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "3dcfa92b-eeea-4e7c-843a-d97a93e8319e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}