Robust threshold schemes based on the Chinese Remainder Theorem

被引：0

作者：

Kaya, Kamer ^{[1
]}

Selcuk, Ali Aydm ^{[1
]}

机构：

[1] Bilkent Univ, Dept Comp Engn, TR-06800 Ankara, Turkey

来源：

PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2008 | 2008年 / 5023卷

关键词：

threshold cryptography; robustness; RSA; ElGamal; Paillier; Chinese Remainder Theorem;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Recently, Chinese Remainder Theorem (CRT) based function sharing schemes are proposed in the literature. In this paper, we investigate how a CRT-based threshold scheme can be enhanced with the robustness property. To the best of our knowledge, these are the first robust threshold cryptosystems based on a CRT-based secret sharing.

引用

页码：94 / 108

页数：15

共 22 条

[1] [Anonymous], LNCS
[2] A MODULAR APPROACH TO KEY SAFEGUARDING
ASMUTH, C
BLOOM, J
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) : 208 - 210
[3] Bellare M., 1995, P 1 ACM C COMPUTER C, P62
[4] Blakley G., 1979, P AFIPS NAT COMP C
[5] Boudot F, 1999, LECT NOTES COMPUT SC, V1726, P87
[6] CHAUM D, 1988, LECT NOTES COMPUT SC, V304, P127
[7] Cramer R., 2000, ACM Transactions on Information and Systems Security, V3, P161, DOI 10.1145/357830.357847
[8] de Santis A., 1994, Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, P522, DOI 10.1145/195058.195405
[9] DESMEDT Y, 1992, LECT NOTES COMPUT SC, V576, P457
[10] DESMEDT Y, 1990, LECT NOTES COMPUT SC, V435, P307

← 1 2 3 →