全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
-  2018 

一种无像素膨胀的(3,3)视觉密码方案 A(3,3) visual cryptographic scheme without pixel expansion

Keywords: 视觉密码,秘密分享,基本矩阵,秘密图像,分享

Full-Text   Cite this paper   Add to My Lib

Abstract:

针对视觉密码的像素膨胀问题,提出了一种无像素膨胀的(3,3)视觉密码方案,所给方案产生的分享图像与原始秘密图像具有相同的大小,不存在像素膨胀问题.所提出的视觉密码方案在对秘密图像分享的过程中每次处理4个像素,根据4个像素的颜色组成选择不同的分享策略,在每幅分享图像中相应地产生4个子像素.实验结果证实了所给方案能够很好地恢复秘密图像,同已有的视觉密码方案相比,所恢复的秘密图像具有很好的对比度

References

[1]  Naor M,Shamir A.Visual cryptography[C]//Advances in Cryptology-Eurocrypt’94,Berlin:SpringerVerlag,1995,LNCS950:1-12.
[2]  Yang C N.New visual secret sharing schemes using probabilistic method[J].Pattern Recognition Letters,2004,25:481-494.
[3]  Ito R,Kuwakado H,Tanaka H.Image size invariant visual cryptography[J].IEICE Trans Fundamentals,1999,E82-A(10):2172-2177.
[4]  Wang D,Zhang L,Ma N,et al.Two secret sharing schemes based on boolean operations[J].Pattern Recognition Letters,2007,40(10):2776-2785.
[5]  Monoth T,Anto B P.Recursive visual cryptography using random basis column pixel expansion[C]//Proceedings of the IEEE International Conference on Information Technology 2007,California:IEEE Computer Society Press,2007:41-43.
[6]  Chen T H,Tsao K H.Visual secret sharing by random grids revisited[J].Pattern Recognition,2009,42(9):2203-2217
[7]  Kafri O,Keren E.Encryption of pictures and shapes by random grids[J].Optics Letters,1987,12(6):377-379.
[8]  Shyu S J.Image encryption by random grids[J].Pattern Recognition,2007,40(3):1014-1031.
[9]  Chen T H,Tsao K H.Threshold visual secret sharing by random grids[J].Journal of Systems and Software,2011,84(7):1197-1208.
[10]  Chen T H,Tsao K H.User-friendly random gridbased visual secret sharing[J].IEEE Transactions on Circuits and Systems for Video Technology,2011,21(11):1693-1703.
[11]  Paknahad S M,Hosseini S A,Alaghband M R.Userfriendly visual secret sharing based on random grids[C]//Signal Processing and Intelligent Systems Conference,IEEE,2015:58-62.
[12]  Liu C L,Tsai W J,Chang T Y,et al.Meaningful share generation for(2,2)-multiple visual secret sharing scheme without pixel expansion[J].Computer Journal,2015,58(7):1598-1606.
[13]  Lin T L,Horng S J,Lee K H,et al.A novel visual secret sharing scheme for multiple secrets without pixel expansion[J].Expert Systems with Applications,2010,37:7828-7869.
[14]  候永昌,官振宇,蔡志丰,等.没有形变的(3,n)-视觉秘密分享方案[J].计算机学报,2016,39(3):441-453.Hou Yungchang,Quan Zenyu,Tsai Zhinfong.(3,n)-visual secret sharing scheme with unexpanded shares[J].Chinese Journal of Computers,2016,39(3):441-453.
[15]  胡浩,郁滨,沈刚.像素不扩展视觉密码的边缘增强研究[J].计算机科学,2015,42(2):103-107.Hu Hao,Yu Bin,Shen Gang.Edge enhancement on size invariant visual cryptography[J].Computer Science,2015,42(2):103-107.
[16]  Monoth T,Anto B P.Achieving optimal contrast in visual cryptography schemes without pixel expansion[J].International Journal of Recent Trends in Engineering,2009,1(1):468-471.
[17]  Shyu S J.Image encryption by multiple random grids[J].Pattern Recognition,2009,42(7):1582-1596.
[18]  Chakraborty U,Paul J K,Mahapatera P R S.Design and implementation of a(2,2)and a(2,3)visual cryptographic scheme[J/OL].(2012-4-18)[2013-7-20].http://interscience.in/SpIss_ijcct_accta_2010vol1_nol2/CS_Paper2.pdf.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133