Constructing perfect secret sharing schemes for general and uniform access structures
| dc.citation.epage | 689 | en_US |
| dc.citation.issue | 5 | en_US |
| dc.citation.spage | 679 | en_US |
| dc.citation.volume | 15 | en_US |
| dc.citation.woscount | 2 | |
| dc.contributor.author | Sun, HM | en_US |
| dc.contributor.author | Shieh, SP | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:46:17Z | |
| dc.date.available | 2014-12-08T15:46:17Z | |
| dc.date.issued | 1999-09-01 | en_US |
| dc.description.abstract | A 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.identifier.issn | 1016-2364 | en_US |
| dc.identifier.journal | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/31141 | |
| dc.identifier.wosnumber | WOS:000082869400005 | |
| dc.language.iso | en_US | en_US |
| dc.subject | cryptography | en_US |
| dc.subject | information security | en_US |
| dc.subject | secret sharing schemes | en_US |
| dc.subject | threshold schemes | en_US |
| dc.subject | information theory | en_US |
| dc.subject | access structures | en_US |
| dc.title | Constructing perfect secret sharing schemes for general and uniform access structures | en_US |
| dc.type | Article | en_US |