@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}
}

{"_id":"4XEAACc9F8PLzYEHX","bibbaseid":"furht-visualcryptography-2008","authorIDs":[],"bibdata":{"bibtype":"incollection","type":"incollection","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":[{"propositions":[],"lastnames":["Furht"],"firstnames":["Borko"],"suffixes":[]}],"year":"2008","note":"00000","pages":"970–971","bibtex":"@incollection{furht_visual_2008,\n\ttitle = {Visual {Cryptography}},\n\tcopyright = {©2008 Springer-Verlag},\n\tisbn = {978-0-387-74724-8 978-0-387-78414-4},\n\turl = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_258},\n\tabstract = {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 ...},\n\tlanguage = {en},\n\turldate = {2016-05-03},\n\tbooktitle = {Encyclopedia of {Multimedia}},\n\tpublisher = {Springer US},\n\teditor = {Furht, Borko},\n\tyear = {2008},\n\tnote = {00000},\n\tpages = {970--971}\n}\n\n","editor_short":["Furht, B."],"key":"furht_visual_2008","id":"furht_visual_2008","bibbaseid":"furht-visualcryptography-2008","role":"editor","urls":{"Paper":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_258"},"downloads":0,"html":""},"bibtype":"incollection","biburl":"http://www.telemidia.puc-rio.br/~alan/files/all.bib","creationDate":"2020-03-03T14:08:14.157Z","downloads":0,"keywords":[],"search_terms":["visual","cryptography"],"title":"Visual Cryptography","year":2008,"dataSources":["jAxurbvLP8q5LTdLa"]}