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

Authors

Yuqiao Cheng, Information Engineering University, Zhengzhou 450000, China;
Zhengxin Fu, Information Engineering University, Zhengzhou 450000, China;
Bin Yu, Information Engineering University, Zhengzhou 450000, China;

Abstract

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.

Recommended Citation

Cheng, Yuqiao; Fu, Zhengxin; and Yu, Bin (2020) "A XOR-based Visual Cryptography Scheme for (2, n) Access Structure with Ideal Structure Division," Journal of System Simulation: Vol. 32: Iss. 1, Article 3.
DOI: 10.16182/j.issn1004731x.joss.17-CACIS010
Available at: https://dc-china-simulation.researchcommons.org/journal/vol32/iss1/3

First Page

20

Revised Date

2017-08-28

DOI Link

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

Last Page

26

CLC

TP309.1

Recommended Citation

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.

DOI

10.16182/j.issn1004731x.joss.17-CACIS010