A xor-based visual cryptography scheme for (2, n) access structure with ideal structure division
Xitong Fangzhen Xuebao / Journal of System Simulation, ISSN: 1004-731X, Vol: 32, Issue: 1, Page: 20-26
2020
- 39Usage
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Usage39
- Downloads35
- Abstract Views4
Article Description
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.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85078542791&origin=inward; http://dx.doi.org/10.16182/j.issn1004731x.joss.17-cacis010; https://dc-china-simulation.researchcommons.org/journal/vol32/iss1/3; https://dc-china-simulation.researchcommons.org/cgi/viewcontent.cgi?article=1911&context=journal; https://dx.doi.org/10.16182/j.issn1004731x.joss.17-cacis010; https://www.chndoi.org/Resolution/Handler?doi=10.16182/j.issn1004731x.joss.17-CACIS010; http://sciencechina.cn/gw.jsp?action=cited_outline.jsp&type=1&id=6664223&internal_id=6664223&from=elsevier
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know