Font Size: a A A

The Reserch On Efficient Divisible E-cash Based On Ecc

Posted on:2011-03-14Degree:MasterType:Thesis
Country:ChinaCandidate:J H WangFull Text:PDF
GTID:2198330338991193Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Electronic payment is the core of e-commerce, which has direct impact on the speed and scope of electronic commerce's development. At present, electronic cash is a new, highly promising method of payment among the existed electronic payments. Electronic cash has the characteristics of real money, like anonymity, off-line nature, can not be tracked and so on. In order to simulate real money better, it can be also divisible and unlinkable. Therefore, our study focus on designing safe and efficient divisible electronic cash protocol, to improve the efficiency of the protocol while the freedom and privacy of the parties of the transaction are ensured.Firstly, to solve the problems of the existed divisible E-cash with direct computation that requires a large number of modular exponentiations and is difficult to construct in practice, this paper firstly combines the Elliptic Curve Cryptosystem (ECC) and the direct-computation method to design a more efficient scheme. Besides, it adds validity period to E-cash, which reduces the burden of the bank's database. This scheme is easier to construct and greatly improves the efficiency and practicality of E-cash. After giving a detailed description of the agreement, this paper conducts the efficiency and security analysis and certification.Secondly, in allusion to problem that not all nodes of a binary tree can be spent in protocols under the divisibility rule, we introduce the path of binary tree nodes to represent electronic cash. Using elliptic curve cryptography, construct an electronic cash protocol based on binary tree path representation. The serial number produced by costing a node and costing its child nodes will not be the same. Therefore, spengding a single node does not affect spending its child nodes or its parent node, and then all nodes on the binary tree can be spent, which maximizes the use of a binary tree of nodes. The calculation to do is greatly reduced when spengding the same amount of E-cash, improving the efficiency of the flow of electronic cash.Finally, we simulate and implement the basic functions of the protocol of the divisible E-cash with direct calculation based on ECC. Using Visual Studio 2008, we designed and developed a prototype system of efficient ECC-based divisible E-cash to simulate the basic functions of the protocol.
Keywords/Search Tags:Divisible electronic cash, Elliptic curve cryptosystem, Direct computation, Path of binary tree
PDF Full Text Request
Related items