| 摘要 |
PROBLEM TO BE SOLVED: To provide a visual secret sharing scheme assuming various access structures, and a program for executing the same.SOLUTION: "p" is a set of a finite number of shares. A certified set is a set of shares which can decrypt a secret image. A prohibited set i a set of shares which cannot obtain information on the secret image. An access structure is a set of the certified set and the prohibited set. Information on a binary secret image represented by white and black levels by pixel and information on the access structure are input. A minimum certified set is an original set of certified set different from other original subset. A representation matrix is selected, in which pixel values of secret images are encrypted by random row conversion of the rows, and corresponding minimum certified set is a subset of a fixed-gray level set of the representation matrix of a pixel value of another secret image. All the representation matrices are connected. A matrix formed by randomly replacing rows of the matrices is output for the set p of the finite number of shares. |
