OPTIMAL (2, n) VISUAL CRYPTOGRAPHIC SCHEMES
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.
pixel expansion regular graph design relative contrast share.
Mausumi Bose Rahul Mukerjee
Applied Statistics Unit Indian Statistical Institute 203 B T Road Kolkata 700108, India Indian Institute of Management Calcutta Joka, Diamond Harbour Road Kolkata 700104, India
国际会议
2006 International Conference on Design of Experiments and Its Applications(2006实验设计及其应用国际会议)
天津
英文
2006-07-09（万方平台首次上网日期，不代表论文的发表时间）