一种高效公正的离线可分电子现金方案  

Efficient fair offline divisible E-cash scheme

作　　者：黄正全[1] 张其善[1] 

机构地区：[1]北京航空航天大学电子信息工程学院,北京100083

出　　处：《计算机工程与设计》2004年第11期1943-1945,共3页Computer Engineering and Design

摘　　要：提出一种新的高效的离线可分电子现金方案,在实现公正性的基础上提高电子现金的可分效率。方案利用限制性盲签名思想来实现电子现金的公正性,必要时,在可信的第3方的协助下,银行可撤销电子现金的匿名性;采用同一对密钥对电子现金金额进行签名,既实现电子现金的可分性,又降低方案的计算量和复杂性,同时提高电子现金的安全性。分析结果表明,方案是安全的、高效的。A new efficient offline divisible E-cash scheme is presented, which aims to enhance the efficiency of divisibility of E-cash on the basis of fairness. The fairness of E-cash is realized by using the restrictive signature scheme so that the bank can revoke the anonymity of E-cash when needed with the help of the trusted third party. And its divisibility is implemented by signing all the monetary amounts of E-cash with only one pair of keys in order to reduce the complexity and computation of the scheme as well as to strengthen its security. The result of analysis indicates it is secure and efficient.

关 键 词：电子现金 银行 金额 公正性 效率 匿名性 高效 盲签名 离线 密钥 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] F830.49[自动化与计算机技术—计算机科学与技术]