{
  "annotation_id": "db35e4da-df69-433e-8a7f-b23c9290bdc8",
  "date_created": "2026-03-02T18:02:23.821000Z",
  "date_modified": "2026-03-02T18:02:23.821000Z",
  "file_hash": "af21e30ff85ebc623e332f6da0002915d2871161bf1dd82199c1bbd8944281c4",
  "private": false,
  "record": {
    "abstract": "The impossibility proof of unconditionally secure quantum bit commitment is\ncrucially dependent on the assertion that Bob is not allowed to generate\nprobability distributions unknown to Alice. This assertion is actually not\nmeaningful, because Bob can always cheat without being detected. In this paper\nwe prove that, for any concealing protocol involving secret probability\ndistributions, there exists a cheating unitary transformation that is known to\nAlice. Our result closes a gap in the original impossibility proof.",
    "arxiv_id": "quant-ph/0601206",
    "authors": [
      "Chi-Yee Cheung"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1142/S0217979207045517",
    "title": "Insecurity of Quantum Bit Commitment with Secret Parameters",
    "url": "https://arxiv.org/abs/quant-ph/0601206"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "536a8981-ca55-4a70-b84e-ed0caa28f13b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}