{
  "abstract": "We construct secure cyclic multi-access coded caching schemes by re-encoding the caches of a secure single-access scheme and reusing its multicast message unchanged. For a library of $N$ files, each of $K$ users reads $L<K$ consecutive shared caches and must recover its requested file while learning no information about the other files. Starting from a parent scheme with a cyclic representation of its cached symbols, the transformation lets each access window recover the corresponding parent-cache symbols and, conditioned on them, learn nothing about the remaining symbols. A deterministic Pascal-window encoder handles symbols whose consecutive appearances span at least $L$ users. A randomized complement-dual encoder handles shorter spans. Over a suitable finite field, these encoders attain the exact minimum per-block storage for every input length in the block-separable, parent-preserving class. Applying the transformation to two secure single-access schemes gives an achievable memory-rate family for $N,K\\ge2$ and $1\\le L<K$, including the exact rate-one cache size $(N-1)(K-1)/L$. Using converse bounds for arbitrary secure multi-access schemes, we prove approximation guarantees for the achievable family and give a proof of the exact $L=K-1$ tradeoff.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.05136",
  "author_total": 4,
  "authors": [
    {
      "name": "Han Fang"
    },
    {
      "name": "Qinyi Lu"
    },
    {
      "name": "Nan Liu"
    },
    {
      "name": "Wei Kang"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/3hqak4enxhb7f.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.05136",
  "fulltext_url": null,
  "id": "3hqak4enxhb7f",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.05136",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "math.IT"
    ],
    [
      "openalex",
      "1705|Caching and Content Delivery"
    ]
  ],
  "openalex": "W7220668261",
  "pdf_url": "https://arxiv.org/pdf/2610.05136",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-04",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/3hqak4enxhb7f.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:10Z",
      "native_id": "2610.05136",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.05136"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    }
  ],
  "title": "Secure Multi-Access Coded Caching: A Lifting Approach",
  "title_text": "Secure Multi-Access Coded Caching: A Lifting Approach",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:10Z",
  "url": "https://research.draconitic.com/paper/3hqak4enxhb7f",
  "venue": "arXiv",
  "versions": []
}