Full metadata record
DC FieldValueLanguage
dc.contributor.authorChen, Ying-Ruen_US
dc.contributor.authorChen, Ling-Hweien_US
dc.contributor.authorShyu, Shyong Jianen_US
dc.date.accessioned2017-04-21T06:56:48Z-
dc.date.available2017-04-21T06:56:48Z-
dc.date.issued2016-11en_US
dc.identifier.issn1380-7501en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s11042-015-2734-yen_US
dc.identifier.urihttp://hdl.handle.net/11536/132612-
dc.description.abstractIn the area of secret image sharing (SIS), most papers focused on the schemes for threshold or some special access structures. Regarding general access structures (GAS), few results have been found in the literature. Two SIS schemes for GAS were proposed in 2001 and 2010, both are based on qualified sets. However, one distorts the reconstructed secret image, and some extra information is needed in both schemes. Here, we propose three polynomial based SIS schemes for GAS. Considering either qualified or forbidden sets, these schemes can reconstruct the secret image perfectly without any extra information needed. Some proof and analysis on the shadow sizes of the three schemes are given to lead us to choose the one with the smallest size. In addition, we also give some comparisons with two existing schemes, and security issue is also addressed in conclusion.en_US
dc.language.isoen_USen_US
dc.subjectShadow sizeen_US
dc.subjectSecret image sharingen_US
dc.subjectGeneral access structureen_US
dc.titleSecret image sharing with smaller shadow sizes for general access structuresen_US
dc.identifier.doi10.1007/s11042-015-2734-yen_US
dc.identifier.journalMULTIMEDIA TOOLS AND APPLICATIONSen_US
dc.citation.volume75en_US
dc.citation.issue21en_US
dc.citation.spage13913en_US
dc.citation.epage13929en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000386776800048en_US
Appears in Collections:Articles