On the Design of a Document Protection Scheme Based on Steganography and Secret Sharing

In this paper, we integrate secret sharing and steganography to propose a document protection scheme. The secret message is split into n shadows according to a k-1 degree polynomial and is recovered by Lagrange´s interpolation. The sharing of the secret message is tied in with a cover message. Without the appropriate cover message, the probability of guessing the secret message right is very small. Hence the protection of our scheme comes from two sides: secret sharing and steganography. To fulfill the requirement of the Shamir´s (k, n)-threshold secret sharing scheme, we introduce a hash function with collision handling into our scheme. The security of our scheme is based on Sharmir´s scheme. The experimental result shows that our scheme is secure and practicable