| Previous | [1] | [2] | [3] | [4] | [5] | [6] | [7] | [8] | [9] | [10] |
Ching-Nung Yang
Department of Computer Science and Information Engineering
National Dong Hwa University
Hualien, 974 Taiwan
E-mail: cnyang@mail.ndhu.edu.tw
Rijmen and Preneel [1] proposed the colored VSS (Visual Secret Sharing) scheme, which only needs m sub pixels to represent m! colors. However, the number of possible colors does not really reach m! but only about m!/2 for large m. In this note, we will show this error and also give a correction for the Rijmen-Preneel scheme.
Keywords: visual cryptography, secret sharing scheme, visual secret sharing scheme, color visual cryptography, 2-out-of-2 VSS scheme
Received April 2, 2001; revised; accepted December 19, 2001
Retrieve PDF document (200205_02.pdf)
Communicated by Ja-Ling Wu.