Towards geometrically robust data-hiding with structured codebooks

In this paper we analyze performance of practical robust data-hiding in channels with geometrical transformations. By applying information-theoretic argument we show that performance of a system designed based on both random coding and random binning principles is bounded by the same maximal achievable rate for the cases when communication channel includes geometrical transformations or not. Targeting to provide theoretic performance limits of practical robust data-hiding we model it using a multiple access channel (MAC) with side information (SI) available at one of encoders and present the bounds on achievable rates of reliable communications to such a protocol. Finally, considering template-based and redundant-based design of geometrically robust data-hiding systems, we perform security analysis of their performance and present results in terms of number of trial efforts the attacker needs to completely remove hidden information.