Sharing Multiple Digital Images via Halftoning Methods

Article Preview

Abstract:

The visual secret sharing for multiple secrets (VSSM) technique allows for the encryption of more than one secret images in a given image area. Previous research on VSSM schemes has a pixel expansion problem that limits the capability to increase the capacity of secret image encryption. Moreover, the VSSM schemes focus on sharing binary images to date. These drawbacks limit the applicability of existing VSSM schemes. In this study, we propose a novel encryption algorithm to address these problems. The proposed algorithm adopts a visual cryptography (VC)–based encryption method that can eliminate the pixel expansion problem and is applicable to halftone secret images. The experimental results demonstrate that the proposed approach not only can increase the capacity of VSSM schemes, but also can maintain an excellent level of display quality in the recovered secret images.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1992-1997

Citation:

Online since:

June 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] M. Naor and A. Shamir: Advances in Cryptology: Eurprocrypt'94, vol. 950 (1995), pp.1-12.

Google Scholar

[2] C. Blundo, A. De Santis, and M. Naor: Info. Process. Lett., vol. 75 (2000), pp.255-259.

Google Scholar

[3] S. H. Shyu: Pattern Recogni., vol. 39 (2006), pp.866-880.

Google Scholar

[4] C. C. Wu and L. H. Chen: Master Thesis, Institute of Computer and Information Science, National Chaio Tung University, Taiwan, R.O. C (1998).

Google Scholar

[5] T. H. Chen, K. H. Tsao, and K. C. Wei: in Proc. 8th Int. Conf. Intelligent. Syst. Design and Appl., vol. 3 (2008), pp.252-256.

Google Scholar

[6] C. N. Yang and T. H. Chung: Opt. Comm., vol. 283 (2010), pp.4949-4962.

Google Scholar

[7] K. H. Lee and P. L. Chiu: Opt. Comm., vol. 284 (2011), pp.2730-2741.

Google Scholar

[8] S. J. Shyu and K. Chen: Info. Sci., vol. 181 (2011), pp.3246-3266.

Google Scholar