By Topic

A block based (t, n) visual cryptography scheme for unbounded n and t=2, 3

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)
Sian-Jheng Lin ; Res. Center for Inf. Technol. Innovation, Acad. Sinica, Taipei, Taiwan ; Wei-Ho Chung

The (t, n) visual cryptography (VC) is a secret sharing scheme of decomposing a secret image into n transparencies, and the stacking of any t out of n transparencies reveals the secret content. The perfect security condition of VC scheme requires the strict requirement where any t-1 or fewer transparencies cannot extract any information about the secret. For n approaching infinity, previous studies consider the scenario where the probabilistic model is a pixel-to-pixel scheme that encodes each secret pixel to a corresponding pixel in each transparency. In this paper, we extend the pixel-to-pixel scheme to pixel-to-block scheme for the cases t=2 and 3. Given a secret image, the proposed VC scheme generates a transparency through coding each secret image pixel to a m-pixels shadow block on the corresponding position of the transparency. Experiments show that the stacking results reveal better visual quality than the probabilistic model scheme.

Published in:

Signal & Information Processing Association Annual Summit and Conference (APSIPA ASC), 2012 Asia-Pacific

Date of Conference:

3-6 Dec. 2012