基于因子分解和離散對數(shù)的動態(tài)秘密分享方案
A Dynamic Secret Sharing Scheme Based on Factorization and Discrete Logarithms
-
摘要: 該文提出了一個安全性基于離散對數(shù)與因子分解的動態(tài)秘密分享方案.它具有如下優(yōu)點:(1)系統(tǒng)更新分享的秘密時,無需更新分享的子秘密,即子秘密可重復使用;(2)當系統(tǒng)增刪成員時,無需變更其他成員的子秘密;(3)當某個成員的子秘密泄露時,系統(tǒng)只需為該成員重新分配子秘密而不必更改其他成員的子秘密;(4)防止欺詐;(5)通信量較少,工作效率高.Abstract: A dynamic secret sharing scheme based on discrete logarithms and factorization is proposed in this paper. It has the following advanced properties: (1) The dealer can renew system secrets without renewing the shadows of the participants; (2) When the system accepts a new participant or fires a participant, the shadows of other participants would not change; (3) When some participants shadows are revealed ,they can be renewed without any effect on the others; (4) It can detect the cheater; (5) Comunication is reduced and work efficiency is improved.
-
Shamir A.How to share a secret[J].Communications of the ACM.1979,22(11):612-613[2]Blackley G R.Safeguarding cryptographic keys.In:Proceedings of the National Computer Conference of AFIPS,Montvale,1979,48:313-317.[3]Fouque P A,Poupard G,Sten J.Sharing decryption in the context of voting or lotteries.Proceedings of Financial Cryptography 2000.Berlin:Springer-Verlag,2000:90-104.[4]Brickell E F,Daveport D M.On the classification of idea secret sharing scheme.J.Cryptology,1991,4(2):123-134.[5]Tompa M,Woll H.How to share a secret with cheaters[J].J.Cryptology.1988,1(2):133-138[6]Chor B,Goldwasser S,Awerbuch B.Verifiable secret sharing and achieving simultaneity in the presence of faults.Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science,1985:383-395.[7]Stadler M.Publicly verifiable secret sharing.Advances in Cryptology-Eurocrypt96,Berlin:Springer-Verlag,1996:190-199.[8]Gennaro R,Micali S.Verifiable secret sharing as secure computation.Advances in CryptologyCrypto94.Berlin:Springer-Verlag,1995:168-182. -
計量
- 文章訪問數(shù): 2104
- HTML全文瀏覽量: 105
- PDF下載量: 723
- 被引次數(shù): 0
下載:
