On the Pixel Expansion of Visual Cryptography Scheme

View Sample PDF

Author(s): Teng Guo (University of International Relations, China), Jian Jiao (University of International Relations, China), Feng Liu (Chinese Academy of Sciences, China)and Wen Wang (Chinese Academy of Sciences, China)
Copyright: 2020
Pages: 8
Source title: Cryptography: Breakthroughs in Research and Practice
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-7998-1763-5.ch031

Keywords: Cryptography / Cyber and Network Security / Information Science Reference / Security & Forensics

Purchase

View On the Pixel Expansion of Visual Cryptography Scheme on the publisher's website for pricing and purchasing information.

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.

The IRMA Community

Research IRM

On the Pixel Expansion of Visual Cryptography Scheme

Purchase

Abstract

Related Content

IRMA Sponsors