Full metadata record
DC FieldValueLanguage
dc.contributor.authorSun, HMen_US
dc.contributor.authorShieh, SPen_US
dc.date.accessioned2014-12-08T15:46:17Z-
dc.date.available2014-12-08T15:46:17Z-
dc.date.issued1999-09-01en_US
dc.identifier.issn1016-2364en_US
dc.identifier.urihttp://hdl.handle.net/11536/31141-
dc.description.abstractA perfect secret sharing scheme allows a secret K to be shared among a set of participants in such a way that only qualified subsets of participants can recover the secret, and unqualified subsets of participants obtain no information regarding the secret. In this paper, we propose a construction of perfect secret sharing schemes with uniform, generalized access structures of rank 3. Compared with other constructions, our construction has some improved lower bounds on the information rate. In addition, we also generalize the construction to perfect secret sharing schemes with uniform, generalized access structures of constant rank.en_US
dc.language.isoen_USen_US
dc.subjectcryptographyen_US
dc.subjectinformation securityen_US
dc.subjectsecret sharing schemesen_US
dc.subjectthreshold schemesen_US
dc.subjectinformation theoryen_US
dc.subjectaccess structuresen_US
dc.titleConstructing perfect secret sharing schemes for general and uniform access structuresen_US
dc.typeArticleen_US
dc.identifier.journalJOURNAL OF INFORMATION SCIENCE AND ENGINEERINGen_US
dc.citation.volume15en_US
dc.citation.issue5en_US
dc.citation.spage679en_US
dc.citation.epage689en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000082869400005-
dc.citation.woscount2-
Appears in Collections:Articles


Files in This Item:

  1. 000082869400005.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.