高效的离线电子现金方案  

Efficient off-line E-cash scheme

作　　者：李华平[1] 寇卫东[1] 刘景伟[1] 

机构地区：[1]西安电子科技大学综合业务网国家重点实验室,陕西西安710071

出　　处：《计算机工程与设计》2006年第12期2133-2135,共3页Computer Engineering and Design

基　　金：国家自然科学基金项目(90304008);高等学校博士学科专项科研基金项目(20040701001)

摘　　要：电子现金本质上是一串容易被复制的比特序列,如何在保护合法用户匿名性的前提下有效地防止其被重复花费是电子现金研究的关键。提出了一种新的基于RSA盲签名的离线电子现金方案,采用双密钥对称加密,将用户账号信息嵌入其中,从而保证合法花费一次用户的匿名性,也能够以极大的概率找出重复使用同一笔电子现金的用户。对分割选择(cutandchoose)机制进行了改进,降低了计算复杂度。最后,对方案的公平性和安全性进行了分析。E-cash is essentially a string of bit sequence, which is easy to be copied. The key concern of E-cash is how to effectively prevent E-cash from being double-spent under preconditions that a legal user＇s anonymity is well protected. An off-line E-cash scheme based on RSA blind signature is presented. The technology oftwi-symmetrical encryption employing double keys is adopted. It guarantees anonymity of the users who spend an E-cash piece only once. Besides, the user who has spent the same piece of E-cash twice are detected at a considerable probability. The cut and choose scheme is improved to decrease computing. Finally, the analysis of security and the demonstration of fairness are given.

关 键 词：电子现金 电子支付 盲签名 分割选择 公平性 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]