The role of permutation coding in minimum-distortion perfect counterforensics
|Title:||The role of permutation coding in minimum-distortion perfect counterforensics||Authors:||Balado, Félix||Permanent link:||http://hdl.handle.net/10197/5565||Date:||May-2014||Abstract:||This paper exploits the connection between minimum-distortion perfect counterforensics and maximum-rate perfect steganography in order to provide the optimum solution to the first of these problems, in the case in which the forensic detector solely uses first order statistics. The solution relies on Slepian’s variant I permutation codes, which had previously been shown to implement maximum rate perfect steganography when the host is memoryless (equivalently, when the steganographic detector only uses first-order statistics). Additionally, we demonstrate a blind counterforensic strategy made possible by permutation decoding, which may also find application in image processing.||Funding Details:||Science Foundation Ireland||Type of material:||Conference Publication||Publisher:||IEEE||Copyright (published version):||2014 IEEE||Keywords:||Counterforensics; Steganography; Permutation coding; Histogram-based forensics; Histogram specification||Language:||en||Status of Item:||Peer reviewed||Conference Details:||39th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), May, 2014|
|Appears in Collections:||Computer Science Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.