@incollection{furht_private-key_2008,
	title = {Private-{Key} {Cryptosystem}},
	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_184},
	abstract = {DefinitionA private-key cryptosystem can be obtained using the visual cryptography concepts or perfect-reconstruction based image secret sharing.A (2, 2)-scheme is the most popular solution within the (k, n) framework due to its common acceptance as a private-key cryptosystem [1–3]. Such a cryptographic solution encrypts the secret image into two noise-like shares. One of the two generated shares can be viewed as a private share or private-key, and is kept by the owner. The other share represents a public share which can be transmitted over an untrusted communication channel. The secret image is reconstructed only if both the public and private shares are used for decryption.A private-key cryptosystem can be obtained using the visual cryptography concepts [1] or perfect-reconstruction based image secret sharing [2]. Both these solutions encrypt each pixel of the secret image into a block of share pixels and because of their expansion nature, such solutions produce the shares ...},
	language = {en},
	urldate = {2016-05-03},
	booktitle = {Encyclopedia of {Multimedia}},
	publisher = {Springer US},
	editor = {Furht, Borko},
	year = {2008},
	note = {00000},
	pages = {736--737}
}

{"_id":"5ptrg5Ydbe23mtPCp","bibbaseid":"furht-privatekeycryptosystem-2008","authorIDs":[],"bibdata":{"bibtype":"incollection","type":"incollection","title":"Private-Key Cryptosystem","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_184","abstract":"DefinitionA private-key cryptosystem can be obtained using the visual cryptography concepts or perfect-reconstruction based image secret sharing.A (2, 2)-scheme is the most popular solution within the (k, n) framework due to its common acceptance as a private-key cryptosystem [1–3]. Such a cryptographic solution encrypts the secret image into two noise-like shares. One of the two generated shares can be viewed as a private share or private-key, and is kept by the owner. The other share represents a public share which can be transmitted over an untrusted communication channel. The secret image is reconstructed only if both the public and private shares are used for decryption.A private-key cryptosystem can be obtained using the visual cryptography concepts [1] or perfect-reconstruction based image secret sharing [2]. Both these solutions encrypt each pixel of the secret image into a block of share pixels and because of their expansion nature, such solutions produce the shares ...","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":"736–737","bibtex":"@incollection{furht_private-key_2008,\n\ttitle = {Private-{Key} {Cryptosystem}},\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_184},\n\tabstract = {DefinitionA private-key cryptosystem can be obtained using the visual cryptography concepts or perfect-reconstruction based image secret sharing.A (2, 2)-scheme is the most popular solution within the (k, n) framework due to its common acceptance as a private-key cryptosystem [1–3]. Such a cryptographic solution encrypts the secret image into two noise-like shares. One of the two generated shares can be viewed as a private share or private-key, and is kept by the owner. The other share represents a public share which can be transmitted over an untrusted communication channel. The secret image is reconstructed only if both the public and private shares are used for decryption.A private-key cryptosystem can be obtained using the visual cryptography concepts [1] or perfect-reconstruction based image secret sharing [2]. Both these solutions encrypt each pixel of the secret image into a block of share pixels and because of their expansion nature, such solutions produce the shares ...},\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 = {736--737}\n}\n\n","editor_short":["Furht, B."],"key":"furht_private-key_2008","id":"furht_private-key_2008","bibbaseid":"furht-privatekeycryptosystem-2008","role":"editor","urls":{"Paper":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_184"},"downloads":0,"html":""},"bibtype":"incollection","biburl":"http://www.telemidia.puc-rio.br/~alan/files/all.bib","creationDate":"2020-03-03T14:08:14.141Z","downloads":0,"keywords":[],"search_terms":["private","key","cryptosystem"],"title":"Private-Key Cryptosystem","year":2008,"dataSources":["jAxurbvLP8q5LTdLa"]}