南京大学学报(自然科学版) ›› 2018, Vol. 54 ›› Issue (1): 157–.

• • 上一篇    下一篇

 具有掩盖图像的像素不扩展的(2,2)视觉密码方案

 王洪君*,赵腾飞,尚大龙,王大东   

  • 出版日期:2018-01-31 发布日期:2018-01-31
  • 作者简介: 吉林师范大学计算学院,四平,136000
  • 基金资助:
     基金项目:国家自然科学基金(31070224),吉林省教育厅“十二五”科学技术研究项目(吉教科合字[2011]第162号)
    收稿日期:2017-10-22
    *通讯联系人,E-mail:jlnuwhj@sina.com

 Non-expanded (2,2) visual cryptography scheme with masked image

 Wang Hongjun*,Zhao Tengfei,Shang Dalong,Wang Dadong   

  • Online:2018-01-31 Published:2018-01-31
  • About author: College of Computer,Jilin Normal University,Siping,136000,China

摘要:  视觉密码是一种新的对秘密图像进行加密的技术,其解密过程只需要人的视觉系统就能完成.分享秘密图像被加密成n幅分享图像,任意k张分享图像的叠加通过人的视觉就可以看到秘密图像信息,而少于k幅图像的叠加则无法得到秘密图像的任何信息.传统视觉密码方案的分享图像大小比原秘密图像大,并且分享图像无意义.为了解决上述问题,对现有视觉密码像素不扩展方案进行研究,给出一种具有掩盖图像的像素不扩展的(2,2)视觉密码方案,用两幅掩盖图像分别对产生的两幅分享图像进行伪装,使得分享图像有意义,分享图像的叠加可以恢复秘密图像.在对秘密图像进行分享的过程中,每次以一个2×2的像素块作为输入,相应地产生一个同样大小的子像素块作为输出,使得分享图像和秘密图像具有相同的大小.通过实验对所给方案进行了验证,结果证明所给方案的分享图像无像素扩展并且有意义,恢复的秘密图像清晰,证明了所给方案的有效性.

Abstract:  Visual cryptography is a new cryptographic technique which allows secret image to be encrypted in such a way that the decryption can be performed by humans’ visual system.The secret image is encoded into n shared images.The superposition of arbitrary k shared images can recover the secret image through human eyes,while less than k of shared images can’t get any information of the secret image.However,in the traditional visual cryptography scheme,there is a pixel expansion problem,in which the size of shared image is larger than that of the original secret image.Meanwhile,the generated shared images are meaningless.In order to solve the above problems,a non-expanded visual cryptography scheme with masked image is proposed.This method is based on the researching of the existing visual cryptography scheme without pixel extension.In this scheme,two shares of the secret images are disguised by two cover images.So the shared images are meaningful.In the process of sharing secret images,a 2×2 pixels block is used as an input,and a sub pixel block of the same size is produced as the output.This allows the shared images and secret images with the same size.At last,the scheme is verified by experiments.The experimental results show that the proposed approach not only has no pixel expansion,but also has meaningful shares and an excellent recovery quality for the secret image.The experimental results prove the effectiveness of the given scheme.

 [1] Naor M,Shamir A.Visual cryptography ∥ International Conference on Advances in Cryptology-Eurocrypt’94.Springer Berlin Heidelberg,1995:1-12.
[2] Pal J K,Mandal J K,Dasgupta K.A(2,N)visual cryptographic technique for banking applications.International Journal of Network Security & Its Applications,2010,2(4):118-127.
[3] Yang C N.New visual secret sharing schemes using probabilistic method.Pattern Recognition Letters,2004,25(4):481-494.
[4] Thomas M,Babu A P.Achieving optimal contrast in visual cryptography schemes without pixel expansion.International Journal of Recent Trends in Engineering,2009,1(1):468-471.
[5] Lin T L,Horng S J,Lee K H,et al.A novel visual secret sharing scheme for multiple secrets without pixel expansion.Expert Systems with Applications,2010,37(12):7858-7869.
[6] Chakraborty U,Paul J K,Mahapatra P R S.Design and Implementation of a(2,2)and a(2,3)Visual Cryptographic Scheme ∥ International Conference on Advances in Computer,Communication Technology & Applications.New York,NY,USA:IEEE Press,2010:128-134.
[7] 王洪君,牟晓丽,鲁晓颖等.像素不扩展的(2,3)视觉密码方案.吉林大学学报(信息科学版),2014,32(1):82-87.(Wang H J,Mu X L,Lu X Y,et al.(2,3)visual cryptographic scheme without pixel expansion.Journal of Jilin University(Information Science Edition),2014,32(1):82-87.)
[8] Zhang H B,Wang X F,Huang Y P.A novel ideal contrast visual secret sharing scheme with reversing.Journal of Multimedia,2009,4(3):104-111.
[9] Lin S J,Lin J C,Fang W P.Visual cryptography(VC)with non-expanded shadow images:Hilbert-curve approach ∥ Proceedings of the IEEE International Conference on Intelligence and Security Informatics.Taipei,China:IEEE,2008:271-272.
[10] 王益伟,郁 滨,付正欣等.像素不扩展的防欺骗视觉密码方案研究.信息工程大学学报,2011,12(2):149-153.(Wang Y W,Yu B,Fu Z X,et al.Research on a cheater preventable VCS with pixel unexpanded.Journal of Information Engineering University,2011,12(2):149-153.)
[11] 郁 滨,王 翠.像素不扩展的MSM视觉密码方案.信息工程大学学报,2007,8(2):156-160.(Yu B,Wang C.Pixel unexpanded MSM visual cryptography scheme.Journal of Information Engineering University,2007,8(2):156-160.)
[12] Fang W P.Non-expansion visual secret sharing in reversible style.International Journal of Computer Science and Network Security,2009,9(2):204-208.
[13] 侯永昌,官振宇,蔡志丰等.没有形变的(3,n)-视觉秘密分享方案.计算机学报,2016,39(3):441-453.(Hou Y C,Quan Z Y,Tsai C F,et al.(3,n)-visual secret sharing scheme with unexpanded shares.Chinese Journal of Computers,2016,39(3):441-453.)
[14] 胡 浩,郁 滨,沈 刚.像素不扩展视觉密码的边缘增强研究.计算机科学,2015,42(2):103-107.(Hu H,Yu B,Shen G.Edge enhancement on size invariant visual cryptography.Computer Science,2015,42(2):103-107.)
[15] 甘 明,甘 志,陈克非.具有掩盖图像的可视秘密共享方案.计算机应用与软件,2005,22(7):1-2,88.(Gan M,Gan Z,Chen K F.A visual secret sharing scheme with covert image.Computer Applications and Software,2005,22(7):1-2,88.)
[16] 付正欣,郁 滨,房礼国.具有伪装图案的操作式多秘密视觉密码.计算机科学,2011,38(6):90-92.(Fu Z X,Yu B,Fang L G.Operation-based multi-secret visual cryptography scheme with disguised patterns.Computer Science,2011,38(6):90-92.)
[17] Ulutas M.Meaningful share generation for increased number of secrets in visual secret-sharing scheme.Mathematical Problems in Engineering,2010,2010:593236.
[18] Kumari K,Bhatia S.Multi-pixel visual cryptography for color images with meaningful shares.International Journal of Engineering Science and Technology,2010,2(6):2398-2407.
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!