{
  "annotation_id": "ffccec82-9f0e-4bc7-9f49-2410d51cb9a1",
  "date_created": "2026-02-17T05:53:24.321000Z",
  "date_modified": "2026-02-17T05:53:24.321000Z",
  "file_hash": "718ea5f44351f5bbaa8d5f37b7c31e84d22aabf20d471167e9e89c108cf92a95",
  "private": false,
  "record": {
    "abstract": "This paper investigates the problem of leaky-private Private Information Retrieval with Side Information (L-PIR-SI), which relaxes the requirement of perfect privacy to achieve improved communication efficiency in the presence of side information. While the capacities of PIR-SI under both $W$-privacy and $(W,S)$-privacy have been partially explored, the impact of controlled information leakage in these settings remains unaddressed. We propose a unified probabilistic framework to construct L-PIR-SI schemes where the privacy leakage is quantified by a parameter $\\varepsilon$, consistent with differential privacy standards. We characterize the achievable download costs and show that our results generalize several landmark results in the PIR literature: they recover the capacity of PIR-SI when $\\varepsilon \\to 0$, and reduce to the known bounds for leaky-PIR when side information is absent. This work provides the first look at the trade-offs between leakage, side information, and retrieval efficiency.",
    "arxiv_id": "2601.09960",
    "authors": [
      "Yingying Huangfu",
      "Tian Bai"
    ],
    "categories": [
      "cs.IT",
      "math.IT"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "On the Leaky Private Information Retrieval with Side Information",
    "url": "https://arxiv.org/abs/2601.09960",
    "version": "v2"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "29899a45-b3f8-4a80-97e1-51c90cafa02e",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}