The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
On the Pixel Expansion of Visual Cryptography Scheme
Abstract
In this paper, we first follow Ateniese et al.'s work that provides upper bounds of the pixel expansion of visual cryptography schemes(VCSs) for more kinds of graph access structures, in which we require that a subset of parties can determine the secret if they contain an edge of the graph G. The constructive upper bounds are derived by the graph decomposition technique. Then we generalize Ateniese et al.'s method of comparing the optimal pixel expansion of VCSs with two different access structures.
Related Content
Preeti Mariam Mathews, Anjali Sandeep Gaikwad, Mathu Uthaman, B. Sreelekshmi, V. Dankan Gowda.
© 2024.
26 pages.
|
Dankan Gowda V., Joohi Garg, Shaifali Garg, K. D. V. Prasad, Sampathirao Suneetha.
© 2024.
20 pages.
|
K. Sriprasadh.
© 2024.
24 pages.
|
R. Valarmathi, R. Uma, P. Ramkumar, Srivatsan Venkatesh.
© 2024.
20 pages.
|
R. Jayashree, J. Venkata Subramanian.
© 2024.
14 pages.
|
M. Indira, K. S. Mohanasundaram, M. Saranya.
© 2024.
14 pages.
|
R. Thenmozhi, D. Vetriselvi, A. Arokiaraj Jovith.
© 2024.
26 pages.
|
|
|