论文标题:群签名及其在电子现金中的应用研究
Group Signature and Its Applications in Electronic Cash
论文作者
论文导师 胡予濮,论文学位 硕士,论文专业 密码学
论文单位 西安电子科技大学,点击次数 147,论文页数 51页File Size7495K
2006-01-01论文网 http://www.lw23.com/lunwen_341859962/
group signature; electronic cash; anonymous control; revocation; coalition-resistant
随着现代信息社会的快速发展,尤其是计算机通信网的快速普及,数字签名技术在信息社会应用的越来越广泛。群签名是一种特殊的数字签名,他允许群组成员匿名的代表群组实现签名,验证者无法确定签名由群组中哪个成员签署。而在有争议时,可以由一个群管理员打开签名,确定签名者的身份。由于群签名不仅提供签名的匿名性而且实现了匿名控制功能,因此群签名可以被广泛的应用于企业管理、电子商务、电子政务、军事等领域。然而群签名的安全性和效率成为群签名应用的瓶颈。许多安全的群签名效率较低,并且许多已有的群签名不支持成员撤销或成员撤销效率很低,不适合大群组应用。另外许多效率较高的群签名被发现存在安全问题。因此设计安全、高效的群签名(或成员撤销算法),对已有的群签名进行安全性分析,是群签名领域的两个重要问题。本文讨论了几个群签名方案的安全性,并提出了一个新的群签名体制。 本文的另一部分工作是关于群签名在电子现金中的应用。电子现金作为电子商务的重要内容,是实现电子支付的重要工具。它允许顾客实现匿名消费,可以有效的防止重复消费,同时为了防止敲诈、洗钱等非法行为,公平电子现金还要求实现现金追踪和现金所有者追踪的匿名控制功能。盲签名和群签名是设计电子现金的两个重要工具。这一部分主要工作是讨论群签名在电子现金中的应用。在本文的研究工作中,利用到了知识签名、Elgamal加密对、中国剩余定理、Schnorr签名等工具。对已有方案或算法的安全性分析,我们主要从联合攻击和伪造攻击两个方面考察群签名算法的安全性。 在前人研究的基础上,在群签名领域主要取得如下研究成果: 1:提出了一个新的群签名体制。 2:讨论了一个基于中国剩余定理的高效群签名方案的安全性,指出它不能防止联合攻击,同时给出了该方案的改进方案,并证明改进方案可以有效地防止联合攻击。 3:对一个高效的群成员撤销算法的安全性进行分析,指出该算法不能有效的防止已经撤销的群成员继续生成签名,而不被验证者发现。即存在伪造攻击。 4:利用一个安全的群签名方案设计了一个高效公平电子现金系统。与前人的研究成果比较,该方案具有安全、高效的特点。能有效的防止重复消费,具有现金追踪功能和现金所有者追踪功能,能有效防止敲诈等犯罪行为。效率上它缩小了签名的长度,降低了银行、顾客和商家的计算量。最后给出方案的安全性证明。
With the rapid development of information science and technology, digital signatures find more and more application in our lives. The group signature, a special signature scheme, can allow any member of the group to sign on the behalf of the whole group. Any one who know the group public key is able to verify whether the signature is legitimate or not, but he can not know who sign the signature. If any dispute, there is group manager who can open the signature to reveal the identity of the actual signer. As group signatures are anonymous and also are anonymous control, for these characteristcs, group signature can be used in government, business, and military. However, security and efficiency make group signature hard to use in social. Many group signature schemes are insecurity, And others security group signature schemes is unefficient. Especially some group signature schemes cannot allow member revocation. Though some group schemes have member revocation algorithm, the algorithm is unefficient. These made group signatures hard to use in large group. So propose secure and efficient group signature and attack group signature are two important questions on group signature field. The main work of us is to solve these problems. The other work is about how to propose electronic cash scheme based group signature, as an important tool in electronic payment systems, E-cash (electronic cash) allow customers to pay anonymously. We propose a new fair E-cash scheme based on a secure group signature. Our scheme has many good characteristics: such as high efficiency, support cash tracing and owner tracing, and secure in standard assumptions, etc. When we proposed group signature or E-cash scheme, We use tools such as the knowledge prove, Elgamal encryption pairing, Chinese remainder theorem, schnorr signature scheme. and our schemes also based on number- theoretic assumptions. When talk about security of the group signature, we pay most attentation to coalition-resistant and unforgeability. Our researching results: 1:Proposed a new group signature scheme, 2:We proposed an attack of a group signature scheme , which based on Chinese Remainder Theorem. We show this scheme is insecurity. We also improved this scheme used Schnorr signature scheme. Our improved scheme is secure to our attack. 3:A security flaw is identified in a revocation algorithm, an attack to this
|
