Security and distribution matching
Perfectly Secure Steganography Using Minimum Entropy Coupling
* Christian Schroeder de Witt and Samuel Sokota contributed equally.
First arXiv submission: · ICLR 2023
Published version: 2023. The publication and preprint records below retain their own dates and identifiers.
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 to Neural Linguistic Steganography
Explicitly cites and evaluates the 2019 arithmetic-coding implementation as a baseline, while proposing a different coupling-based construction with a different security guarantee.
Scope and limitations
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.
Cite this paper
Published version
Christian Schroeder de Witt, Samuel Sokota, J. Zico Kolter, Jakob Foerster, Martin Strohmeier. Perfectly Secure Steganography Using Minimum Entropy Coupling. International Conference on Learning Representations, 2023
Published version BibTeX · Published version CSL-JSON
Show BibTeX
@inproceedings{minimum-entropy-coupling-publication,
title = {{Perfectly Secure Steganography Using Minimum Entropy Coupling}},
author = {Schroeder de Witt, Christian and Sokota, Samuel and Kolter, J. Zico and Foerster, Jakob and Strohmeier, Martin},
year = {2023},
booktitle = {International Conference on Learning Representations},
url = {https://openreview.net/forum?id=HQ67mj5rJdR}
}
arXiv preprint
Christian Schroeder de Witt, Samuel Sokota, J. Zico Kolter, Jakob Foerster, Martin Strohmeier. Perfectly Secure Steganography Using Minimum Entropy Coupling. arXiv:2210.14889. First submission: October 24, 2022.
This citation records the first arXiv version and its original title. The version-specific link distinguishes it from later revisions; cite the version supporting your claim.
arXiv preprint BibTeX · arXiv preprint CSL-JSON
Show BibTeX
@misc{minimum-entropy-coupling-preprint,
title = {{Perfectly Secure Steganography Using Minimum Entropy Coupling}},
author = {Schroeder de Witt, Christian and Sokota, Samuel and Kolter, J. Zico and Foerster, Jakob and Strohmeier, Martin},
year = {2022},
publisher = {arXiv},
eprint = {2210.14889v1},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2210.14889v1}
}
Primary sources
- Full authors and first submission October 24, 2022; version history retained separately from ICLR year.
- 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.
- Official ICLR 2023 poster record verifies title/authors and directly links the OpenReview forum HQ67mj5rJdR.
Read or reuse this entry
JSON record · Markdown · Find in the full list
These notes are an editorial reading aid. Consult the primary sources for the authors’ claims, assumptions, and experiments.