An Optimization Model for Visual Cryptography Schemes with Unexpanded Shares
學年 95
學期 1
出版（發表）日期 2006-09-01
作品名稱 An Optimization Model for Visual Cryptography Schemes with Unexpanded Shares
作品名稱（其他語言）
著者 Hou, Young-chang
單位 淡江大學資訊管理學系
出版者 Berlin: Springer-Verlag
著錄名稱、卷期、頁數 Proceedings of the 16th international conference on Foundations of Intelligent Systems, pp.58-67
摘要 The method of visual cryptography is to encrypt a secret image into N shares so that any qualified set of participants can recover the hidden secret
 by their eyes; whereas any forbidden set of participants cannot obtain any secret information. In the study of visual cryptography, pixel expansion and contrast are two important issues. Most visual cryptographic methods are based on the
 technique of pixel expansion, and the result is that the size of each share is larger than that of the secret image. Pixel expansion not only results in distortion of the shares, but also consumes more storage space. In this paper, we proposed a new method to cope with the problems of pixel expansion. We used the concept of probability and considered the security issue on the forbidden set
 and the contrast issue on the qualified set to construct an optimization model for general access structures. Finally, we analyzed the contrast and blackness of black pixels of our experimental result, and we found that our method is better
 than Ateniese et al.’s.
關鍵字 Access Structure;Secret Image;Secret Information;Black Pixel;White Pixel
語言 en_US
ISBN 9783540457664
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/90434 )

機構典藏連結