A new secret image sharing technique based on asmuth bloom's scheme


2009 International Conference on Application of Information and Communication Technologies, AICT 2009, Baku, Azerbaijan, 14 - 16 October 2009 identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1109/icaict.2009.5372571
  • City: Baku
  • Country: Azerbaijan
  • Keywords: CRT, PRNG, Secret sharing
  • Ondokuz Mayıs University Affiliated: Yes


The Chinese Remainder Theorem (CRT) is used for secret sharing by both Mignotte and Asmuth Bloom in 1983. Then Shyu et al. used Mignotte's scheme in the field of secret image sharing in 2008. However, their method use a Pseudo Random Number Generator (PRNG) with a seed to generate different pixel values for the consecutive secret pixels that have the same value. The need to distribute the seed and PRNG function to participants in order to reconstruct the secret image is a drawback of their method. A modified secret image sharing technique based on Asmuth Bloom's secret sharing scheme is proposed in this paper. It does not require to distribute the seed or PRNG like Shyu et al.'s technique. In addition, PRNG function is not used during decoding. Therefore, drawbacks in Shyu et al.'s scheme is eliminated by the proposed method using Asmuth Bloom's scheme as can be seen in the results. ©2009 IEEE.