An Efficient Steganography Scheme for M-Commerce

In 2005, Fan and Kou proposed a steganography scheme based on (t, n) threshold secret sharing scheme. In their scheme, a transmitter can only deliver one message m to another communication side atone time. However, if there are r messages to be delivered, a transmitter has to deliver r times such that it will result in a lot of transmission time. Therefore, in this paper, we propose an efficient scheme to improve the transmitted overhead of the previous scheme. In addition, our scheme still maintains the advantages of Fan and Kou´s scheme including efficiently reducing computing complexity and resisting active and passive attacks.