A Secret Sharing Shuffling Scheme Based on Polynomial

被引：6

作者：

Zhang, Xi ^{[1
]}

Zhang, Lei ^{[1
]}

Zhang, Quan ^{[1
]}

Tang, Chaojing ^{[1
]}

机构：

[1] Natl Univ Def Technol, Coll Elect Sci & Engn, Changsha 410073, Hunan, Peoples R China

来源：

2008 INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, VOLS 1-4 | 2008年

关键词：

partial shuffling scheme; secret sharing; dynamic correction mechanism; adversary; threshold protocol;

D O I：

10.1109/ICINFA.2008.4608288

中图分类号：

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

学科分类号：

0812 ;

摘要：

The threshold protocol based on polynomial needs shuffling scheme to share the secret securely. For avoiding the complexity on communication and operation of the complete-shuffling scheme, this scheme applies brief shuffling algorithm. This paper introduces random order sequence via the dynamic attribute of the feedback time and presents a partial-shuffling scheme. In order to defense the adversary attack against secret sharing process, a kind of dynamic correction mechanism is designed. Performance evaluation shows that the partial-shuffling scheme greatly decreases the secret sharing time and improves the efficiency, while the threshold and the adversary appearance probability are increasing.

引用

页码：1746 / 1750

页数：5

共 13 条

[1] ALON N, 1995, P EUR S ALG, P523
[2] Blakley B., 1993, Advances in Cryptology - CRYPTO '92. 12th Annual International Cryptology Conference Proceedings, P540
[3] de Santis A., 1994, Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, P522, DOI 10.1145/195058.195405
[4] FELDMAN P, 1987, P 28 IEEE S FDN COMP, P427
[5] Gemmell PS, 1997, CRIPTOBYTES TECHNICA, V2, P7
[6] Herzberg A, 1995, LECT NOTES COMPUT SC, V963, P339
[7] HESS A, 2002, PERFORMANCE EVALUATI
[8] Kong JJ, 2001, NETWORK PROTOCOLS, P251, DOI 10.1109/ICNP.2001.992905
[9] Luo, 2000, UCLACSDTR200030
[10] MCNAIR J, 2001, HANDOFF REAL TIME TR

← 1 2 →