• DocumentCode
    1571186
  • Title

    Distortion-free multiple images sharing scheme with universal share

  • Author

    Hsu, Steen J. ; Chiu, Chuan-Feng ; Chan, Chia-Tai ; Jan, Sen-Ren

  • Author_Institution
    Dept. of Inf. Manage., Minghsin Univ. of Sci. & Technol., Hsinchu, Taiwan
  • fYear
    2009
  • Firstpage
    833
  • Lastpage
    838
  • Abstract
    Recently, Fang and Lin proposed a multiple images sharing system with a universal share. This universal share can be used for a company´s organizer to attend the recovery meeting of any shared images. Since the organizer only needs to keep the unique share, it reduces the difficulties of the share management of the organizer. However, the universal share is embedded into a secret by the least-significant-bits (LSB) substitution method before evaluating all the shares of the secret. The secret image becomes a distortion image. The original secret cannot be reconstructed without loss. In this paper, we present a distortion-free sharing scheme for the sharing of multiple images. Instead of using LSB to embed a universal share, all the bits of the secret image and the universal share are used to generate the coefficients of sharing polynomials. Moreover, this paper employs the Galois Field GF(28) instead of GF(251). Since all the information of the security image is hiding in those polynomials, the original secret can be revealed without any distortion.
  • Keywords
    Galois fields; cryptography; organisational aspects; polynomials; Galois field; LSB; company organizer; distortion image; distortion-free multiple images sharing scheme; least-significant-bits substitution method; polynomial sharing coefficients; share management; Automatic testing; Biomedical informatics; Cognition; Fuzzy systems; Medical services; Medical tests; Mood; Psychiatry; Psychology; System testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pervasive Computing (JCPC), 2009 Joint Conferences on
  • Conference_Location
    Tamsui, Taipei
  • Print_ISBN
    978-1-4244-5227-9
  • Electronic_ISBN
    978-1-4244-5228-6
  • Type

    conf

  • DOI
    10.1109/JCPC.2009.5420069
  • Filename
    5420069