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 条
  • [1] [Anonymous], 2000, Graduate Texts in Mathematics
  • [2] A MODULAR APPROACH TO KEY SAFEGUARDING
    ASMUTH, C
    BLOOM, J
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) : 208 - 210
  • [3] General information dispersal algorithms
    Beguin, P
    Cresti, A
    [J]. THEORETICAL COMPUTER SCIENCE, 1998, 209 (1-2) : 87 - 105
  • [4] BEGUIN P, 1995, LECT NOTES COMPUTER, V921, P194
  • [5] BENALOH J, 1990, LECT NOTES COMPUT SC, V403, P27
  • [6] Blakley G. R., 1979, AFIPS Conference Proceedings, vol.48. 1979 National Computer Conference, P313, DOI 10.1109/MARK.1979.8817296
  • [7] Cramer R, 1996, LECT NOTES COMPUT SC, V1070, P72
  • [8] Desmedt Y, 1998, LECT NOTES COMPUT SC, V1396, P158, DOI 10.1007/BFb0030418
  • [9] Ding C., 1996, Chinese remainder theorem: Applications in computing, coding, cryptography
  • [10] FRAENKEL AS, 1963, P AM MATH SOC, V14, P790
12