公平的无连接可分电子现金方案  

A Fair and Unlinkable Divisible E-cash Scheme

作　　者：于永波[1] 宋智玲[1] 贾小珠[1] 

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

出　　处：《青岛大学学报（自然科学版）》2008年第3期70-74,共5页Journal of Qingdao University(Natural Science Edition)

摘　　要：基于二叉树、比特承诺、零知识证明等技术提出了一种具有完全无连接性,无需可信第三方参与的、公平的可分电子现金方案。方案的开户协议和取款协议复杂度均为O(N+K),用户花费任意一个节点的电子现金时间复杂度为O(poly(K)·polylog(N)),存款协议的时间复杂度与支付协议相同。方案的安全性基于强RSA问题假设、计算离散对数困难问题假设和单向哈希函数的存在性假设。（1） Based on technologies of binary tree, bit commitment and zero knowledge proof, a fair and unlinkable divisible electronic cash scheme is which do not need the trusted third party was proposed. The complexity both of open account and withdraw protocol is O（N＋K）. The complexity of spending any node is proportional to poly （K） polylog （N）. And the complexity of deposit protocol is the same with the payment protocol. The security of the scheme is based on the assumptions of strong RSA problems, the hardness of calculating discrete logarithm and the existence of the one-way hash function.

关 键 词：电子现金 可分性 无连接性 无可信第三方 

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