期刊文献+

关于子集和问题的故障停止式签名

Schemes of Fail - stop Signatures Based on Subset Problems
原文传递
导出
摘要 介绍了故障停止式签名方案(FSS),并提出了基于子集和问题的故障停止式签名方案,本方案仍然是一次性签名方案,优点是签名一个比特仅需要一个密钥,最后给出了其安全性分析。 This paper introduces the Fail - stop signature schemes, and presents the schemes based on the Subset sum problems, which is also one - time schemes, the schemes have the advantage that it sign a bit by only one bit, finally, the security analysis is given.
出处 《信息安全与通信保密》 2000年第3期60-63,74,共5页 Information Security and Communications Privacy
关键词 子集和问题 故障停止式签名 安全 subset sum, fail - stop signature, security
  • 相关文献

参考文献4

  • 1[1]Waideerr M, Pfitzmann B. The dining cryptographers in the disco: unconditional sender and recipient intractability with computationally secure serviceability. In: Proceedings of Eurocrypt' 89, LNCS. 434, Berlin: Springer-Verlag, 1990:690
  • 2[2]Impagliazzo R, Naor M. Efficient cryptographic schemes provably as secure as subset sum. J Cryptology, 1996:199~216
  • 3[3]van Heijst E, Pedersen T P, Pfitzann B. New constructions of fail-stop signatures and lower bounds. In:Proceedings of Crypto'92. LNCS, 740, Berlin: Springerverlag, 1993:15~30
  • 4[4]Pedersen T P, Pfitzmann B. Fail-stop signatures. SIAM Journal on Computing, February 1997

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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