DocumentCode :
2259452
Title :
(2, n) Secret Image Sharing Scheme with Ideal Contrast
Author :
Dong, Lin ; Wang, Daoshun ; Ku, Min ; Dai, Yiqi
Author_Institution :
Dept. of Comput. Sci. & Technol., Tsinghua Univ. Beijing, Beijing, China
fYear :
2010
fDate :
11-14 Dec. 2010
Firstpage :
421
Lastpage :
424
Abstract :
In this paper, we propose a (2, n) secret image sharing scheme with precise reconstruction for binary, grayscale and color image. In sharing phase, XOR-based secret sharing scheme is utilized and each participant is required to hold a certain number of shares, each having the same size as the secret image. In revealing phase, each two participants can recover the original secret image precisely by just performing simple Boolean operation. The proposed scheme has low computational complexity and can reconstruct the secret image precisely. Experimental results show our scheme is simple and effective.
Keywords :
Boolean functions; computational complexity; image coding; image colour analysis; image reconstruction; (2, n) secret image sharing scheme; Boolean operation; XOR-based secret sharing scheme; binary image reconstruction; color image reconstruction; computational complexity; grayscale image reconstruction; original secret image recovery; Boolean operation; contrast; secret image sharing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Security (CIS), 2010 International Conference on
Conference_Location :
Nanning
Print_ISBN :
978-1-4244-9114-8
Electronic_ISBN :
978-0-7695-4297-3
Type :
conf
DOI :
10.1109/CIS.2010.97
Filename :
5696312
Link To Document :
بازگشت