Optimal (2, n) visual cryptographic schemes |
| |
Authors: | Mausumi Bose Rahul Mukerjee |
| |
Institution: | (1) Applied Statistics Unit, Indian Statistical Institute, 203 B T Road, Kolkata, 700108, India;(2) Indian Institute of Management Calcutta, Joka, Diamond Harbour Road, Kolkata, 700104, India |
| |
Abstract: | 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 graph
designs, can yield a large number of black and white (2,n) schemes that are optimal with respect to all these criteria. For a practically useful range of n, we also obtain optimal schemes with the smallest possible pixel expansion. |
| |
Keywords: | Pixel expansion Regular graph design Relative contrast Share |
本文献已被 SpringerLink 等数据库收录! |
|