Welcome to the InfoSci Platform
Reference Hub7
Locally Square Distortion and Batch Steganographic Capacity

Locally Square Distortion and Batch Steganographic Capacity

Andrew D. Ker
Copyright: © 2009 |Volume: 1 |Issue: 1 |Pages: 16
ISSN: 1941-6210|EISSN: 1941-6229|ISSN: 1941-6210|EISBN13: 9781615202218|EISSN: 1941-6229|DOI: 10.4018/jdcf.2009010102
Cite Article Cite Article

MLA

Ker, Andrew D. "Locally Square Distortion and Batch Steganographic Capacity." IJDCF vol.1, no.1 2009: pp.29-44. http://doi.org/10.4018/jdcf.2009010102

APA

Ker, A. D. (2009). Locally Square Distortion and Batch Steganographic Capacity. International Journal of Digital Crime and Forensics (IJDCF), 1(1), 29-44. http://doi.org/10.4018/jdcf.2009010102

Chicago

Ker, Andrew D. "Locally Square Distortion and Batch Steganographic Capacity," International Journal of Digital Crime and Forensics (IJDCF) 1, no.1: 29-44. http://doi.org/10.4018/jdcf.2009010102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

A fundamental question of the steganography problem is to determine the amount of data which can be hidden undetectably. Its answer is of direct importance to the embedder, but also aids a forensic investigator in bounding the size of payload which might be communicated. Recent results on the information theory of steganography suggest that the detectability of payload in an individual object is proportional to the square of the number of changes caused by the embedding. Here, we follow up the implications when a payload is to be spread amongst multiple cover objects, and give asymptotic results about the maximum secure payload. Two embedding scenarios are distinguished: embedding in a fixed finite batch of covers, and continuous embedding in an infinite stream. The steganographic capacity, as a function of the number of objects, is sublinear and strictly asymptotically lower in the second case. This work consolidates and extends our previous results on batch and sequential steganographic capacity.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.