Constructing perfect secret sharing schemes for general and uniform access structures

被引：0

作者：

Sun, HM ^{[1
]}

Shieh, SP

机构：

[1] Natl Cheng Kung Univ, Dept Comp Sci & Informat Engn, Tainan 701, Taiwan

[2] Natl Chiao Tung Univ, Dept Comp Sci & Informat Engn, Hsinchu 300, Taiwan

来源：

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | 1999年 / 15卷 / 05期

关键词：

cryptography; information security; secret sharing schemes; threshold schemes; information theory; access structures;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：679 / 689

页数：11

共 50 条

[41] New construction of perfect secret sharing schemes for graph-based prohibited structures
Sun, HM
[J]. COMPUTERS & ELECTRICAL ENGINEERING, 1999, 25 (04) : 267 - 277
[42] Secure publicly verifiable and proactive secret sharing schemes with general access structure
Mashhadi, Samaneh
[J]. INFORMATION SCIENCES, 2017, 378 : 99 - 108
[43] Perfect secret sharing schemes from combinatorial squares
Saurabh, Shyam
Sinha, Kishore
[J]. SECURITY AND PRIVACY, 2022, 5 (06):
[44] Weighted decomposition construction for perfect secret sharing schemes
Sun, HM
Chen, BL
[J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2002, 43 (6-7) : 877 - 887
[45] Optimal linear secret sharing schemes for graph access structures on six participants
Gharahi, Motahhareh
Khazaei, Shahram
[J]. THEORETICAL COMPUTER SCIENCE, 2019, 771 : 1 - 8
[46] Verifiable multi-secret sharing schemes for multiple threshold access structures
Tartary, Christophe
Pieprzyk, Josef
Wang, Huaxiong
[J]. INFORMATION SECURITY AND CRYPTOLOGY, 2008, 4990 : 167 - +
[47] DECOMPOSITION CONSTRUCTION FOR SECRET SHARING SCHEMES WITH GRAPH ACCESS STRUCTURES IN POLYNOMIAL TIME
Sun, Hung-Min
Wang, Huaxiong
Ku, Bying-He
Pieprzyk, Josef
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (02) : 617 - 638
[48] The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures
Hui-Chuan Lu
Hung-Lin Fu
[J]. Designs, Codes and Cryptography, 2014, 73 : 37 - 46
[49] The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures
Lu, Hui-Chuan
Fu, Hung-Lin
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2014, 73 (01) : 37 - 46
[50] Secret sharing schemes with bipartite access structure
Padró, C
Sáez, G
[J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT '98, 1998, 1403 : 500 - 511

← 1 2 3 4 5 →