The search functionality is under construction.

The search functionality is under construction.

We present an efficiency improvement on an existing unlinkable divisible e-cash system. In the based e-cash system, an e-coin can be divided to spent, and thus the exact payments are available. Furthermore, to protect customer's privacy, the system also satisfies the unlinkability in all the payments, which is not satisfied in other existing divisible e-cash systems. The unlinkability means the infeasibility of determining whether two payments are made by the same customer. However, in the unlinkable divisible e-cash system, the payment protocol needs *O*(*N*) computations, and thus inefficient, where *N* indicates the divisibility precision. For example, in case of *N*=100,000, about 200,000 exponentiations are needed for the worst. We improve the payment protocol using the tree approach. In case of *N*=100,000, the protocol with our improvement needs only about 600 exponentiations for the worst. This good result can be obtained for other *N* which is more than about 100.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.10 pp.2326-2335

- Publication Date
- 2002/10/01

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- PAPER

- Category
- Information Security

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Toru NAKANISHI, Yuji SUGIYAMA, "An Efficiency Improvement on an Unlinkable Divisible Electronic Cash System" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 10, pp. 2326-2335, October 2002, doi: .

Abstract: We present an efficiency improvement on an existing unlinkable divisible e-cash system. In the based e-cash system, an e-coin can be divided to spent, and thus the exact payments are available. Furthermore, to protect customer's privacy, the system also satisfies the unlinkability in all the payments, which is not satisfied in other existing divisible e-cash systems. The unlinkability means the infeasibility of determining whether two payments are made by the same customer. However, in the unlinkable divisible e-cash system, the payment protocol needs *O*(*N*) computations, and thus inefficient, where *N* indicates the divisibility precision. For example, in case of *N*=100,000, about 200,000 exponentiations are needed for the worst. We improve the payment protocol using the tree approach. In case of *N*=100,000, the protocol with our improvement needs only about 600 exponentiations for the worst. This good result can be obtained for other *N* which is more than about 100.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_10_2326/_p

Copy

@ARTICLE{e85-a_10_2326,

author={Toru NAKANISHI, Yuji SUGIYAMA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={An Efficiency Improvement on an Unlinkable Divisible Electronic Cash System},

year={2002},

volume={E85-A},

number={10},

pages={2326-2335},

abstract={We present an efficiency improvement on an existing unlinkable divisible e-cash system. In the based e-cash system, an e-coin can be divided to spent, and thus the exact payments are available. Furthermore, to protect customer's privacy, the system also satisfies the unlinkability in all the payments, which is not satisfied in other existing divisible e-cash systems. The unlinkability means the infeasibility of determining whether two payments are made by the same customer. However, in the unlinkable divisible e-cash system, the payment protocol needs *O*(*N*) computations, and thus inefficient, where *N* indicates the divisibility precision. For example, in case of *N*=100,000, about 200,000 exponentiations are needed for the worst. We improve the payment protocol using the tree approach. In case of *N*=100,000, the protocol with our improvement needs only about 600 exponentiations for the worst. This good result can be obtained for other *N* which is more than about 100.},

keywords={},

doi={},

ISSN={},

month={October},}

Copy

TY - JOUR

TI - An Efficiency Improvement on an Unlinkable Divisible Electronic Cash System

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 2326

EP - 2335

AU - Toru NAKANISHI

AU - Yuji SUGIYAMA

PY - 2002

DO -

JO - IEICE TRANSACTIONS on Fundamentals

SN -

VL - E85-A

IS - 10

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - October 2002

AB - We present an efficiency improvement on an existing unlinkable divisible e-cash system. In the based e-cash system, an e-coin can be divided to spent, and thus the exact payments are available. Furthermore, to protect customer's privacy, the system also satisfies the unlinkability in all the payments, which is not satisfied in other existing divisible e-cash systems. The unlinkability means the infeasibility of determining whether two payments are made by the same customer. However, in the unlinkable divisible e-cash system, the payment protocol needs *O*(*N*) computations, and thus inefficient, where *N* indicates the divisibility precision. For example, in case of *N*=100,000, about 200,000 exponentiations are needed for the worst. We improve the payment protocol using the tree approach. In case of *N*=100,000, the protocol with our improvement needs only about 600 exponentiations for the worst. This good result can be obtained for other *N* which is more than about 100.

ER -