How to (Possibly) Foil Multimedia Security?

Files in This Item:
File Description SizeFormat 
wio14.pdf195.71 kBAdobe PDFDownload
Title: How to (Possibly) Foil Multimedia Security?
Authors: Balado, Félix
Fournel, Thierry
Permanent link: http://hdl.handle.net/10197/5700
Date: 11-Jul-2014
Abstract: Multimedia security can be foiled thanks to Slepian’s permutation modulation. Originally proposed in 1965 for standard problems of channel and source coding in communications, permutation codes can also provide optimum solutions in two relevant fields: steganography (foiling hidden information detection tests) and counterforensics (foiling forensic detection tests). In the first scenario, permutation codes have been shown to implement optimum perfect universal steganography (that is to say, steganography with maximum information embedding rate, undetectable and only relying on the empirical distribution of the host) for histogram-based hidden information detectors. In the second scenario, permutation codes have been shown to implement minimum-distortion perfect counterforensics (that is to say, forgeries which are undetectable and as close as possible to a target forgery) for histogram-based forensic detectors. Interestingly, both of these developments have revealed connections with compression through theoretical bounds from the mathematical theory of information. In steganography, the long-acknowledged duality between perfect steganography and lossless compression has been made explicit by permutation coding. On the other hand, a connection between counterforensics, lossy compression and histogram specification is also shown.
Funding Details: Science Foundation Ireland
Type of material: Conference Publication
Publisher: IEEE
Copyright (published version): 2014 IEEE
Keywords: Multimedia security;Information security;Steganography;Counterforensics
DOI: 10.1109/WIO.2014.6933295
Language: en
Status of Item: Not peer reviewed
Conference Details: 2014 13th Workshop on Information Optics (WIO), Neuchâtel, Switzerland, 7-11 July, 2014
Appears in Collections:Computer Science Research Collection

Show full item record

Google ScholarTM

Check

Altmetric


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.