Optimal Multiple Assignment Schemes Using Ideal Multipartite Secret Sharing Schemes

被引：0
|
作者：
Eriguchi, Reo [1 ]
Kunihiro, Noboru [2 ]
Iwamoto, Mitsugu [3 ]
机构：
[1] Univ Tokyo, Dept Complex Sci & Engn, Tokyo, Japan
[2] Univ Tokyo, Dept Comp Sci, Tokyo, Japan
[3] Univ Electrocommun, Dept Informat, Chofu, Tokyo, Japan
来源：
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2019年
关键词：
D O I：
10.1109/isit.2019.8849591
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A multiple assignment scheme (MAS) is a method to construct secret sharing schemes (SSSs) for general access structures. There are MASs using threshold and ramp SSSs. The paper proposes new MASs using ideal SSSs realizing compartmented access structures and those using SSSs realizing multi-level access structures. Since the ideal SSSs realizing compartmented access structures and SSSs realizing multi-level access structures are natural generalizations of threshold and ramp SSSs, respectively, the new MASs cannot be less efficient than those using threshold or ramp SSSs.
引用
收藏
页码：3047 / 3051
页数：5
相关论文
共 50 条
  • [31] Optimal multiple assignments based on integer programming in secret sharing schemes
    Iwamoto, M
    Yamamoto, H
    Ogawa, H
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 16 - 16
  • [32] Generation of key predistribution schemes using secret sharing schemes
    Sáez, G
    DISCRETE APPLIED MATHEMATICS, 2003, 128 (01) : 239 - 249
  • [33] On secret sharing schemes
    Blundo, C
    De Santis, A
    Vaccaro, U
    INFORMATION PROCESSING LETTERS, 1998, 65 (01) : 25 - 32
  • [34] Ideal homomorphic secret sharing schemes over cyclic groups
    刘木兰
    周展飞
    Science in China(Series E:Technological Sciences), 1998, (06) : 650 - 660
  • [35] Ideal homomorphic secret sharing schemes over cyclic groups
    Mulan Liu
    Zhanfei Zhou
    Science in China Series E: Technological Sciences, 1998, 41 : 650 - 660
  • [36] Ideal homomorphic secret sharing schemes over cyclic groups
    Liu, ML
    Zhou, ZF
    SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 1998, 41 (06): : 650 - 660
  • [37] Optimal Information Rate of Secret Sharing Schemes on Trees
    Csirmaz, Laszlo
    Tardos, Gabor
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (04) : 2527 - 2530
  • [38] On secret reconstruction in secret sharing schemes
    Wang, Huaxiong
    Wong, Duncan S.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (01) : 473 - 480
  • [39] Visual Secret Sharing Schemes Encrypting Multiple Images
    Sasaki, Manami
    Watanabe, Yodai
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2018, 13 (02) : 356 - 365
  • [40] Ideal and Computationally Perfect Secret Sharing Schemes for Generalized Access Structures
    Pattipati, Dileep Kumar
    Tentu, Appala Naidu
    Venkaiah, V. Ch.
    SECURITY IN COMPUTING AND COMMUNICATIONS, 2014, 467 : 149 - 161
12345