Hershey, Pennsylvania
New York, New YorkBeijing, China
On the Pixel Expansion of Visual Cryptography Scheme

On the Pixel Expansion of Visual Cryptography Scheme

Teng Guo (University of International Relations, School of Information Science and Technology, Beijing, China), Jian Jiao (University of International Relations, School of Information Science and Technology, Beijing, China), Feng Liu (Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China), and Wen Wang (Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China)
Copyright: © 2017 |Pages: 7
DOI: 10.4018/IJDCF.2017040104
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

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.
Article Preview
Top

Preliminaries

This section contains two parts. The first part presents the basic concepts related to VCS. The second part reviews some previous results of graph access structure VCS.

Complete Article List

Search this Journal:
Reset
Volume 17: 1 Issue (2025)
Volume 16: 1 Issue (2024)
Volume 15: 1 Issue (2023)
Volume 14: 3 Issues (2022)
Volume 13: 6 Issues (2021)
Volume 12: 4 Issues (2020)
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing