Rearrangements of access structures and their realizations in secret sharing schemes

被引：1
|
作者：
Zhang, Zhifang [1 ]
Liu, Mulan [1 ]
Xiao, Liangliang [2 ]
机构：
[1] Chinese Acad Sci, Key Lab Math Mechanizat, Acad Math & Syst Sci, Beijing 100080, Peoples R China
[2] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
来源：
DISCRETE MATHEMATICS | 2008年 / 308卷 / 21期
基金：
中国国家自然科学基金;
关键词：
perfect secret sharing scheme; statistical secret sharing scheme; computational secret sharing scheme; rearrangement of access structures;
D O I：
10.1016/j.disc.2007.09.007
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Firstly, the definitions of the secret sharing schemes (SSS), i.e. perfect SSS, statistical SSS and computational SSS are given in an uniform way, then some new schemes for several familiar rearrangements of access structures with respect to the above three types of SSS are constructed from the old schemes. It proves that the new schemes and the old schemes are of the same security. A method of constructing the SSS which realizes the general access structure by rearranging some basic access structures is developed. The results of this paper can be used to key managements and access controls. (c) 2007 Elsevier B.V. All rights reserved,
引用
收藏
页码：4882 / 4891
页数：10
相关论文
共 50 条
  • [41] Dynamic access policies for unconditionally secure secret sharing schemes
    Martin, KM
    [J]. 2005 IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005, : 61 - 66
  • [42] Secret Sharing Schemes with Detection of Cheaters for a General Access Structure
    Sergio Cabello
    Carles Padró
    Germán Sáez
    [J]. Designs, Codes and Cryptography, 2002, 25 : 175 - 188
  • [43] Secret sharing schemes with detection of cheaters for a general access structure
    Cabello, S
    Padró, C
    Sáez, G
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2002, 25 (02) : 175 - 188
  • [44] A note on secret sharing schemes with three homogeneous access structure
    Marti-Farre, Jaume
    [J]. INFORMATION PROCESSING LETTERS, 2007, 102 (04) : 133 - 137
  • [45] On secret sharing schemes
    Blundo, C
    De Santis, A
    Vaccaro, U
    [J]. INFORMATION PROCESSING LETTERS, 1998, 65 (01) : 25 - 32
  • [46] Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures
    Aggarwal, Divesh
    Damgard, Ivan
    Nielsen, Jesper Buus
    Obremski, Maciej
    Purwanto, Erick
    Ribeiro, Joao
    Simkin, Mark
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT II, 2019, 11693 : 510 - 539
  • [47] Optimal multiple assignment scheme for strongly secure ramp secret sharing schemes with general access structures
    Matsumoto, Ryutaroh
    [J]. IEICE COMMUNICATIONS EXPRESS, 2015, 4 (11): : 317 - 320
  • [48] Asymptotically ideal Chinese remainder theorem -based secret sharing schemes for multilevel and compartmented access structures
    Tiplea, Ferucio Laurentiu
    Dragan, Constantin Catalin
    [J]. IET INFORMATION SECURITY, 2021, 15 (04) : 282 - 296
  • [49] On secret reconstruction in secret sharing schemes
    Wang, Huaxiong
    Wong, Duncan S.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (01) : 473 - 480
  • [50] Evolving Homomorphic Secret Sharing for Hierarchical Access Structures
    Phalakarn, Kittiphop
    Suppakitpaisarn, Vorapong
    Attrapadung, Nuttapong
    Matsuura, Kanta
    [J]. ADVANCES IN INFORMATION AND COMPUTER SECURITY, IWSEC 2021, 2021, 12835 : 77 - 96
12345