Visual Cryptography. Furht, B., editor In Encyclopedia of Multimedia, pages 970–971. Springer US, 2008. 00000
Visual Cryptography [link]Paper  abstract   bibtex   
DefinitionVisual cryptography or visual secret sharing represents a group of effective schemes for image and video hading and watermarking.Visual cryptography (VC) or visual secret sharing (VSS) schemes [1] constitute probably the most cost-effective solution within a (k, n)-threshold framework. The VSS schemes use the frosted/transparent representation of the shares and the properties of the human visual system to force the recognition of a secret message from overlapping shares without additional computations or any knowledge of cryptographic keys [1–3].As it is shown in Fig. 1, the conventional VSS schemes operate on a binary input. Following the encryption procedure in a (k, n)-threshold framework, the secret binary pixel is encrypted into n blocks of m1 × m2 binary pixels. The actual share blocks are randomly generated through the column permutation of the n × m1m2 basis matrices. By repeating the process for all pixels of a K1 × K2 secret (input) image, the VSS scheme p ...
@incollection{furht_visual_2008,
	title = {Visual {Cryptography}},
	copyright = {©2008 Springer-Verlag},
	isbn = {978-0-387-74724-8 978-0-387-78414-4},
	url = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_258},
	abstract = {DefinitionVisual cryptography or visual secret sharing represents a group of effective schemes for image and video hading and watermarking.Visual cryptography (VC) or visual secret sharing (VSS) schemes [1] constitute probably the most cost-effective solution within a (k, n)-threshold framework. The VSS schemes use the frosted/transparent representation of the shares and the properties of the human visual system to force the recognition of a secret message from overlapping shares without additional computations or any knowledge of cryptographic keys [1–3].As it is shown in Fig. 1, the conventional VSS schemes operate on a binary input. Following the encryption procedure in a (k, n)-threshold framework, the secret binary pixel is encrypted into n blocks of m1 × m2 binary pixels. The actual share blocks are randomly generated through the column permutation of the n × m1m2 basis matrices. By repeating the process for all pixels of a K1 × K2 secret (input) image, the VSS scheme p ...},
	language = {en},
	urldate = {2016-05-03},
	booktitle = {Encyclopedia of {Multimedia}},
	publisher = {Springer US},
	editor = {Furht, Borko},
	year = {2008},
	note = {00000},
	pages = {970--971}
}
Downloads: 0