Information-theoretic analysis of information hiding

被引:335
|
作者
Moulin, P [1 ]
O'Sullivan, JA
机构
[1] Univ Illinois, Dept Elect & Comp Engn, Coordinated Sci Lab, Beckman Inst, Urbana, IL 61801 USA
[2] Washington Univ, Dept Elect Engn, St Louis, MO 63130 USA
关键词
channel capacity; cryptography; fingerprinting; game theory; information hiding; network information theory; optimal jamming; randomized codes; rate-distortion theory; steganography; watermarking;
D O I
10.1109/TIT.2002.808134
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An information-theoretic analysis of information hiding is presented in this paper, forming the theoretical basis for design of information-hiding systems. Information hiding is an emerging research area which. encompasses applications such as copyright protection for digital media, watermarking, fingerprinting, steganography, and data embedding. In these applications, information is hidden within a host data set and is to be reliably communicated Wit receiver. The host data set is intentionally corrupted, but in a covert way, designed to be imperceptible to a casual analysis. Next, an attacker may seek to destroy this hidden information, and for this purpose, introduce additional distortion to the,data set. Side information (in the form of cryptographic keys and/or information about the host signal) may be available to the information hider and to the decoder. We formalize these notions and evaluate the hiding capacity, which upper-bounds the rates of reliable transmission and quantifies the fundamental tradeoff between three quantities: the achievable information-hiding rates and the allowed distortion levels for the information hider and the attacker. The hiding capacity is the value of a game between the information hider and the attacker. The optimal attack strategy is the solution of a particular rate-distortion problem, and the optimal hiding strategy is the solution to a channel-coding problem. The hiding capacity is derived by extending the Gel'fand-Pinsker theory of communication with side information at the encoder. The extensions include the presence of distortion. constraints, side information at the decoder, and unknown communication channel. Explicit formulas for capacity are given in several cases, including Bernoulli and Gaussian problems, as well as the important special case of small distortions. In some cases, including the last two above, the hiding capacity is the same whether or not the decoder knows the host data set. It is shown that many existing information-hiding systems in the literature operate far below capacity.
引用
收藏
页码:563 / 593
页数:31
相关论文
共 50 条
  • [1] Information-theoretic analysis of information hiding
    Moulin, P
    O'Sullivan, JA
    [J]. 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 19 - 19
  • [2] Information-theoretic analysis of security in side-informed data hiding
    Pérez-Freire, L
    Comesaña, P
    Pérez-González, F
    [J]. INFORMATION HIDING, 2005, 3727 : 131 - 145
  • [3] An information-theoretic model for image watermarking and data hiding
    Moulin, P
    Mihçak, MK
    Lin, GI
    [J]. 2000 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOL III, PROCEEDINGS, 2000, : 667 - 670
  • [4] Mechanisms for Hiding Sensitive Genotypes with Information-Theoretic Privacy
    Ye, Fangwei
    Cho, Hyunghoon
    El Rouayheb, Salim
    [J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 902 - 907
  • [5] Mechanisms for Hiding Sensitive Genotypes With Information-Theoretic Privacy
    Ye, Fangwei
    Cho, Hyunghoon
    El Rouayheb, Salim
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (06) : 4090 - 4105
  • [6] Is Information-Theoretic Topology-Hiding Computation Possible?
    Ball, Marshall
    Boyle, Elette
    Cohen, Ran
    Malkin, Tal
    Moran, Tal
    [J]. THEORY OF CRYPTOGRAPHY, TCC 2019, PT I, 2019, 11891 : 502 - 530
  • [7] Information-theoretic analysis of watermarking
    Moulin, P
    O'Sullivan, JA
    [J]. 2000 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, PROCEEDINGS, VOLS I-VI, 2000, : 3630 - 3633
  • [8] An Information-Theoretic Analysis of Deduplication
    Niesen, Urs
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (09) : 5688 - 5704
  • [9] An Information-Theoretic Analysis of Deduplication
    Niesen, Urs
    [J]. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 1738 - 1742
  • [10] Information-Theoretic Analysis for the Difficulty of Extracting Hidden Information
    ZHANG Wei-ming 1
    2.State Key Laboratory of Information Security
    [J]. Wuhan University Journal of Natural Sciences, 2005, (01) : 315 - 318