On Matroid Characterization of Ideal Secret Sharing Schemes

被引:0
|
作者
Jovan Dj. Golic
机构
[1] School of Electrical Engineering,
[2] University of Belgrade,undefined
来源
Journal of Cryptology | 1998年 / 11卷
关键词
Key words. Ideal secret sharing schemes, Matroids, Access structures.;
D O I
暂无
中图分类号
学科分类号
摘要
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 field. Access structure characterization of connected binary ideal schemes is established and a general method for their construction is pointed out.
引用
收藏
页码:75 / 86
页数:11
相关论文
共 50 条
  • [41] Explication of secret sharing schemes
    Stinson, D.R.
    Designs, Codes, and Cryptography, 1992, 2 (04)
  • [42] Strongly Secure Ramp Secret Sharing Schemes from Any Linear Secret Sharing Schemes
    Eriguchi, Reo
    Kunihiro, Noboru
    2019 IEEE INFORMATION THEORY WORKSHOP (ITW), 2019, : 264 - 268
  • [43] Visual secret sharing schemes for plural secret images
    Iwamoto, M
    Yamamoto, H
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 283 - 283
  • [44] Verifiable Secret Redistribution for Proactive Secret Sharing Schemes
    于佳
    孔凡玉
    李大兴
    Journal of Shanghai Jiaotong University(Science), 2006, (02) : 236 - 241
  • [45] Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
    Jaume Martí-Farré
    Carles Padró
    Designs, Codes and Cryptography, 2009, 52 : 1 - 14
  • [46] Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
    Marti-Farre, Jaume
    Padro, Carles
    SECURITY AND CRYPTOGRAPHY FOR NETWORKS, PROCEEDINGS, 2006, 4116 : 201 - 215
  • [47] Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
    Marti-Farre, Jaume
    Padro, Carles
    DESIGNS CODES AND CRYPTOGRAPHY, 2009, 52 (01) : 1 - 14
  • [48] On general perfect secret sharing schemes
    Blakley, GR
    Kabatianski, GA
    ADVANCES IN CRYPTOLOGY - CRYPTO '95, 1995, 963 : 367 - 371
  • [49] Security of Selected Secret Sharing Schemes
    Ogiela, Urszula
    Takizawa, Makoto
    Ogiela, Lidia
    INNOVATIVE MOBILE AND INTERNET SERVICES IN UBIQUITOUS COMPUTING, IMIS-2017, 2018, 612 : 395 - 400
  • [50] Unconditionally-secure ideal robust secret sharing schemes for threshold and multilevel access structure
    Jhanwar, Mahabir P.
    Safavi-Naini, Reihaneh
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2013, 7 (04) : 279 - 296