{
  "abstract": "We study a discrete memoryless two-way wiretap channel under strong one-sided secrecy, where User 1's message is confidential and User 2's message is not required to be secret. We develop non-adaptive and key-assisted adaptive inner bounds from a common resolvability estimate for selected index components. For the adaptive construction, we prove a multiround leakage theorem that accounts both for information revealed about a key before its later use and for the possibility that an encoder uses an incorrectly decoded key. The proof includes an ideal-to-implemented coupling, deterministic codebook selection, and a growing-round argument that removes the initialization-rate loss. We eliminate the internal component rates exactly and characterize the adaptive gain at each fixed auxiliary distribution. For an open two-parameter family of binary channels, we also prove a converse for arbitrary non-adaptive stochastic codes and obtain an operational adaptive-versus-non-adaptive separation. For one representative channel, the complete non-adaptive strong one-sided secrecy capacity region is identified exactly.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.13832",
  "author_total": 2,
  "authors": [
    {
      "name": "Masahito Hayashi"
    },
    {
      "name": "Yanling Chen"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/6szgq4tsa099d.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.13832",
  "fulltext_url": null,
  "id": "6szgq4tsa099d",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.13832",
  "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",
      "2208|Wireless Communication Security Techniques"
    ]
  ],
  "openalex": "W7213366784",
  "pdf_url": "https://arxiv.org/pdf/2609.13832",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-12",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/6szgq4tsa099d.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:21:29Z",
      "native_id": "2609.13832",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.13832"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    }
  ],
  "title": "Adaptive Coding for Two-Way Wiretap Channels with One-Sided Strong Secrecy",
  "title_text": "Adaptive Coding for Two-Way Wiretap Channels with One-Sided Strong Secrecy",
  "type": "preprint",
  "updated_at": "2026-10-30T12:21:29Z",
  "url": "https://research.draconitic.com/paper/6szgq4tsa099d",
  "venue": "arXiv",
  "versions": []
}