In this paper we introduce a new construction of a black and white visual cryptographic scheme for general access structure. We prove that our scheme gives a strong access structure. We find out the conditions for which our scheme gives less pixel expansion compared to the schemes given in Section 4.2 of [1]. We also propose a modified algorithm giving better result from the pixel expansion's point of view. As a particular case of general access structure, we get (k, n)-VTS with 2 ≤ k ≤ n. The (n, n)-VTS obtained from our scheme attains the optimal pixel expansion and the relative contrast. We compare the (k, n)-VTS obtained from the schemes mentioned in Section 4.1 and Section 4.2 of [1] with the (k,n)-VTS obtained from our method and it has been shown that in almost all the cases our pixel expansion is less compared to the other two schemes. © Springer-Verlag 2004.
CITATION STYLE
Adhikari, A., Dutta, T. K., & Roy, B. (2004). A new black and white visual cryptographic scheme for general access structures. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3348, 399–413. https://doi.org/10.1007/978-3-540-30556-9_31
Mendeley helps you to discover research relevant for your work.