On matroid characterization of ideal secret sharing schemes

被引：7
|
作者：
Golic, JD
机构：
[1] Univ Belgrade, Sch Elect Engn, YU-11001 Belgrade, Yugoslavia
[2] Queensland Univ Technol, Informat Secur Res Ctr, Brisbane, Qld, Australia
来源：
JOURNAL OF CRYPTOLOGY | 1998年 / 11卷 / 02期
关键词：
ideal secret sharing schemes; matroids; access structures;
D O I：
10.1007/s001459900036
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A characterization of ideal secret sharing schemes with an arbitrary number of keys is derived in terms of balanced maximum-order correlation immune functions. In particular, it is proved that a matroid is an associated matroid for a binary ideal secret sharing scheme if and only if it is representable over the binary held. Access structure characterization of connected binary ideal schemes is established and a general method for their construction is pointed out.
引用
收藏
页码：75 / 86
页数：12
相关论文
共 50 条
  • [21] Ideal secret sharing schemes from permutations
    Pieprzyk, Josef
    Zhang, Xian-Mo
    International Journal of Network Security, 2006, 2 (03) : 238 - 244
  • [22] On the composition of matroids and ideal secret sharing schemes
    Ng, SL
    Walker, M
    DESIGNS CODES AND CRYPTOGRAPHY, 2001, 24 (01) : 49 - 67
  • [23] Ideal secret sharing schemes with multipartite access structures
    Ng, SL
    IEE PROCEEDINGS-COMMUNICATIONS, 2006, 153 (02): : 165 - 168
  • [24] Optimal Multiple Assignment Schemes Using Ideal Multipartite Secret Sharing Schemes
    Eriguchi, Reo
    Kunihiro, Noboru
    Iwamoto, Mitsugu
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 3047 - 3051
  • [25] Ideal homomorphic secret sharing schemes over cyclic groups
    刘木兰
    周展飞
    Science in China(Series E:Technological Sciences), 1998, (06) : 650 - 660
  • [26] Ideal homomorphic secret sharing schemes over cyclic groups
    Mulan Liu
    Zhanfei Zhou
    Science in China Series E: Technological Sciences, 1998, 41 : 650 - 660
  • [27] Ideal homomorphic secret sharing schemes over cyclic groups
    Liu, ML
    Zhou, ZF
    SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 1998, 41 (06): : 650 - 660
  • [28] Common information, matroid representation, and secret sharing for matroid ports
    Michael Bamiloshin
    Aner Ben-Efraim
    Oriol Farràs
    Carles Padró
    Designs, Codes and Cryptography, 2021, 89 : 143 - 166
  • [29] Common information, matroid representation, and secret sharing for matroid ports
    Bamiloshin, Michael
    Ben-Efraim, Aner
    Farras, Oriol
    Padro, Carles
    DESIGNS CODES AND CRYPTOGRAPHY, 2021, 89 (01) : 143 - 166
  • [30] Improved upper bounds for the information rates of the secret sharing schemes induced by the Vamos matroid
    Metcalf-Burton, Jessica Ruth
    DISCRETE MATHEMATICS, 2011, 311 (8-9) : 651 - 662
12345