Quantitative Weighted Visual Cryptographic (k, m, n) Method

Algorithm 1

(k, m, n)—RGWVCS.

Input: secret image of size , (k, m, n) and ;
Output: the n secret sharing matrices .
(1)	Initialize n zero secret sharing matrices with weight , , i.e., the probability of participates in the secret recovery is .
(2)	For any pixel in , assign randomly to it using the Monte Carlo method.
(3)	Assume the p-th participant is a privileged person. There are two cases as follows:(a)If participates the secret recovery, select j secret sharing matrices randomly, i.e., ;(b)If is not involved the secret recovery, select j secret sharing matrices randomly, i.e., .
(4)	Select randomly and execute the following formula:
(5)	Generate j secret sharing matrices .
(6)	Repeat steps 2–5 times to generate n secret sharing matrices .