期刊文献+

无需可信机构的秘密分享成员扩充方案

An Expansion Scheme for Secret Sharing Members Without the Trusted Institution
下载PDF
导出
摘要 网络安全中,秘密分享体制的应用非常广泛。应用中,群组成员的个数常发生变化,如果每次变化时都要更新或重新分割,必然会给密钥管理增加很多困难,并带来较大的计算和通信代价。本文针对群组中新成员的加入提出了新的部分密钥生成算法,该算法无需可信机构,无需改动原先的秘密分配,满足安全性。 Secret sharing is widely used in network security. We can not refresh the secret S or divide S again due to the difficulty of secret management and large amount of calculations and communications. In this paper, we propose a new algorithm to distribute new secret shadows to new group members. Without the trusted center, this algorithm only needs small broadcasting cost and fits the safety requirements.
出处 《计算机工程与科学》 CSCD 2004年第2期23-24,35,共3页 Computer Engineering & Science
关键词 网络安全 秘密分享算法 密钥 可信机构 网络通信 secret sharing member affiliation trusted institution
  • 相关文献

参考文献5

  • 1[1]Y Desmedt. Some Recent Research Aspects of Threshold Cryptography[A]. Information Security, Volume 1396 of Lecture Notes in Computer Science[C]. 1997. 158-173. 被引量:1
  • 2[2]Camenisch J, Stadler M. Efficient Group Signatures Schemes for Large Groups[A]. Advances in Cryptology (CRYPT'97)[C]. 1997. 410-423. 被引量:1
  • 3[3]A Shamir. How to Share a Secret[J]. Communications of the ACM, 1979,22(11):612-613. 被引量:1
  • 4[4]T ElGamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms[J]. IEEE Trans IT, 1985,31(4):469-472. 被引量:1
  • 5[5]H Luo, S Lu. Ubiquitous and Robust Authentication Services for Ad Hoc Wireless Networks[R]. Technical Report TR-200030, Dept of Computer Science, UCLA, 2000. 被引量:1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部