Secret Sharing Schemes with Three or Four Minimal Qualified Subsets

被引:0
|
作者
Jaume Martí-Farré
Carles Padró
机构
[1] Universitat Politècnica de Catalunya,Dept. Matemàtica Aplicada IV
[2] Universitat Politècnica de Catalunya,Dept. Matemàtica Aplicada IV
来源
Designs, Codes and Cryptography | 2005年 / 34卷
关键词
cryptography; secret sharing schemes; information rate; ideal schemes;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper we study secret sharing schemes whose access structure has three or four minimal qualified subsets. The ideal case is completely characterized and for the non-ideal case we provide bounds on the optimal information rate.
引用
收藏
页码:17 / 34
页数:17
相关论文
共 50 条
  • [41] Combinatorial interpretation of secret sharing schemes
    Kurosawa, K
    Okada, K
    ADVANCES IN CRYPTOLOGY - ASIACRYPT '94, 1995, 917 : 55 - 64
  • [42] Reusing shares in secret sharing schemes
    Zheng, Yuliang, 1600, (37):
  • [43] Probability of shares in secret sharing schemes
    Dipto. di Info. Ed Applicazioni, Univ. di Salerno, 84081 , Baronissi, Italy
    Inf Process Lett, 5-6 (169-175):
  • [44] Ideal multipartite secret sharing schemes
    Farras, Oriol
    Marti-Farre, Jaume
    Padro, Carles
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2007, 2007, 4515 : 448 - +
  • [45] On multiplicative linear secret sharing schemes
    Nikov, V
    Nikova, S
    Preneel, B
    PROGRESS IN CRYPTOLOGY -INDOCRYPT 2003, 2003, 2904 : 135 - 147
  • [46] Probability of shares in secret sharing schemes
    Blundo, C
    De Santis, A
    Gaggia, AG
    INFORMATION PROCESSING LETTERS, 1999, 72 (5-6) : 169 - 175
  • [47] The Latin squares and the secret sharing schemes
    Chum, Chi Sing
    Zhang, Xiaowen
    GROUPS COMPLEXITY CRYPTOLOGY, 2010, 2 (02) : 175 - 202
  • [49] On secret sharing schemes, matroids and polymatroids
    Marti-Farre, Jaume
    Padro, Carles
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2010, 4 (02) : 95 - 120
  • [50] SOME IDEAL SECRET SHARING SCHEMES
    BRICKELL, EF
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 434 : 468 - 475