A New (k, n) Secret Image Sharing Scheme (SISS)

Amitava Nag¹, Sushanta Biswas², Debasree Sarkar², and Partha Sarkar²

¹Academy of Technology, West Bengal University of Technology, India.

² Department of Engineering and Technological studies, University of Kalyani, India

Abstract: In this paper, a new (k, n) threshold Secret Image Sharing Scheme (SISS) is proposed. In the proposed scheme the secret image is first partitioned into several non-overlapping blocks of k pixels. Every k pixel is assumed as the vertices of a complete graph G. Each spanning tree of G is represented by k pixels along with sequence and used to form k pixels of a share image. The original secret image can be restored by k or more shares and cannot be reconstructed by (k-1).  The experimental results indicate that the proposed SISS is an efficient and safe method.

Keywords: (k, n) threshold secret image sharing, complete graph, spanning tree, Pr iifer sequence.

Received May 28, 2014; accepted March 3, 2015