Self-synchronized message randomization methods for subliminal channels
The authors consider message randomization methods for subliminal channels. In many applications of subliminal channels, both self-synchronization and (practical) indistinguishability are required. However there are few methods to satisfy both. Therefore, they consider the structure to satisfy both (practical) indistinguishability and self-synchronization, and then design some pairs of converters and deconverters. The converters can transform any message sequences into practically indistinguishable random number sequences, and the output sequences do not make any cycles because of the nondeterministic input. The deconverters can decode the message sequences from anywhere of the converted sequences. In order to distinguish the converted sequences from real or well-designed random number sequences, either the encryption function has to be broken or \(O(|{\mathcal T}|^{n/2})\) symbols (for the set \({\mathcal T}\) of transmitted symbols) have to be observed under the situation that the \(i\)th block of the message sequence \(m_i\) is fixed for every \(i\). For the entire collection see [Zbl 0877.00018].
This page was built for publication: Self-synchronized message randomization methods for subliminal channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373645)
