{
  "annotation_id": "013f3911-a132-4076-89d4-538a4150129b",
  "date_created": "2026-03-02T18:02:34.604000Z",
  "date_modified": "2026-03-02T18:02:34.604000Z",
  "file_hash": "028a899c2aba3185d78778874fcc06463d4c326ec6c10eb0bef2d1d23c0d8587",
  "private": false,
  "record": {
    "abstract": "We show that a biased quantum coin flip (QCF) cannot provide the performance\nof a black-boxed biased coin flip, if it satisfies some fidelity conditions.\nAlthough such a QCF satisfies the security conditions of a biased coin flip, it\ndoes not realize the ideal functionality, and therefore, does not fulfill the\ndemands for universally composable security. Moreover, through a comparison\nwithin a small restricted bias range, we show that an arbitrary QCF is\ndistinguishable from a black-boxed coin flip unless it is unbiased on both\nsides of parties against insensitive cheating. We also point out the difficulty\nin developing cheat-sensitive quantum bit commitment in terms of the\nuncomposability of a QCF.",
    "arxiv_id": "quant-ph/0703099",
    "authors": [
      "Satoshi Ishizaka"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.100.070501",
    "journal_ref": "Phys. Rev. Lett. 100, 070501 (2008)",
    "title": "Dilemma that cannot be resolved by biased quantum coin flipping",
    "url": "https://arxiv.org/abs/quant-ph/0703099"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2ba54ff5-6708-4ef9-879a-a414e01628d3",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}