首页 | 本学科首页   官方微博 | 高级检索  
     

改进的基于离散对数的群签名方案
引用本文:林松,何德全. 改进的基于离散对数的群签名方案[J]. 计算机工程与应用, 2005, 41(18): 139-142,165
作者姓名:林松  何德全
作者单位:四川大学,成都,610064;中国工程院,北京,100038
摘    要:该文根据求解离散对数问题的困难性和Schnorr签名方案的安全性,参考现有的一种群签名方案,研究群签名技术在电子支付实践中的应用。受该方案的启发,通过详细分析该签名方案的优点和不足之处,提出了一种改进的基于离散对数的群签名方案,新方案完全符合群签名形式化定义,具有效率高、安全性强等特点,从而可以构造一些新型的电子支付安全系统。

关 键 词:群签名  离散对数  电子支付
文章编号:1002-8331-(2005)18-0139-04

Improved Group Signature Solution Based on Discrete Logarithm
LIN Song,He Dequan. Improved Group Signature Solution Based on Discrete Logarithm[J]. Computer Engineering and Applications, 2005, 41(18): 139-142,165
Authors:LIN Song  He Dequan
Affiliation:Lin Song1 He Dequan2 1
Abstract:In this paper,the application of the technology of Group Signature in electronic payment activities is studied against the difficulty of resolving Discrete Logarithm and the security of Schnorr Signature Solution,with reference of a currently existing Group Signature solution.With the help of analyzing its advantages and disadvantages,an improved Group Signature solution based on Discrete Logarithm is developed.The new resolution is fully in conformity with the definition of group signature formalization.Because of its high efficiency and security,it can be used to build new electronic payment security systems.
Keywords:group signature  discrete logarithm  electronic payment
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号