Estevez Tapiador, Juan and Hernandez-Castro, Julio C. and Alcaide, Almudena and Ribagorda, Arturo (2008) On the Distinguishability of Distance-Bounded Permutations in Ordered Channels. IEEE Transactions on Information Forensics and Security, 3 (2). pp. 166-172. ISSN 1556-6013.
Restricted to Repository staff only
| Contact us about this Publication
Ordered channels, such as those provided by Internet protocol and transmission control protocol protocols, rely on sequence numbers to recover from packet reordering due to network dynamics. The existence of covert channels in any ordered channel is a well-known fact: Two parties can reorder the elements (packets) to be sent according to some predefined code. Schemes based on distance-bounded permutations have been proposed for steganographic communication with the aim of keeping and controling the increase of latency due to reordering. In this paper, we demonstrate that distance-bounded permutations are highly anomalous from a metric point of view. Our analysis is based on the study of the distribution of distances between normal permutations generated by the channel, and those produced when embedding hidden information. We provide results for four different distances: Kendall's τ, Spearman's ρ, Spearman's footrule, and Levenshtein's distance (which is equivalent to Ulam's distance for permutations). In all cases, it is shown how sequences with hidden information can be separated from the normal ones. As a result, very accurate and efficient distinguishers can be easily constructed. Finally, we study the detection capabilities of the associated detectors through a receiver operating characteristic analysis.
|Uncontrolled keywords:||Distances on permutations; Ordered channels; Steganalysis; Steganography|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Security Group|
|Depositing User:||Julio Hernandez-Castro|
|Date Deposited:||24 Oct 2012 13:34|
|Last Modified:||18 Mar 2013 16:16|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/31957 (The current URI for this page, for reference purposes)|
- Depositors only (login required):