<?xml version="1.0"?>
                <!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "journalpublishing3.dtd">
                <article article-type="research-article" xmlns:mml="http://www.w3.org/1998/Math/MathML"
                xmlns:xlink="http://www.w3.org/1999/xlink"
                xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
                dtd-version="3.0">
                <front>
                    <journal-meta>
                    <journal-id journal-id-type="publisher-id">ei</journal-id>
                    <journal-title>Electronic Imaging</journal-title>
                    <issn pub-type="ppub">2470-1173</issn><issn pub-type="epub">2470-1173</issn>
                    <publisher>
                        <publisher-name>Society for Imaging Science and Technology</publisher-name>
                        <publisher-loc>IS&amp;T 7003 Kilworth Lane, Springfield, VA 22151 USA</publisher-loc>
                    </publisher>
                    </journal-meta>
                    <article-meta>
                    <article-id pub-id-type="doi">10.2352/EI.2024.36.4.MWSF-337</article-id>
                    <article-id pub-id-type="publisher-id">MWSF-337</article-id>
                    <article-categories>
                        <subj-group>
                        <subject>Proceedings</subject>
                        </subj-group>
                    </article-categories>
                    <title-group>
                        <article-title>Secure Payload Scaling For Source Adaptive Payload Allocation</article-title>
                    </title-group><contrib-group content-type="all"><contrib contrib-type="author"><name>
                            <surname>Dworetzky</surname>
                            <given-names>Eli </given-names>
                           </name> <xref ref-type="aff" rid="aff1author1"/></contrib><aff id="aff1author1">SUNY Binghamton, US</aff></contrib-group><contrib-group content-type="all"><contrib contrib-type="author"><name>
                            <surname>Kaziakhmedov</surname>
                            <given-names>Edgar </given-names>
                           </name> <xref ref-type="aff" rid="aff1author2"/></contrib><aff id="aff1author2">SUNY Binghamton, US</aff></contrib-group><contrib-group content-type="all"><contrib contrib-type="author"><name>
                            <surname>Fridrich</surname>
                            <given-names>Jessica </given-names>
                           </name> <xref ref-type="aff" rid="aff1author3"/></contrib><aff id="aff1author3">SUNY Binghamton, US</aff></contrib-group><abstract>
                    <title>Abstract</title>
                    <p>Assuming that Alice commits to an embedding method and the Warden to a detector, we study how much information Alice can communicate at a constant level of statistical detectability over potentially infinitely many uses of the stego channel. When Alice is allowed to allocate her payload across multiple cover objects, we find that certain payload allocation strategies that are informed by a steganography detector exhibit super-square root secure payload (scaling exponent 0.85) for at least tens of thousands of uses of the stego channel. We analyze our experiments with a source model of soft outputs of the detector across images and show how the model determines the scaling of the secure payload.</p>
                    </abstract><pub-date>
                        <day>21</day>
                        <month>1</month>
                        <year>2024</year>
                        </pub-date><volume>36</volume>
                    <issue-acronym>MWSF</issue-acronym>
                    <issue-title>Media Watermarking, Security, and Forensics 2024</issue-title>
                    <issue seq="337">4</issue>
                    <fpage>337-1</fpage>
                    <lpage>337-11</lpage>
                    <permissions>
                         <copyright-statement>© 2024, Society for Imaging Science and Technology</copyright-statement>
                        <copyright-year>2024</copyright-year>
                    </permissions><kwd-group><kwd>Batch Steganography</kwd><kwd>Deep Learning</kwd><kwd>Pooled Steganalysis</kwd><kwd>Square Root Law</kwd><kwd>Steganalysis</kwd><kwd>Steganography</kwd></kwd-group></article-meta>
                </front>
                </article>