{
  "annotation_id": "d96f9dfa-84cf-4124-af9b-a92a12b60572",
  "date_created": "2026-03-02T18:02:41.048000Z",
  "date_modified": "2026-03-02T18:02:41.048000Z",
  "file_hash": "cd0db9ff80b0d2b699b232828fa9c1e246864c05bea262c04b57dc1783be55b1",
  "private": false,
  "record": {
    "abstract": "The desire to obtain an unconditionally secure bit commitment protocol in\nquantum cryptography was expressed for the first time thirteen years ago. Bit\ncommitment is sufficient in quantum cryptography to realize a variety of\napplications with unconditional security. In 1993, a quantum bit commitment\nprotocol was proposed together with a security proof. However, a basic flaw in\nthe protocol was discovered by Mayers in 1995 and subsequently by Lo and Chau.\nLater the result was generalized by Mayers who showed that unconditionally\nsecure bit commitment is impossible. A brief review on quantum bit commitment\nwhich focuses on the general impossibility theorem and on recent attempts to\nbypass this result is provided.",
    "arxiv_id": "quant-ph/9712023",
    "authors": [
      "Gilles Brassard",
      "Claude Cr\u00e9peau",
      "Dominic Mayers",
      "Louis Salvail"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A brief review on the impossibility of quantum bit commitment",
    "url": "https://arxiv.org/abs/quant-ph/9712023"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "43c1e760-7984-4b7d-a3bc-941103e842fc",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}