Secret sharing schemes with bipartite access structure

被引：0

作者：

Padró, C ^{[1
]}

Sáez, G ^{[1
]}

机构：

[1] Univ Politecn Catalunya, Dept Matemat Aplicada & Telemat, ES-08034 Barcelona, Spain

来源：

ADVANCES IN CRYPTOLOGY - EUROCRYPT '98 | 1998年 / 1403卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study the information rate of secret sharing schemes whose access structure is bipartite, Ln a bipartite access structure there are two classes of participants and all participants in the same class play an equivalent role in the structure. We characterize completely the bipartite access structures that can be realized by an ideal secret sharing scheme. Both upper and lower bounds on the optimal information rate of bipartite access structures are given.

引用

页码：500 / 511

页数：12

共 16 条

[1]

Beutelspacher A., 1993, Designs, Codes and Cryptography, V3, P127, DOI 10.1007/BF01388411

[2]

Blakley G. R., 1979, AFIPS Conference Proceedings, vol.48. 1979 National Computer Conference, P313, DOI 10.1109/MARK.1979.8817296

[3] Tight Bounds on the Information Rate of Secret Sharing Schemes [J].

Carlo Blundo ;

Alfredo De Santis ;

Roberto De Simone ;

Ugo Vaccaro .

Designs, Codes and Cryptography, 1997, 11 (2) :107-110

[4] GRAPH DECOMPOSITIONS AND SECRET SHARING SCHEMES [J].

BLUNDO, C ;

DESANTIS, A ;

STINSON, DR ;

VACCARO, U .

JOURNAL OF CRYPTOLOGY, 1995, 8 (01) :39-64

[5]

BLUNDO C, LECT NOTES COMPUTER, V740, P148

[6]

Brickell E. F., 1991, Journal of Cryptology, V4, P123, DOI 10.1007/BF00196772

[7]

Brickell E. F., 1992, Journal of Cryptology, V5, P153, DOI 10.1007/BF02451112

[8]

Brickell E.F., 1989, J COMBIN MATH COMBIN, V6, P105

[9]

CAPOCELLI RM, IN PRESS J CRYPTOLOG, P101

[10]

Ito M., 1987, PROC IEEE GLOBAL TEL, P99

← 1 2 →