| J. A. O'Sullivan, "Some properties of optimal information hiding and information attacks," in Proc. of the Allerton Conf. on Comm., Control and Computing, 2001. |
....] and is assumed finite. Equality is achieved in both (31) and (32) if the covertext is zero mean i.i.d. Gaussian. Note that for a zero mean variance # 2 u i.i.d. Gaussian covertext, Theorem 2. 4 di#ers from the initial results of Moulin and O Sullivan [8, 9] but agrees with an updated version [28]. In our 19 notation, the results of [8, 9] can be expressed as 1 2 log(1 s(A; D 1 , D 2 , # 2 u ) where the parameter A is fixed to # 2 u D 1 , rather than, as in (8) being optimized over A # A(D 1 , D 2 , # 2 u ) The value # 2 u D 1 is not the optimal choice for A # ....
....n for every A # A(D 1 , D 2 , # 2 u ) where P A Y X is defined in Section 3.1. The value of the game is thus C # (D 1 , D 2 , # 2 u ) as we have demonstrated above. Using the above concepts, we now discuss the value of this game that was initially given in [8, 9] and later revised in [28]. For A 0 = # 2 u D 1 , I priv # (P G U ) n , P X U , P A 0 Y X ) n # # I priv # (P G U ) n , P A 0 X U ) n , P A 0 Y X ) n # , 49) for every P X U # D 1 (D 1 , P G U ) n ) and I priv # (P G U ) n , P A 0 X U ) n , P A 0 Y X ) n # ....
J. A. O'Sullivan, "Some properties of optimal information hiding and information attacks," in Proc. of the Allerton Conf. on Comm., Control and Computing, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC