基于理想存取结构划分的(2, n)异或视觉密码

doi:10.16182/j.issn1004731x.joss.17-CACIS010

系统仿真学报 ›› 2020, Vol. 32 ›› Issue (1): 20-26.doi: 10.16182/j.issn1004731x.joss.17-CACIS010

基于理想存取结构划分的(2, n)异或视觉密码

程羽乔, 付正欣, 郁滨

信息工程大学,郑州 450000

收稿日期:2017-07-18 修回日期:2017-08-28 发布日期:2020-01-17
作者简介:程羽乔(1994-),女,江西丰城,硕士生,研究方向为视觉密码、信息安全;付正欣(通讯作者1986-),男,山东曹县,博士,讲师,研究方向为视觉密码、信息安全。
基金资助:
国家自然科学基金(61602513),信息工程大学优秀青年基金(2016611303)

A XOR-based Visual Cryptography Scheme for (2, n) Access Structure with Ideal Structure Division

Cheng Yuqiao, Fu Zhengxin, Yu Bin

Information Engineering University, Zhengzhou 450000, China

Received:2017-07-18 Revised:2017-08-28 Published:2020-01-17

摘要/Abstract

摘要： 针对(2, n)异或视觉密码的完全恢复问题,依据理想存取结构定义,在分析最小授权子集之间特殊的共享份关系基础上,借助图论思想设计了一种存取结构划分算法,并证明了该算法划分得到的理想存取结构数目最少。设计并实现了秘密分享与恢复算法。实验结果表明,提出的(2, n)异或视觉密码方案可以实现秘密图像的完全恢复,且与现有方案相比,像素扩展度达到最优。

关键词: 异或视觉密码, 完全恢复, 理想结构划分, (2, n)存取结构, 最小像素扩展

Abstract: We propose a XOR-based visual cryptography scheme for (2, n) access structures. According to the definition of ideal access structure, the relationship of shares among the minimal qualified subsets is analyzed. And based on it, a division algorithm of access structures is presented with the theory of graph. By this approach, we can obtain the least number of ideal access structures. Additionally the processes of secret sharing and recovering are given. Experimental results show that this scheme can achieve a perfect secret recovery. Compared with existing schemes, the pixel expansion of our paper is the best.

Key words: XOR-based visual cryptography scheme, perfect recovery, ideal structure division, (2, n) access structure, optimal pixel expansion

中图分类号:

TP309.1

程羽乔, 付正欣, 郁滨. 基于理想存取结构划分的(2, n)异或视觉密码[J]. 系统仿真学报, 2020, 32(1): 20-26.

Cheng Yuqiao, Fu Zhengxin, Yu Bin. A XOR-based Visual Cryptography Scheme for (2, n) Access Structure with Ideal Structure Division[J]. Journal of System Simulation, 2020, 32(1): 20-26.

参考文献

[1] Naor M, Shamir A.Visual cryptography[J]. Lecture Notes in Computer Science (S0302-9743), 1995, 950(9): 1-12.
[2] Chao K Y, Lin J C.Secret Image Sharing: A Boolean Operations Based Approach Combining Benefits of Polynomial Based and Fast Approaches[J]. International Journal of Pattern Recognition and Artificial Intelligence (S0218-0014), 2009, 23(2): 263-285.
[3] Ateniese G, Blundo C, Santis A D, et al.Visual Cryptography for General Access Structures[J]. Information and Computation (S0890-5401), 1996, 129(2): 86-106.
[4] Arumugam S, Lakshmanan R, Nagar AK.On (k,n)*-Visual Cryptography Scheme[J]. Designs, Codes and Cryptography (S1573-7586), 2014, 71(1): 153-162.
[5] Dutta S, Rohit R S, Adhikari A.Constructions and Analysis of Some Efficient, \(t\), -, \((k,n)^*\), -Visual Cryptographic Schemes Using Linear Algebraic Techniques[J]. Designs, Codes and Cryptography (S1573-7586), 2016, 80(1): 165-196.
[6] Blundo C, Santis A D, Stinson D R.On the Contrast in Visual Cryptography Schemes[J]. Journal of Cryptology (S0933-2790), 1999, 12(4): 261-289.
[7] Hofmeister T, Krause M, Simon H U.Contrast-optimal k out of n Secret Sharing Schemes in Visual Cryptography[J]. Theoretical Computer Science (S0304-3975), 2000, 240(2): 471-485.
[8] Lakshmanan R, Arumugam S.Construction of A (k, n)-Visual Cryptography Scheme[J]. Designs Codes & Cryptography (S1573-7586), 2017, 82(3): 629-645.
[9] Shyu S J, Chiang C M.Optimum Pixel Expansions for Threshold Visual Secret Sharing Schemes[J]. IEEE Transactions on Information Forensics & Security (S1556-6013), 2011, 6(3): 960-969.
[10] Shyu S J, Chen M C.Minimizing Pixel Expansion in Visual Cryptographic Scheme for General Access Structures[J]. IEEE Transactions on Circuits & Systems for Video Technology (S1558-2205), 2015, 25(9): 1557-1561.
[11] 侯永昌, 官振宇, 蔡志丰, 等. 没有形变的(3,n)-视觉秘密分享方案[J]. 计算机学报, 2016, 39(3): 441-453.
Hou Yongchang, Guan Zhenyu, Cai Zhifeng, et al.(3,n)-Visual Secret Sharing Scheme with Unexpanded Shares[J]. Chinese Journal of Computers, 2016, 39(3): 441-453.
[12] Biham E, Itzkovitz A. Visual Cryptography with Polarization [EB/OL]. [2017-04-10]. http://citeseerx.ist. psu.edu/viewdoc/summary?doi=10.1.1.9.6412.
[13] Tuyls P, Hollmann H D L, Lint J H V, et al. XOR-based Visual Cryptography Schemes[J]. Designs, Codes and Cryptography (S1573-7586), 2005, 37(1): 169-186.
[14] 沈刚, 付正欣, 郁滨. (k, n)异或视觉密码的一般性研究[J]. 电子与信息学报, 2013, 35(10): 2294-2300.
Shen Gang, Fu Zhengxin, Yu Bin.On the Generality of (k, n) XOR-based Visual Cryptography Scheme[J]. Journal of Electronics & Information Technology, 2013, 35(10): 2294-2300.
[15] Liu F, Wu C K. Optimal XOR Based (2,n)-Visual Cryptography Schemes[M]. Digital-Forensics and Watermarking. Springer International Publishing, 2014: 333-349.
[16] 付正欣, 沈刚, 孔志印, 等. 异或视觉密码的理想存取结构研究[J]. 电子与信息学报, 2014, 36(7): 1642-1647.
Fu Zhengxin, Shen Gang, Kong Zhiyin, et al.Investigation on Ideal Access Structure of XOR-based Visual Cryptography[J]. Journal of Electronics & Information Technology, 2014, 36(7): 1642-1647.
[17] 付正欣. 视觉密码的一般模型及关键问题研究[D]. 郑州: 中国人民解放军信息工程大学, 2014.
Fu Zhengxin.Research on General Model of Visual Cryptography and Its Key Problems[D]. Zhengzhou: Information Engineering University, 2014.
[18] Li Shundong, Li Jiliang, Wang Daoshun.Region Incrementing Visual Cryptography Scheme with Same Contrast[J]. Chinese Journal of Electronics (S2075-5597), 2016, 25(4): 621-624.
[19] 付正欣, 沈刚, 李斌, 等. 一种可完全恢复的门限多秘密视觉密码方案[J]. 软件学报, 2015, 26(7): 1757-1771.
Fu Zhengxin, Shen Gang, Li Bin, et al.Threshold Multi-Secret Visual Cryptography Scheme with Perfect Recovery[J]. Journal of Software, 2015, 26(7): 1757-1771.
[20] Yan X, Wang S, Niu X, et al.Halftone Visual Cryptography with Minimum Auxiliary Black Pixels and Uniform Image Quality[J]. Digital Signal Processing (S1051-2004), 2015, 38(C): 53-65.
[21] Sridhar S, Sathishkumar R, Sudha G F.Adaptive Halftoned Visual Cryptography with Improved Quality and Security[J]. Multimedia Tools & Applications (S1573-7721), 2017, 76(1): 815-834.

基于理想存取结构划分的(2, n)异或视觉密码

A XOR-based Visual Cryptography Scheme for (2, n) Access Structure with Ideal Structure Division

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 1

编辑推荐

Metrics

本文评价