Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18] [ 19]

@

Journal of Information Science and Engineering, Vol. 24 No. 5, pp. 1567-1577 (September 2008)

A Geometry-Based Secret Image Sharing Approach

Chien-Chang Chen and Wen-Yin Fu
Department of Computer Science
Hsuan Chuang University
Hsinchu, 300 Taiwan
E-mail: cchen34@hcu.edu.tw

A (k, n) secret image sharing method shares a protected image in n shared images and the protected image can be reconstructed by k shared images. This study solves the secret image sharing problem by a geometry secret sharing strategy named the Blakley scheme. The protected image is first partitioned into non-overlapping sets of k pixels. Each set of k pixels forms a point under a k-dimensional space and the set solution to each generated affine hyperplane, only intersecting at this point stores to the corresponding shared image. The reconstructed image, consistent with the protected image, is obtained from k shared images. Additionally, an efficient hyperplanes selection strategy is presented. Experimental results indicate that the proposed approach is efficient for secretly sharing a digital image.

Keywords: visual cryptography, secret sharing, (k, n) threshold, geometry, Blakleys secret sharing method

Full Text () Retrieve PDF document (200809_18.pdf)

Received November 7, 2006; revised March 29 & May 21, 2007; accepted June 27, 2007.
Communicated by Tzong-Chen Wu.