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 条
  • [31] Lower bounds on the information rate of secret sharing schemes with homogeneous access structure
    Padró, C
    Sáez, G
    INFORMATION PROCESSING LETTERS, 2002, 83 (06) : 345 - 351
  • [32] On the optimization of bipartite secret sharing schemes
    Farras, Oriol
    Metcalf-Burton, Jessica Ruth
    Padro, Carles
    Vazquez, Leonor
    DESIGNS CODES AND CRYPTOGRAPHY, 2012, 63 (02) : 255 - 271
  • [33] Secret sharing schemes with detection of cheaters for a general access structure
    Cabello, S
    Padró, C
    Sáez, G
    DESIGNS CODES AND CRYPTOGRAPHY, 2002, 25 (02) : 175 - 188
  • [34] Secret sharing schemes with detection of cheaters for a general access structure
    Cabello, S
    Padró, C
    Sáez, G
    FUNDAMENTALS OF COMPUTATION THEORY, 1999, 1684 : 185 - 194
  • [35] Secret Sharing Schemes for (k, n)-Consecutive Access Structures
    Herranz, Javier
    Saez, German
    CRYPTOLOGY AND NETWORK SECURITY, CANS 2018, 2018, 11124 : 463 - 480
  • [36] Generation of key predistribution schemes using secret sharing schemes
    Sáez, G
    DISCRETE APPLIED MATHEMATICS, 2003, 128 (01) : 239 - 249
  • [37] Secret Sharing Schemes with Detection of Cheaters for a General Access Structure
    Sergio Cabello
    Carles Padró
    Germán Sáez
    Designs, Codes and Cryptography, 2002, 25 : 175 - 188
  • [38] The optimal information rate of quantum-secret-sharing schemes based on at most four participants
    Song, Yun
    Li, Zhi-Hui
    Li, Yong-Ming
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2014, 42 (10): : 1951 - 1956
  • [39] UNIVERSALLY IDEAL SECRET-SHARING SCHEMES
    BEIMEL, A
    CHOR, B
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (03) : 786 - 794
  • [40] Lower bounds for robust secret sharing schemes
    Blundo, C
    DeSantis, A
    INFORMATION PROCESSING LETTERS, 1997, 63 (06) : 317 - 321
12345