On generating meaningful shares in visual secret sharing scheme.

Saved in:
Bibliographic Details
Title: On generating meaningful shares in visual secret sharing scheme.
Authors: Tsai, D. S.1,2, Chen, T.3, Horng, G.1 gbhorng@cs.nchu.edu.tw
Source: Imaging Science Journal. 2008, Vol. 56 Issue 1, p49-55. 7p. 2 Black and White Photographs, 1 Diagram, 2 Charts.
Subjects: Imaging systems, Transparencies, Optics, Audiovisual materials, Noise
Abstract: In the k-out-of-n visual secret sharing scheme (VSSS) proposed by Naor and Shamir, a binary secret image is encoded into n shares called transparencies. Each share, consisting of black and white pixels, is in the form of noise and has size larger than that of the secret image. The binary secret image can be decoded by using the visual system through superimposing any k of n transparencies without performing any cryptographic computation. In practice, meaningless shares, however, might invite the adversary's attention and to manage numerous increasing transparencies belonging to different secrets is also a problem. In the present paper, a simple method to transform meaningless shares in VSSS into natural colourful images is proposed. Experiment results show that this method does provide a general solution to the k-out-of-n VSSS with few additional pixel expansions and low computational power as compared with others. [ABSTRACT FROM AUTHOR]
Copyright of Imaging Science Journal is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:In the k-out-of-n visual secret sharing scheme (VSSS) proposed by Naor and Shamir, a binary secret image is encoded into n shares called transparencies. Each share, consisting of black and white pixels, is in the form of noise and has size larger than that of the secret image. The binary secret image can be decoded by using the visual system through superimposing any k of n transparencies without performing any cryptographic computation. In practice, meaningless shares, however, might invite the adversary's attention and to manage numerous increasing transparencies belonging to different secrets is also a problem. In the present paper, a simple method to transform meaningless shares in VSSS into natural colourful images is proposed. Experiment results show that this method does provide a general solution to the k-out-of-n VSSS with few additional pixel expansions and low computational power as compared with others. [ABSTRACT FROM AUTHOR]
ISSN:13682199
DOI:10.1179/174313107X214330