General information dispersal based on the Chinese remainder theorem

被引：0

作者：

Iftene, Sorin ^{[1
]}

机构：

[1] Alexandru Ioan Cuza Univ, Fac Comp Sci, Iasi, Romania

来源：

INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL | 2006年 / 1卷

关键词：

information dispersal; secret sharing; Chinese remainder theorem;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Information dispersal was introduced by Rabin [18] as a solution for the problem of splitting an information into n fragments such that the information can be reconstructed from any k fragments (1 <= k <= n). Beguin and Cresti [2, 3] extended it to more general access structures. In this paper we present a new general information dispersal scheme based on the Chinese remainder theorem.

引用

页码：274 / 279

页数：6

共 19 条

[11] Garner HarveyL., 1959, IRE Transactions on Electronic Computers, VEC -8, P140, DOI DOI 10.1109/TEC.1959.5219515
[12] ITO M, 1987, P IEEE GLOB TEL C GL, V87, P99
[13] KRAWCZYK H, 1994, LECT NOTES COMPUTER, V773
[14] MIGNOTTE M, 1983, LECT NOTES COMPUT SC, V149, P371
[15] Ore O., 1952, AM MATH MONTHLY, V59, P365, DOI DOI 10.1080/00029890.1952.11988142
[16] IMPROVED ALGORITHM FOR COMPUTING LOGARITHMS OVER GF(P) AND ITS CRYPTOGRAPHIC SIGNIFICANCE
POHLIG, SC
HELLMAN, ME
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (01) : 106 - 110
[17] QUISQUATER JJ, 1982, IEE ELECT LETT, V18, P905
[18] EFFICIENT DISPERSAL OF INFORMATION FOR SECURITY, LOAD BALANCING, AND FAULT TOLERANCE
RABIN, MO
[J]. JOURNAL OF THE ACM, 1989, 36 (02) : 335 - 348
[19] HOW TO SHARE A SECRET
SHAMIR, A
[J]. COMMUNICATIONS OF THE ACM, 1979, 22 (11) : 612 - 613

← 1 2 →