TY - GEN
T1 - Distortion-free multiple images sharing scheme with universal share
AU - Hsu, Steen J.
AU - Chiu, Chuan Feng
AU - Jan, Sen Ren
AU - Chan, Chia Tai
PY - 2009
Y1 - 2009
N2 - Recently, Fang and Lin proposed a multiple images sharing system with a universal share. This universal share can be usedfor 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 ofthe share management ofthe 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 distortionfree sharing schemefor the sharing ofmultiple images. Instead of using LSB to embed a universal share, all the bits ofthe 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.
AB - Recently, Fang and Lin proposed a multiple images sharing system with a universal share. This universal share can be usedfor 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 ofthe share management ofthe 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 distortionfree sharing schemefor the sharing ofmultiple images. Instead of using LSB to embed a universal share, all the bits ofthe 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.
UR - http://www.scopus.com/inward/record.url?scp=77951275751&partnerID=8YFLogxK
U2 - 10.1109/JCPC.2009.5420069
DO - 10.1109/JCPC.2009.5420069
M3 - Conference contribution
AN - SCOPUS:77951275751
SN - 9781424452279
T3 - 2009 Joint Conferences on Pervasive Computing, JCPC 2009
SP - 833
EP - 837
BT - 2009 Joint Conferences on Pervasive Computing, JCPC 2009
T2 - 2009 Joint Conferences on Pervasive Computing, JCPC 2009
Y2 - 3 December 2009 through 5 December 2009
ER -