Secret sharing scheme based on mignotte´s scheme

Shamir proposed a secret sharing method called by (k, n) threshold scheme that divides secret image among n participants in 1979. In 1983, Mignotte proposed a new threshold scheme that is based on Chinese Remainder Theorem. In recent years, secret sharing schemes become popular during the transmission of secret image over the Internet. While many works in the literature are using Shamir´s scheme for secret image sharing, Shyu et al. suggested using Mignotte´s scheme for sharing purposes. However their method uses random function that´s seed value must be known before the sharing procedure to cope with the cases like share images contain information about the secret image. Their method necessitates sharing the seed value before the transmission of share images. Proposed method ensures (k, n) property of Mignotte´s scheme while it does not require any transmission before the sharing procedure. Therefore, secrecy of the sharing algorithm is enhanced with respect to Shyu et al.´s method. Method improves system´s security due not to need distribution of any data before the transmission of share images.