{
  "annotation_id": "c945bebc-7c55-487f-be90-27047576a2f9",
  "date_created": "2026-03-02T18:01:49.224000Z",
  "date_modified": "2026-03-02T18:01:49.224000Z",
  "file_hash": "b6c1b8d0c99147cfdbf34d51beb5bbe4af799108a06dcefc29fea842b4d33b21",
  "private": false,
  "record": {
    "abstract": "Entanglement purification provides a unifying framework for proving the\nsecurity of quantum key distribution schemes. Nonetheless, up till now, a local\ncommutability constraint in the CSS code construction means that the error\ncorrection and privacy amplification procedures of BB84 are not fully\ndecoupled. Here, I provide a method to decouple the two processes completely.\nThe method requires Alice and Bob to share some initial secret string and use\nit to encrypt the bit-flip error syndrome using one-time-pad encryption. As an\napplication, I prove the unconditional security of the interactive Cascade\nprotocol, proposed by Brassard and Salvail for error correction, modified by\none-time-pad encryption of the error syndrome, and followed by the random\nmatrix protocol for privacy amplification. This is an efficient protocol in\nterms of both computational power and key generation rate.",
    "arxiv_id": "quant-ph/0201030",
    "authors": [
      "Hoi-Kwong Lo"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/1367-2630/5/1/336",
    "journal_ref": "New Journal of Physics 5, 36 (2003).",
    "title": "Method for decoupling error correction from privacy amplification",
    "url": "https://arxiv.org/abs/quant-ph/0201030"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ea39b86e-5340-4db2-a9ad-20762ac4d34d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}