基于单向累加器的高效可分电子现金方案  

Efficient divisible e-cash scheme based on one-way accumulator

作　　者：于永波[1] 贾小珠[1] 冯庆峰[1] 

机构地区：[1]青岛大学信息工程学院,山东青岛266000

出　　处：《计算机工程与应用》2010年第10期206-208,219,共4页Computer Engineering and Applications

摘　　要：基于单向累加器理论和二叉树技术,提出了一个同时具有用户匿名性和交易无连接性的离线可分电子现金方案,方案无需可信第三方参与;加入了概率验证算法,既能有效震慑不法用户、保证银行利益不受损失,又能有效降低系统开销。方案安全性基于决策Diffie-Hellman(DDH)假设、计算离散对数困难性假设以及单向散列函数存在性假设。Based on the theory of one-way accumulator and the binary tree technology,this paper puts forward an off-line divisible e-cash scheme which provides both full unlinkability and anonymity without requiring a trusted third party.The introduction of the probabilistic audit permits both the effective deterrent on illegal users and guarantee the banks from loses as well as the lower costs of the system.Security of the scheme is based on the assumptions of decision diffie-hellman,the hardness of calculating discrete logarithm and the existence of the one-way hash function.

关 键 词：可分电子现金 单向累加器 匿名性 无连接性 无可信第三方 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]