TY - GEN
T1 - Visual Secret Sharing Scheme with Distributed Levels of Importance of Shadows
AU - Dutta, Sabyasachi
AU - Bhore, Tamal
AU - Sardar, M. Kutubuddin
AU - Adhikari, Avishek
AU - Sakurai, Kouichi
N1 - Funding Information:
S. Dutta is grateful to the NICT, Japan for the financial support under the NICT International Exchange Program. K. Sardar is financially supported by a Ph.D. fellowship (award no. 09/028(0975)/2016) CSIR, India. A. Adhikari is thankful to Presidency University for providing FRPDF grant.
PY - 2021
Y1 - 2021
N2 - We put forward a construction of visual cryptographic scheme (VCS) to address the scenario, where there are several levels of importance of shadows. Traditional (k, n)-threshold VCS does not distinguish among the shadows—all shadows are of equal importance. Any k of them can recover the secret image whereas less than or equal to k- 1 shadows do not reveal any information about the secret image. We consider the scenario where there are several levels of essential participants (labeled according to their importance) and there must be an agreement across the levels to recover the secret image. This captures the distribution of importance of parties across several levels or compartments. We give a novel construction of visual cryptographic scheme realizing such access structures, where the parties are compartmented into different levels according to their importance. We come up with closed mathematical formulae of pixel expansion and relative contrast. We also consider more efficient probabilistic construction and compare contrasts with several other probabilistic, non-expansible constructions. Numerical evidence shows that our scheme performs better than the available generic constructions.
AB - We put forward a construction of visual cryptographic scheme (VCS) to address the scenario, where there are several levels of importance of shadows. Traditional (k, n)-threshold VCS does not distinguish among the shadows—all shadows are of equal importance. Any k of them can recover the secret image whereas less than or equal to k- 1 shadows do not reveal any information about the secret image. We consider the scenario where there are several levels of essential participants (labeled according to their importance) and there must be an agreement across the levels to recover the secret image. This captures the distribution of importance of parties across several levels or compartments. We give a novel construction of visual cryptographic scheme realizing such access structures, where the parties are compartmented into different levels according to their importance. We come up with closed mathematical formulae of pixel expansion and relative contrast. We also consider more efficient probabilistic construction and compare contrasts with several other probabilistic, non-expansible constructions. Numerical evidence shows that our scheme performs better than the available generic constructions.
UR - http://www.scopus.com/inward/record.url?scp=85097604001&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85097604001&partnerID=8YFLogxK
U2 - 10.1007/978-981-15-5411-7_2
DO - 10.1007/978-981-15-5411-7_2
M3 - Conference contribution
AN - SCOPUS:85097604001
SN - 9789811554100
T3 - Advances in Intelligent Systems and Computing
SP - 19
EP - 32
BT - Proceedings of the Fifth International Conference on Mathematics and Computing - ICMC 2019
A2 - Giri, Debasis
A2 - Ho, Anthony T.S.
A2 - Ponnusamy, S.
A2 - Lo, Nai-Wei
PB - Springer Science and Business Media Deutschland GmbH
T2 - 5th International Conference on Mathematics and Computing, ICMC 2019
Y2 - 6 February 2020 through 9 February 2020
ER -