• DocumentCode
    2960127
  • Title

    A new secret image sharing technique based on Asmuth Bloom´s scheme

  • Author

    Ulutas, Mustafa ; Nabiyev, Vasif V. ; Ulutas, Guzin

  • Author_Institution
    Dept. of Comput. Eng., Ondokuz Mayis Univ., Samsun, Turkey
  • fYear
    2009
  • fDate
    14-16 Oct. 2009
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    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.
  • Keywords
    image processing; random number generation; security of data; Asmuth Bloom secret sharing scheme; Chinese remainder theorem; pseudorandom number generator; secret image sharing technique; Cathode ray tubes; Cryptography; Decoding; Image reconstruction; Random number generation; CRT; PRNG; Secret Sharing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Application of Information and Communication Technologies, 2009. AICT 2009. International Conference on
  • Conference_Location
    Baku
  • Print_ISBN
    978-1-4244-4739-8
  • Electronic_ISBN
    978-1-4244-4740-4
  • Type

    conf

  • DOI
    10.1109/ICAICT.2009.5372571
  • Filename
    5372571