Visual Cryptography (VC) with non-expanded shadow images: Hilbert-curve approach

Author

Lin, Sen-jen ; Lin, Ja-Chen ; Fang, Wen-Pinn

Author_Institution

Dept. of Comput. Sci., Nat. Chiao Tung Univ., Hsinchu

fYear

2008

fDate

17-20 June 2008

Firstpage

271

Lastpage

272

Abstract

Visual cryptography (VC) was introduced by Naor and Shamir. In general, a (k, n)-threshold scheme shares a given secret image S among n so-called shadow images. People can "view" the secret image by simply stacking any k of these n shadows (k < n is a threshold value). In most of the reported VC schemes, the size of each shadow is greater than that of S. This paper, we use Hilbert curve and two queues to present a VC scheme with the following properties: (1). Each shadow image is as small as the input image S. (2). Many gracious (k, n) contrast-optimal algorithms can be directly and easily applied to our scheme. (3) Image quality is competitive.

Keywords

Hilbert transforms; cryptography; image processing; probability; Hilbert-curve approach; image quality; nonexpanded shadow images; probabilistic approach; visual cryptography; Artificial intelligence; Computer science; Cryptography; Image analysis; Information analysis; Internet; Pixel; Social network services; Uniform resource locators; Virtual colonoscopy;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligence and Security Informatics, 2008. ISI 2008. IEEE International Conference on

Conference_Location

Taipei

Print_ISBN

978-1-4244-2414-6

Electronic_ISBN

978-1-4244-2415-3

Type

conf

DOI

10.1109/ISI.2008.4565080

Filename

4565080