Name
Abstract | ||
|---|---|---|
We consider a visual secret sharing scheme with cyclic access structure for n secret images and n shares, where two consecutive shares decode one secret image. This secret sharing scheme can be constructed by using Droste's method. However the contrast of its scheme is 1/(2n ). In this paper, it is shown that for every integer n *** 4, there exists no construction of such a visual secret sharing scheme having a perfect black reconstruction and contrast at least 1/4. Also for every even integer n *** 4, a new construction of such a visual sharing scheme that satisfies a slightly weaker condition and has a contrast 1/4 is given. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-642-00730-9_6 | ICISC |
Keywords | DocType | Volume |
n share,n secret image,consecutive share,cyclic access structure,integer n,secret image,visual secret,visual sharing scheme,visual secret sharing scheme,new construction,secret sharing scheme,satisfiability | Conference | 5461 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.36 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Miyuki Uno | 1 | 10 | 2.19 |
| Mikio Kano | 2 | 548 | 99.79 |