{
  "id": "minimum-entropy-coupling",
  "title": "Perfectly Secure Steganography Using Minimum Entropy Coupling",
  "authors": [
    "Christian Schroeder de Witt",
    "Samuel Sokota",
    "J. Zico Kolter",
    "Jakob Foerster",
    "Martin Strohmeier"
  ],
  "author_parts": [
    {
      "given": "Christian",
      "family": "Schroeder de Witt"
    },
    {
      "given": "Samuel",
      "family": "Sokota"
    },
    {
      "given": "J. Zico",
      "family": "Kolter"
    },
    {
      "given": "Jakob",
      "family": "Foerster"
    },
    {
      "given": "Martin",
      "family": "Strohmeier"
    }
  ],
  "equal_contribution": [
    "Christian Schroeder de Witt",
    "Samuel Sokota"
  ],
  "year": 2023,
  "venue_date": "2023",
  "venue": "International Conference on Learning Representations",
  "venue_short": "ICLR 2023",
  "publication_type": "conference",
  "publisher": null,
  "doi": null,
  "arxiv_id": "2210.14889",
  "relation": "related",
  "categories": [
    "Statistical security",
    "Minimum entropy coupling"
  ],
  "summary": "Characterizes perfect steganographic security through couplings and maximal information throughput through minimum entropy couplings under its information-theoretic model. It develops an iterative method and compares it with arithmetic coding, Meteor, and adaptive dynamic grouping on text, audio, and image-model distributions.",
  "relationship": "Explicitly cites and evaluates the 2019 arithmetic-coding implementation as a baseline, while proposing a different coupling-based construction with a different security guarantee.",
  "limitation": "The guarantee assumes a passive adversary, unmodified transmission, and access to the cover distribution; matching a model does not establish that it exactly models real-world communication.",
  "sources": [
    {
      "url": "https://arxiv.org/abs/2210.14889",
      "evidence": "Full authors and first submission October 24, 2022; version history retained separately from ICLR year."
    },
    {
      "url": "https://arxiv.org/pdf/2210.14889",
      "evidence": "Title page identifies ICLR 2023 and equal contributions; sections 3–5 give coupling characterization and 2019 baseline; section 7 states assumptions/limitations; section 8 links code."
    },
    {
      "url": "https://iclr.cc/virtual/2023/poster/11490",
      "evidence": "Official ICLR 2023 poster record verifies title/authors and directly links the OpenReview forum HQ67mj5rJdR."
    }
  ],
  "arxiv_url": "https://arxiv.org/abs/2210.14889",
  "earliest_date": "2022-10-24",
  "earliest_date_label": "First arXiv submission",
  "url": "https://openreview.net/forum?id=HQ67mj5rJdR",
  "pdf": "https://arxiv.org/pdf/2210.14889",
  "code": "https://github.com/schroederdewitt/perfectly-secure-steganography",
  "category": "security",
  "contribution": "Characterizes perfect steganographic security through couplings and maximal information throughput through minimum entropy couplings under its information-theoretic model. It develops an iterative method and compares it with arithmetic coding, Meteor, and adaptive dynamic grouping on text, audio, and image-model distributions.",
  "canonical_url": "https://steganography.live/reading-list/papers/minimum-entropy-coupling/"
}