{
  "annotation_id": "7f63c8be-56af-42eb-948b-08c6cd1d23c1",
  "date_created": "2026-02-17T05:53:20.289000Z",
  "date_modified": "2026-02-17T05:53:20.289000Z",
  "file_hash": "31abd14f55b01425ba5531a3ec974accdc5190abd1fbda4cbd3f87933e5c3e50",
  "private": false,
  "record": {
    "abstract": "We generalize secret-sharing models that rely on correlated randomness and public communication, originally designed for a fixed access structure, to support a sequence of dynamic access structures, which we term an Additive Access Structure. Specifically, the access structure is allowed to monotonically grow by having any subset of participants added to it at a given time step, and the dealer only learns of these changes to the access structure on the time step that they occur. For this model, we prove the existence of a secret sharing strategy that achieves the same secret rate at each time step as the best known strategy for the fixed access structure version of this model. We also prove that there exists a strategy that is capacity-achieving at any time step where the access structure is a threshold access structure.",
    "arxiv_id": "2601.09640",
    "authors": [
      "David Miller",
      "R\u00e9mi A. Chou"
    ],
    "categories": [
      "cs.IT",
      "math.IT"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Secret sharing with additive access structures from correlated random variables",
    "url": "https://arxiv.org/abs/2601.09640",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "5660c8e9-465a-4d94-b6ab-9924778cc977",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}