Yet Another Friendly Progressive Visual Secret Sharing Scheme

Author

Chen, Tzung-Her ; Lee, Yao-Sheng

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Nat. Chiayi Univ., Chiayi, Taiwan

fYear

2009

fDate

12-14 Sept. 2009

Firstpage

353

Lastpage

356

Abstract

Visual secret sharing (VSS) schemes, providing secret communication services, are classified into two categories: visual-cryptography-based (VC) and random-grids-based (RG). As a friendly progressive version of VC-based VSS presented in 2008, it suffers the problem of pixel expansion which is innate deficiency of conventional VC-based VSS. In this paper, a new friendly progressive VSS scheme by random grids is proposed without this problem. To demonstrate the feasibility, the experimental results show the proposed scheme does work.

Keywords

image coding; image resolution; private key cryptography; random processes; pixel expansion; random grids; secret communication services; visual secret sharing scheme; visual-cryptography; Cities and towns; Color; Computer science; Cryptography; Electronic mail; Image reconstruction; Roentgenium; Signal processing; Variable structure systems; Virtual colonoscopy; pixel expansion; progressive; random grid; user-friendly; visual secret sharing;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Information Hiding and Multimedia Signal Processing, 2009. IIH-MSP '09. Fifth International Conference on

Conference_Location

Kyoto

Print_ISBN

978-1-4244-4717-6

Electronic_ISBN

978-0-7695-3762-7

Type

conf

DOI

10.1109/IIH-MSP.2009.135

Filename

5337499