摘要：There are kinds of multimedia can be accessed conveniently in social networks. Some of multimedia may be used to hiding harmful information. We consider the problem of estimating the stego key used for hiding using least significant bit (LSB) paradigm, which has been proved much difficult than detecting the hidden message. Previous framework for stego key search was provided by the theory of hypothesis testing. However, the test threshold is hard to determine. In this paper, we propose a new method, in which the correct key can be identified by inspecting the difference between stego sequence and its shifted sequence on the embedding path. It’s shown that the new technique is much simpler and quicker than that previously known.
