https://arxiv.org/abs/2210.14889

Skip to main content
Cornell University
We gratefully acknowledge support from
the Simons Foundation and member institutions.
 
arxiv logo > cs > arXiv:2210.14889
[                    ]

Help | Advanced Search

[All fields        ]
Search
arXiv logo
Cornell University Logo
[                    ] GO
quick links

  * Login
  * Help Pages
  * About

Computer Science > Cryptography and Security

arXiv:2210.14889 (cs)
[Submitted on 24 Oct 2022 (v1), last revised 11 Apr 2023 (this
version, v3)]

Title:Perfectly Secure Steganography Using Minimum Entropy Coupling

Authors:Christian Schroeder de Witt, Samuel Sokota, J. Zico Kolter,
Jakob Foerster, Martin Strohmeier
Download a PDF of the paper titled Perfectly Secure Steganography
Using Minimum Entropy Coupling, by Christian Schroeder de Witt and 4
other authors
Download PDF

    Abstract: Steganography is the practice of encoding secret
    information into innocuous content in such a manner that an
    adversarial third party would not realize that there is hidden
    meaning. While this problem has classically been studied in
    security literature, recent advances in generative models have
    led to a shared interest among security and machine learning
    researchers in developing scalable steganography techniques. In
    this work, we show that a steganography procedure is perfectly
    secure under Cachin (1998)'s information theoretic-model of
    steganography if and only if it is induced by a coupling.
    Furthermore, we show that, among perfectly secure procedures, a
    procedure is maximally efficient if and only if it is induced by
    a minimum entropy coupling. These insights yield what are, to the
    best of our knowledge, the first steganography algorithms to
    achieve perfect security guarantees with non-trivial efficiency;
    additionally, these algorithms are highly scalable. To provide
    empirical validation, we compare a minimum entropy coupling-based
    approach to three modern baselines -- arithmetic coding, Meteor,
    and adaptive dynamic grouping -- using GPT-2, WaveRNN, and Image
    Transformer as communication channels. We find that the minimum
    entropy coupling-based approach achieves superior encoding
    efficiency, despite its stronger security constraints. In
    aggregate, these results suggest that it may be natural to view
    information-theoretic steganography through the lens of minimum
    entropy coupling.

Subjects: Cryptography and Security (cs.CR); Artificial Intelligence
          (cs.AI); Multimedia (cs.MM)
Cite as:  arXiv:2210.14889 [cs.CR]
          (or arXiv:2210.14889v3 [cs.CR] for this version)
          https://doi.org/10.48550/arXiv.2210.14889
          Focus to learn more
          arXiv-issued DOI via DataCite

Submission history

From: Samuel Sokota [view email]
[v1] Mon, 24 Oct 2022 17:40:07 UTC (512 KB)
[v2] Mon, 6 Mar 2023 11:50:26 UTC (544 KB)
[v3] Tue, 11 Apr 2023 19:41:09 UTC (547 KB)
Full-text links:

Download:

  * Download a PDF of the paper titled Perfectly Secure Steganography
    Using Minimum Entropy Coupling, by Christian Schroeder de Witt
    and 4 other authors
    PDF
  * Other formats

[by-nc-nd-4]
Current browse context:
cs.CR
< prev   |   next >
new | recent | 2210
Change to browse by:
cs
cs.AI
cs.MM

References & Citations

  * NASA ADS
  * Google Scholar
  * Semantic Scholar

1 blog link

(what is this?)
a export BibTeX citation Loading...

BibTeX formatted citation

x
[loading...          ]
Data provided by:

Bookmark

BibSonomy logo Mendeley logo Reddit logo ScienceWISE logo
(*) Bibliographic Tools

Bibliographic and Citation Tools

[ ] Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
[ ] Litmaps Toggle
Litmaps (What is Litmaps?)
[ ] scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
( ) Code, Data, Media

Code, Data and Media Associated with this Article

[ ] DagsHub Toggle
DagsHub (What is DagsHub?)
[ ] Links to Code Toggle
Papers with Code (What is Papers with Code?)
[ ] ScienceCast Toggle
ScienceCast (What is ScienceCast?)
( ) Demos

Demos

[ ] Replicate Toggle
Replicate (What is Replicate?)
[ ] Spaces Toggle
Hugging Face Spaces (What is Spaces?)
( ) Related Papers

Recommenders and Search Tools

[ ] Link to Influence Flower
Influence Flower (What are Influence Flowers?)
[ ] Connected Papers Toggle
Connected Papers (What is Connected Papers?)
[ ] Core recommender toggle
CORE Recommender (What is CORE?)

  * Author
  * Venue
  * Institution
  * Topic

( ) About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and
share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have
embraced and accepted our values of openness, community, excellence,
and user data privacy. arXiv is committed to these values and only
works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community?
Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is
MathJax?)

  * About
  * Help

  * Click here to contact arXiv Contact
  * Click here to subscribe Subscribe

  * Copyright
  * Privacy Policy

  * Web Accessibility Assistance
  * arXiv Operational Status
    Get status notifications via email or slack