Abstract | ||
---|---|---|
Though there are intensive researches on off-line electronic cash (e-cash), the current computer network infrastructure sufficiently accepts on-line e-cash. The on-line means that the payment protocol involves with the bank, and the off-line means no involvement. For customers' privacy, the e-cash system should satisfy. unlinkability, i.e., any pair of payments is unlinkable w.r.t. the sameness of the payer. In addition, for the convenience, exact payments, i.e., the payments with arbitrary amounts, should be also able to performed. In an existing off-line system with unlinkable exact payments, the customers need massive computations. On the other hand, an existing on-line system does not satisfy the efficiency and the perfect unlinkability simultaneously. This paper proposes an online system, where the efficiency and the perfect unlinkability are achieved simultaneously. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1093/ietfec/e88-a.10.2769 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | DocType | Volume |
on-line e-cash, unlinkability, exact payments, zero-knowledge proofs of knowledge, paillier cryptosystem | Journal | E88A |
Issue | ISSN | Citations |
10 | 0916-8508 | 6 |
PageRank | References | Authors |
0.49 | 5 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Toru Nakanishi | 1 | 210 | 38.25 |
Yuji Sugiyama | 2 | 6 | 0.49 |