| N. Provos, "Probabilistic Methods for Improving Information Hiding" , CITI Technical report, Jan, 2001. |
....The speci c transforms we introduce to perform statistical corrections depend on embedding methods that distribute the hidden message over all redundant bits. This section brie y explains the underlying steganographic embedding process. A detailed description can be found in a related paper [7]. We divide the task of embedding hidden information in a cover medium into two steps: Identi cation of redundant bits. Redundant bits can be modi ed without detectably degrading the cover medium. The selection of bits in which the hidden information should be placed. 3.1 Identi cation of ....
....in this way restricts the hidden message size to a maximum of 50 of the available redundant bits. We explain in Section 6 why this is not a serious restriction. Not using all the redundant bits gives the selection process a greater opportunity to nd a good embedding, described in related work [7]. It also leaves enough bits for the correcting transform to preserve frequency count based statistics. Because the PRNG is keyed with a secret, it is not possible to nd the hidden message without knowing the key. The recipient initializes the PRNG with that secret and uses the same selection ....
Niels Provos. Probabilistic Methods for Improving Information Hiding. CITI Technical Report 01-1, January 2001. Submitted for publication.
No context found.
N. Provos, "Probabilistic Methods for Improving Information Hiding" , CITI Technical report, Jan, 2001.
No context found.
N. Provos. Probabilistic methods for improving information hiding. Technical Report CITI 01-1, University of Michigan, 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