For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
The Optimal n-out-of-n Visual Secret Sharing Scheme for Gray-Scale Images
Mitsugu IWAMOTO Hirosuke YAMAMOTO
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/10/01
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Information Security
visual secret sharing scheme, gray-scale image, polynomial representation, contrast, pixel expansion,
Full Text: PDF>>
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 ,. Furthermore, it is proved that such construction can attain the optimal (n,n)-VSS-GS scheme.