Abstract
The problems of batch steganography and pooled steganalysis, proposed in , generalize the problems of hiding and detecting hidden data to multiple covers. It was conjectured that, given covers of uniform capacity and a quantitative steganalysis method satisfying certain assumptions, "secure" steganographic capacity is proportional only to the square root of the number of covers. We now prove that, with respect to a natural definition of secure capacity, and in a suitably asymptotic sense, this conjecture is true. This is in sharp contrast to capacity results for noisy channels.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
