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 条

[21] Universally ideal secret-sharing schemes
Beimel, Amos, 1600, IEEE, Piscataway, NJ, United States (40):
[22] On ideal homomorphic secret sharing schemes and their decomposition
Fatemeh Ghasemi
Reza Kaboli
Shahram Khazaei
Maghsoud Parviz
Mohammad-Mahdi Rafiei
Designs, Codes and Cryptography, 2021, 89 : 2079 - 2096
[23] On ideal homomorphic secret sharing schemes and their decomposition
Ghasemi, Fatemeh
Kaboli, Reza
Khazaei, Shahram
Parviz, Maghsoud
Rafiei, Mohammad-Mahdi
DESIGNS CODES AND CRYPTOGRAPHY, 2021, 89 (09) : 2079 - 2096
[24] On the Composition of Matroids and Ideal Secret Sharing Schemes
Siaw-Lynn Ng
Michael Walker
Designs, Codes and Cryptography, 2001, 24 : 49 - 67
[25] Ideal Composite Modular Secret Sharing Schemes
Shenets, N. N.
AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2015, 49 (08) : 798 - 802
[26] Ideal secret sharing schemes from permutations
Pieprzyk, Josef
Zhang, Xian-Mo
International Journal of Network Security, 2006, 2 (03) : 238 - 244
[27] On the composition of matroids and ideal secret sharing schemes
Ng, SL
Walker, M
DESIGNS CODES AND CRYPTOGRAPHY, 2001, 24 (01) : 49 - 67
[28] Ideal Secret Sharing Schemes with Share Selectability
Emura, Keita
Miyaji, Atsuko
Nomura, Akito
Rahman, Mohammad Shahriar
Soshi, Masakazu
INFORMATION AND COMMUNICATIONS SECURITY, 2011, 7043 : 143 - +
[29] A new method for constructing multiple assignment schemes for generalized secret sharing
Horng, G
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2001, 17 (06) : 959 - 965
[30] Optimal multiple assignment scheme for strongly secure ramp secret sharing schemes with general access structures
Matsumoto, Ryutaroh
IEICE COMMUNICATIONS EXPRESS, 2015, 4 (11): : 317 - 320

← 1 2 3 4 5 →