A Fair and Unlinkable Divisible E-cash Scheme

Abstract

① 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.