A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
In (2, n) visual cryptographic schemes, a secret image(text or picture) is encrypted into n shares which are distributed among n participants. The image cannot be decoded from any single share but any two participants can together decode it visually, without using any complex decoding mechanism. In this paper, we introduce three meaningful optimality criteria for evaluating different schemes and show that some classes of combinatorial designs, such as BIB designs, PBIB designs and regular graphdoi:10.1007/s10623-006-0011-9 fatcat:f5sdoxq26rbdhfjpxpsbrc4icq