Information hiding

John Lach, William H. Mangione-Smith, and Miodrag Potkonjak. Enhanced Intellectual Property Protection for Digital Circuits on Programmable Hardware , 1999 Information Hiding Workshop, pp. 331-345, Dresden, Germany, September 1999. 213, 214, 215, 219, 221... 

Xiang S. J., Huang J. W., Yang R. (2006). Time-scale invariant audio watermarking based on the statistical features in time domain. Proceedings of the 8th Information Hiding Workshop, 2006. 

P erez-Freire, L., Comesa na, P., P erez-Gonz alez, F. (2005). Information-theoretic analysis of security in side-informed data hiding. Proceeding of the yth Information Hiding Workshop. 

Fabien A. P. Petitcolas, Ross J. Anderson, Markus G. Kuhn. (1998). Attacks on copyright marking systems. Proceeding of Information Hiding (pp. 219-239). 

Pereira S., Voloshynovskiy S., Madueno M., Marchand-Maillet S. Pun T. (200 1). Second generation benchmarking and application oriented evaluation. Procee ding of Information Hiding Workshop. 

A) For information hiding applications, high-rate watermarking might be possible. In Sec. 3, we compare the performance of SCS watermarking with three different coded modulation techniques to achieve a rate R of one watermark bit per host-data element. Measured bit-error results are related to those of Chou et al. for the same watermark rate. 

B) Transmission of one watermark bit per host-data element is applicable for information hiding schemes, but for robust watermarking, where strong attacks must be considered, much lower watermark rates are more realistic. In Sec. 4 different methods for low-rate SCS watermarking are discussed. 

F. Petitcolas, R. Anderson, and M. Kuhn. Attacks on copyright marking systems, Proceedings of the Information Hiding Workshop, Portland, Oregon, April 1998. 

J. R. Smith and B. O. Comiskev, Modulation and Information Hiding in Images, Proceedings of the 1996 Workshop on Information Hiding, University of Cambridge,... 

B. Pfitzmaim, Trials of Traced Traitors, Information Hiding Workshop, First International Workshop, Cambridge, UK. Lecture Notes in Computer Science, Vol. 1174, Springer, 1996, pp. 49-64. 

R Moulin and J. A. O Sullivan, Information-theoretic analysis of information hiding, IEEE Transaction on Information Theory, January 2001. 

N. F. Johnson, Z. Duric and S. Jajodia. Information Hiding Steganography and Watermarking - Attacks and Countermeasures. Kluwer Academic Publishers, USA, 2000. 137... 

S. Katzenbeisser, F. A. P. Petitcolas (edited). Information Hiding Techniques for Steganography and Digital Watermarking. Artech House, USA, 2000. 136, 137... 

Strictly speaking, the concept of a service-oriented architecture is nothing else but the application of well-known and established software engineering principles like separation of concerns or information hiding in the area of IT landscape architectures. 

Figure 1 Information hiding system m - the message, s sequence, y - the attack channel output sequence, m distortion constraint.

Information hiding systems are modeled in either one of the following two scenarios ... 

In this section of the report, we define an information hiding system with a non-malicious attack channel. We cite information-theoretic results pertaining to the related problem of coding for a communication channel with side information, and describe the equivalent results for information hiding systems with mean distortion constraint, established lately in the literature. Similar and somewhat stronger results for information hiding systems with distortion constraints based on maximum distortion measures, are then presented, while their proofs are deferred to the appendices. This body of theoretical results provides the foundation for the more practical analysis in the subsequent sections. 

Information Hiding Systems and Communication Channels with Side information... 

The following theorem provides a formula for the capacity of an information hiding system with a maximum distortion constraint. It s similarity to Theorem (2.1) is apparent and its proof is omitted since it is identical in essence to the proof given in [GP80]. A similar theorem for the more general case of IHS, with mean distortion constraint is proved in [BCWOO]. 

Theorem 2.2 Let H be an information hiding system, with a maximum distortion constraint ds and and distortion level D. Denote by A the set of all triplets U, S, X) of random variables taking values inU x S x X (U is an arbitrarily large finite set) s.t. 

We show now that the information hiding problem with the maximum distortion constraint is, in fact, a special case of the channel coding with side information problem. This is evident from the next lemma in which we construct, for each information hiding problem, an equivalent problem of channel coding with side information. The proof of the lemma is given in Appendix A. 

Lemma 2.3 Let H be an IHS with a maximum distortion constraint, dg, based on a distortion measure d x,s), and distortion level D. Denote by py xivlx) the transition probability matrix of its attack channel. Define a channel with side information K in the following way The input, output and side information alphabet sets denoted respectively - X, 3, S, are identical to those of H. The p.d.f. ps s) of the side information r.v. S is equal to the p.d.f of the covertext r.v. of the information hiding system H. Define the transition probability matrix of K as ... 

The capacity of this channel is given by Cf = maxp f B, Y) where the maximum is taken over all distributions Pb of the binary input variable and If denotes mutual information induced by /. One can appreciate that this formula is much simpler than the one provided by Theorem (2.2), although there is no guarantee that it achieves the same optimal value. It follows that given an information hiding problem one can construct a suitable BMS by ... 

---