Scientific article
OA Policy
English

Towards geometrically robust data-hiding with structured codebooks

Published inMultimedia systems, vol. 11, no. 2, p. 121-132
Publication date2005
Abstract

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.

Keywords
  • Security analysis
  • Robust data-hiding
  • Structured codebooks
  • Geometrical synchronization
  • Multiple access channel
NoteSpecial Issue on Multimedia and Security
Citation (ISO format)
TOPAK, Emre et al. Towards geometrically robust data-hiding with structured codebooks. In: Multimedia systems, 2005, vol. 11, n° 2, p. 121–132. doi: 10.1007/s00530-005-0196-1
Main files (2)
Article (Published version)
accessLevelPublic
Article (Published version)
accessLevelPublic
Identifiers
Journal ISSN0942-4962
452views
284downloads

Technical informations

Creation03/03/2015 17:36:16
First validation03/03/2015 17:36:16
Update time14/03/2023 23:57:14
Status update14/03/2023 23:57:14
Last indexation31/10/2024 00:12:55
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack