By Topic

Optimum Pixel Expansions for Threshold Visual Secret Sharing Schemes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shyong Jian Shyu ; Department of Computer Science and Information Engineering, Ming Chuan University, Taoyuan, Taiwan ; Ming Chiang Chen

The optimal pixel expansion of an (n, n) visual cryptographic scheme (VCS) was proven as 2n-1 in 1995; and that of a (2, n)-VCS was proposed in 2002. Yet, most existing best pixel expansions of (k, n)-VCSs for k ≥ 3 have not been improved since 1996. Whether they are already optimal, and if not how to find the optimums have never been explored. In this paper, we model the minimization of the pixel expansion in a (k, n)-VCS into an integer linear program to acquire the optimum solution. Computational results demonstrate that our integer linear program is simple, effective to obtain the optimum solution and flexible for coping with various types of (k, n)-VCSs.

Published in:

IEEE Transactions on Information Forensics and Security  (Volume:6 ,  Issue: 3 )