The Optimal n-out-of-n Visual Secret Sharing Scheme for Gray-Scale Images

Mitsugu IWAMOTO  Hirosuke YAMAMOTO  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E85-A   No.10   pp.2238-2247
Publication Date: 2002/10/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Information Security
Keyword: 
visual secret sharing scheme,  gray-scale image,  polynomial representation,  contrast,  pixel expansion,  

Full Text: PDF>>
Buy this Article




Summary: 
In this paper, a method is proposed to construct an n-out-of-n visual secret sharing scheme for gray-scale images, for short an (n,n)-VSS-GS scheme, which is optimal in the sense of contrast and pixel expansion, i.e., resolution. It is shown that any (n,n)-VSS-GS scheme can be constructed based on the so-called polynomial representation of basis matrices treated in [15],[16]. Furthermore, it is proved that such construction can attain the optimal (n,n)-VSS-GS scheme.