{
  "annotation_id": "3df2088d-70b0-4bdc-acd2-eea292db8bd6",
  "date_created": "2026-03-02T18:02:06.641000Z",
  "date_modified": "2026-03-02T18:02:06.641000Z",
  "file_hash": "bc0763932609e99613a37e15d9b8c8d22eb135790b99deedb2af4db0eb55baf2",
  "private": false,
  "record": {
    "abstract": "Game G: Clare passes a string s which is either from perfect random number\ngenerator R0 or from good imperfect number generator R1, with equal\nprobability. Alice\u0027s information about whether it is from R0 or R1 is bounded\nby small value h. Alice use s as the input random numbers for QKD protocol with\nBob. Suppose Eve may have very small information about the final key if s is\nfrom R0 and Eve has large information if s is from R1, then after the protocol,\nAlice announce the final key, Eve\u0027s information about whether s is from R0 or\nR1 is unreasonablly large, i.e., breaks the known bound, h. Explicit formulas\nare given in the article.",
    "arxiv_id": "quant-ph/0405182",
    "authors": [
      "Xiang-Bin Wang"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Perfect random number generator is unnecessary for secure quantum key   distribution",
    "url": "https://arxiv.org/abs/quant-ph/0405182"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "fc797b30-b16b-4981-b728-87ebd2726325",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}