Cart (Loading....) | Create Account
Close category search window
 

Towards Shift Tolerant 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
$31 $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

3 Author(s)
Daoshun Wang ; Tsinghua Univ., Beijing, China ; Lin Dong ; Xiaobo Li

In a (k, n) visual secret sharing (VSS) scheme, the alignment of the transparencies is important to the visual quality of the reconstructed secret image. Each pixel of the original secret image is expanded to m subpixels in a share image. If a share image is printed on a paper with the same size as the original secret image, the alignment or the registration of the subpixels, which is only m times smaller than that of the original secret image, could be troublesome. In this paper, we propose a (2, n)-VSS scheme that allows a relative shift between the shares in the horizontal direction and vertical direction. When the shares are perfectly aligned, the contrast of the reconstructed image is equal to that of the traditional VSS scheme. When there is a shift, the average contrast of the reconstructed image is higher than that of the traditional VSS scheme, and the scheme can still work in cases where very little shape redundancy is present in the image. The trade-off is that our method involves a larger pixel expansion. The basic building block of our scheme is duplication and concatenation of certain rows or columns of the basic matrices. This seemingly simple but very powerful construction principle can be easily used to create more general (k, n) schemes.

Published in:

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

Date of Publication:

June 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.