{
  "annotation_id": "7cf1b8df-8745-4944-a174-44babcb6fe46",
  "date_created": "2026-03-02T18:02:00.161000Z",
  "date_modified": "2026-03-02T18:02:00.161000Z",
  "file_hash": "318cc0f257680daaa0a7476f3ecdc82beeac30cfe5dfdbc85f9180287a4ddfdc",
  "private": false,
  "record": {
    "abstract": "We consider the problem of secure key distribution among $n$ trustful agents:\nthe goal is to distribute an identical random bit-string among the $n$ agents\nover a noisy channel such that eavesdroppers learn little about it. We study\nthe general situation where the only resources required are secure bipartite\nkey distribution and authenticated classical communication. Accordingly,\nmultipartite quantum key distribution can be proven unconditionally secure by\nreducing the problem to the biparitite case and invoking the proof of security\nof bipartite quantum key distribution.",
    "arxiv_id": "quant-ph/0306118",
    "authors": [
      "Sudhir Kumar Singh",
      "R. Srikanth"
    ],
    "categories": [
      "quant-ph",
      "cs.CR"
    ],
    "title": "Unconditionally Secure Multipartite Quantum Key Distribution",
    "url": "https://arxiv.org/abs/quant-ph/0306118"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "75d4397d-cb82-498f-b4a8-d5992d56e77b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}