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....

This article proposes a visual gambling scheme, in which the banker encodes several images into random-looking share images that are printed on transparencies and declares the contents of the original images at the same time. Afterwards the gambler chooses a random-looking share image and...