Efficient secret sharing schemes based on authorized subsets

被引：21
|
作者：
Tochikubo, K [1 ]
Uyematsu, T
Matsumoto, R
机构：
[1] Tokyo Inst Technol, Dept Commun & Integrated Syst, Tokyo 1528550, Japan
[2] Toshiba Solut Corp, Syst Integrat Technol Ctr, Tokyo 1838512, Japan
[3] Tokyo Inst Technol, Dept Commun & Integrated Syst, Tokyo 1528550, Japan
来源：
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2005年 / E88A卷 / 01期
关键词：
(k; n)-threshold scheme; general access structure; verifiable secret sharing scheme;
D O I：
10.1093/ietfec/E88-A.1.322
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We propose efficient secret sharing schemes realizing general access structures. Our proposed, schemes are perfect secret sharing schemes and include Shamir's (k,n)-threshold schemes as a special case. Furthermore, we show that a verifiable secret sharing scheme for general access structures is realized by one of the proposed schemes.
引用
收藏
页码：322 / 326
页数：5
相关论文
共 50 条
  • [1] A Construction Method of Secret Sharing Schemes Based on Authorized Subsets
    Tochikubo, Kouya
    [J]. 2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3, 2008, : 394 - 399
  • [2] Efficient Secret Sharing Schemes Based on Unauthorized Subsets
    Tochikubo, Kouya
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008, E91A (10) : 2860 - 2867
  • [3] Efficient Secret Sharing Schemes
    Lv, Chunli
    Jia, Xiaoqi
    Lin, Jingqiang
    Jing, Jiwu
    Tian, Lijun
    Sun, Mingli
    [J]. SECURE AND TRUST COMPUTING, DATA MANAGEMENT, AND APPLICATIONS, 2011, 186 : 114 - +
  • [4] Secret sharing schemes with three or four minimal qualified subsets
    Martí-Farré, J
    Padró, C
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2005, 34 (01) : 17 - 34
  • [5] Secret Sharing Schemes with Three or Four Minimal Qualified Subsets
    Jaume Martí-Farré
    Carles Padró
    [J]. Designs, Codes and Cryptography, 2005, 34 : 17 - 34
  • [6] An algorithm for efficient geometric secret sharing schemes
    Jackson, WA
    Martin, KM
    [J]. UTILITAS MATHEMATICA, 1998, 54 : 127 - 150
  • [7] Efficient multiple assignment secret sharing schemes
    Tochikubo, Kouya
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 461 - +
  • [8] Optimal complexity of secret sharing schemes with four minimal qualified subsets
    Marti-Farre, Jaume
    Padro, Carles
    Vazquez, Leonor
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2011, 61 (02) : 167 - 186
  • [9] Optimal complexity of secret sharing schemes with four minimal qualified subsets
    Jaume Martí-Farré
    Carles Padró
    Leonor Vázquez
    [J]. Designs, Codes and Cryptography, 2011, 61 : 167 - 186
  • [10] Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
    Chen, Qi
    Tang, Chunming
    Lin, Zhiqiang
    [J]. ADVANCES IN CRYPTOLOGY - ASIACRYPT 2019, PT II, 2019, 11922 : 505 - 536
12345