Efficient secret sharing schemes realizing general access structures

被引：0

作者：

Tochikubo, K ^{[1
]}

机构：

[1] Tokyo Inst Technol, Dept Commun & Integrated Syst, Tokyo 152, Japan

[2] Toshiba Co Ltd, Syst Integrat Technol Ctr, Tokyo, Japan

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2004年 / E87A卷 / 07期

关键词：

(k; n)-threshold scheme; multiple assignment secret sharing scheme; general access structure;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In 1987, Ito, Saito and Nishizeki proposed a secret sharing scheme realizing general access structures, called the multiple assignment secret sharing scheme (MASSS). In this paper, we propose new MASSS's which are perfect secret sharing schemes and include Shamir's (k, n)-threshold schemes as a special case. Furthermore, the proposed schemes are more efficient than the original MASSS from the viewpoint of the number of shares distributed to each participant.

引用

页码：1788 / 1797

页数：10

共 50 条

[41] Secure and Efficient Secret Sharing Scheme with General Access Structures Based on Elliptic Curve and Pairing
V. P. Binu
A. Sreekumar
Wireless Personal Communications, 2017, 92 : 1531 - 1543
[42] Secure and Efficient Secret Sharing Scheme with General Access Structures Based on Elliptic Curve and Pairing
Binu, V. P.
Sreekumar, A.
WIRELESS PERSONAL COMMUNICATIONS, 2017, 92 (04) : 1531 - 1543
[43] On general perfect secret sharing schemes
Blakley, GR
Kabatianski, GA
ADVANCES IN CRYPTOLOGY - CRYPTO '95, 1995, 963 : 367 - 371
[44] Quantum Optimal Multiple Assignment Scheme for Realizing General Access Structure of Secret Sharing
Matsumoto, Ryutaroh
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2017, E100A (02): : 726 - 728
[45] Secure publicly verifiable and proactive secret sharing schemes with general access structure
Mashhadi, Samaneh
INFORMATION SCIENCES, 2017, 378 : 99 - 108
[46] Optimal linear secret sharing schemes for graph access structures on six participants
Gharahi, Motahhareh
Khazaei, Shahram
THEORETICAL COMPUTER SCIENCE, 2019, 771 : 1 - 8
[47] Verifiable multi-secret sharing schemes for multiple threshold access structures
Tartary, Christophe
Pieprzyk, Josef
Wang, Huaxiong
INFORMATION SECURITY AND CRYPTOLOGY, 2008, 4990 : 167 - +
[48] DECOMPOSITION CONSTRUCTION FOR SECRET SHARING SCHEMES WITH GRAPH ACCESS STRUCTURES IN POLYNOMIAL TIME
Sun, Hung-Min
Wang, Huaxiong
Ku, Bying-He
Pieprzyk, Josef
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (02) : 617 - 638
[49] Secret sharing schemes with bipartite access structure
Padrö, Carles
Sâez, German
2000, IEEE, Piscataway, NJ, United States (46)
[50] Secret sharing schemes with bipartite access structure
Padró, C
Sáez, G
ADVANCES IN CRYPTOLOGY - EUROCRYPT '98, 1998, 1403 : 500 - 511

← 1 2 3 4 5 →