基于離散對數(shù)的動態(tài)(k,n)-門限方案
A Daynamic (k,n)-threshold secret sharing scheme based on discrete logarithm
-
摘要: 該文給出了一個基于離散對數(shù)的動態(tài)(k,n)一門限方案,它具有下述特點:(1)每個成員的子密鑰可無限制地多次使用;(2)能夠確認欺騙者;(3)當某個成員的子密鑰泄密時,系統(tǒng)只須為該成員重新分配子密鑰而不必更改其它成員的子密鑰;(4)系統(tǒng)可以很方便地增加或刪除一個成員;(5)恢復系統(tǒng)密鑰時,采用并行過程。Abstract: A dynamic (k,n)-threshold secret sharing scheme based on discrete logarithm is proposed in this paper. It can reconstruct the different system secrets for many times without any restriction. Any cheater can be checked out. When some participants secret sharing values are revealed, they can be renewed without any effect on the others. It is convenient to add or to delete one or more participants. The system secret can be recovered with a parallel process.
-
A. Shamir , How to share a secret, Commun. ACM, 1979, 22(11), 612-613.[2]G.R. Blackley, Safeguarding cryptographic keys, Proc. Nat. Computer Conf. AFIPS Conf.Proc., USA, 1979, 313-317.[3]E.D. Karnin, J. W. Green, M. E. Hellman, On secret sharing systems, IEEE Trans. on IT, 1983,24(1), 231-241.[4]He. J., E. Dawson, Multistage secret sharing based on one-way function, Electron. Lett., 1994,30(19), 1591-1592.[5]L. Harn, Comment: Multistage secret sharing based on one-way function, Electron. Lett., 1995,31, (4), 262-263.[6]劉煥平,楊義先,楊放春,基于單向函數(shù)的多級密鑰共享方案,電子科學學刊,1999,21(4),561-564.[7]R.G.E.Pinch,Online multiple secret sharing,Electron.Lett.,1996,32(12),1087-1088.[8]譚凱軍,諸鴻文,基于單向函數(shù)的動態(tài)秘密分享機制,通信學報,1999,20(7),81-84. -
計量
- 文章訪問數(shù): 2199
- HTML全文瀏覽量: 132
- PDF下載量: 706
- 被引次數(shù): 0
下載:
