Discuss the problem of infinite increasing coin list in anonymous E-cash systems, which reduce the efficiency of whole system greatly. Though some methods are suggested, no one can solve the problem with high efficien...
The security of Canard-Traore fair e-cash system scheme was believed to depend on the strong-RSA assumption and the Decision Diffie-Hellman assumption in groups of unknown order. But it is not the case. The cryptanaly...
Supported bythe National High TechnologyDevelopment 863 Programof China under Grant (863-301-1-3)
A new fair e-eash payment scheme based on credit is present in this paper. In the scheme, an overdraft credit certificate is issued to user by hank. Using the overdraft credit certificate, user can produce e-cash hims...
To solve the drawback of the present electionic cash (E-cash) schemes that the size of bank's transcripts database expands without bound, the concept of validity duration of E-cash is introduced in this paper. Through...
Atomicity and anonymity are desirable properties for reliable and security e-Cash transaction and the guarantee of the participants’ interests. But there are conflicts between these two properties. In this paper, an ...
This paper describes the research results and development of fair off-line e-cash systems so far, and points out that in these systems, the bank can compute the double-spender’s account secret key, thus the bank can ...
A new fair off-line electronic cash scheme on elliptic curve cryptography was presented. The new scheme is more efficient than those by extending fair off-line electronic cash scheme from finite field into elliptic cu...