Fast-weighted secret image sharing

Sian Jheng Lin*, Lee Shu Teng Chen, Chih-Ching Lin

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

Abstract

Thien and Lin [Comput. and Graphics 26(5), 765-770 (2002)] proposed a threshold scheme to share a secret image among n shadows: any t of the n shadows can recover the secret, whereas t-1 or fewer shadows cannot. However, in real life, certain managers probably play key roles to run a company and thus need special authority to recover the secret in managers' meeting. (Each manager's shadow should be more powerful than an ordinary employee's shadow.) In Thien and Lin's scheme, if a company has less than t managers, then manager's meeting cannot recover the secret, unless some managers were given multiple shadows in advance. But this compromise causes managers inconvenience because too many shadows were to be kept daily and carried to the meeting. To solve this dilemma, a weighted sharing method is proposed: each of the shadows has a weight. The secret is recovered if and only if the total weights (rather than the number) of received shadows is at least t. The properties of GF(2r) are utilized to accelerate sharing speed. Besides, the method is also a more general approach to polynomial-based sharing. Moreover, for convenience, each person keeps only one shadow and only one shadow index.

Original languageEnglish
Article number077008
JournalOptical Engineering
Volume48
Issue number7
DOIs
StatePublished - 1 Dec 2009

Keywords

  • Chinese remainder theorem
  • Galois field
  • Lagrange polynomial
  • secret image sharing

Fingerprint Dive into the research topics of 'Fast-weighted secret image sharing'. Together they form a unique fingerprint.

Cite this