Show simple item record

dc.contributor.authorLiu, F
dc.contributor.authorYan, W-Q
dc.contributor.authorLi, P
dc.contributor.authorWu, C
dc.date.accessioned2013-12-31T04:08:34Z
dc.date.available2013-12-31T04:08:34Z
dc.date.copyright2013-12-31
dc.date.issued2013-12-31
dc.identifier.citationTransactions on Data Hiding and Multimedia Security IX. Lecture Notes in Computer Science Volume 8363, 2014, pp 1-24
dc.identifier.urihttp://hdl.handle.net/10292/6354
dc.description.abstractVisual Cryptography (VC) is a powerful technique that combines the notions of perfect ciphers and secret sharing in cryptography with that of raster graphics. A binary image can be divided into shares that are able to be stacked together so as to approximately recover the original image. VC is a unique technique in the sense that the encrypted message can be decrypted directly by the Human Visual System (HVS). The distinguishing characteristic of VC is the ability of secret restoration without the use of computation. However because of restrictions of the HVS, pixel expansion and alignment problems, a VC scheme perhaps can only be applied to share a small size of secret image. In this paper, we present an Enriched Secret Sharing Visual Cryptography Scheme (ESSVCS) to let the VC shares carry more secrets, the technique is to use cypher output of private-key systems as the input random numbers of VC scheme, meanwhile the encryption key could be shared, the shared keys could be associated with the VC shares. After this operation, VC scheme and secret sharing scheme are merged with the private-key system. Under this design, we implement a (k; t; n)-VC scheme. Compared to those existing schemes, our scheme could greatly enhance the ability of current VC schemes and could cope with pretty rich secrets.
dc.languageEnglish
dc.publisherSpringer
dc.rightsAn author may self-archive an author-created version of his/her article on his/her own website and or in his/her institutional repository. He/she may also deposit this version on his/her funder’s or funder’s designated repository at the funder’s request or as a result of a legal obligation, provided it is not made publicly available until 12 months after official publication. He/ she may not use the publisher's PDF version, which is posted on www.springerlink.com, for the purpose of self-archiving or deposit. Furthermore, the author may only post his/her version provided acknowledgement is given to the original source of publication and a link is inserted to the published article on Springer's website. The link must be accompanied by the following text: "The final publication is available at www.springerlink.com”. (Please also see Publisher’s Version and Citation).
dc.subjectSecret sharing
dc.subjectVisual cryptography
dc.subjectCovert data
dc.titleESSVCS: an enriched secret sharing visual cryptography
dc.typeJournal Article
dc.rights.accessrightsOpenAccess
dc.identifier.doi10.1007/978-3-642-55046-1_1
aut.relation.endpage20
aut.relation.pages20
aut.relation.startpage1
pubs.elements-id156109


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record