Essential Secret Image Sharing Scheme
This paper presents an essential secret image sharing scheme that essential shared images are necessary in recovering the secret image. A (s, t, n) essential secret image sharing scheme shares a secret image to two kinds of shared images, essential and non-essential ones, and number of total shared image is n. Two criteria are needed to recover the secret image. Firstly, the number of essential images is at least s. Secondly, the number of collect shared images, including essential and non-essential ones, is at least t. An essential participant possesses a shared image from the secret image and another shared data from a created random seed. A non-essential shared image is obtained from XOR result of a shared image and the random image that is generated from previous seed. First step in recovering algorithm recovers the random seed from s essential shared images so as to acquire the random image for non-essential shared images. Second step gathers t shared images to recover the secret image. Experimental results reveal that the proposed method distinguishes essential and non-essential shared images and keeps the essential shared images necessary in recovering the secret image.
secret image sharing essential shared image non-essential shared image
Chien-chang Chen
Department of Information Management, Hsuan Chuang University, Hsinchu
国际会议
2010 Cross-Strait Conference on Information Science and Technology(2010 海峡两岸信息科学与技术学术交流会)
秦皇岛
英文
471-474
2010-07-09（万方平台首次上网日期，不代表论文的发表时间）