An efficient on-line electronic cash with unlinkable exact payments

Toru Nakanishi, Yuji Sugiyama

Research output: Contribution to journalArticle

2 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)2769-2777
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE88-A
Issue number10
DOIs
Publication statusPublished - Oct 2005

Fingerprint

Online systems
Electronics
Line
Customers
Computer networks
Computer Networks
Privacy
Network protocols
Infrastructure
Electronic money
Arbitrary

Keywords

  • Exact payments
  • On-line e-cash
  • Paillier cryptosystem
  • Unlinkability
  • Zero-knowledge proofs of knowledge

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

An efficient on-line electronic cash with unlinkable exact payments. / Nakanishi, Toru; Sugiyama, Yuji.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E88-A, No. 10, 10.2005, p. 2769-2777.

Research output: Contribution to journalArticle

@article{519012469d6b4195b7483580d9a733f1,
title = "An efficient on-line electronic cash with unlinkable exact payments",
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.",
keywords = "Exact payments, On-line e-cash, Paillier cryptosystem, Unlinkability, Zero-knowledge proofs of knowledge",
author = "Toru Nakanishi and Yuji Sugiyama",
year = "2005",
month = "10",
doi = "10.1093/ietfec/e88-a.10.2769",
language = "English",
volume = "E88-A",
pages = "2769--2777",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "10",

}

TY - JOUR

T1 - An efficient on-line electronic cash with unlinkable exact payments

AU - Nakanishi, Toru

AU - Sugiyama, Yuji

PY - 2005/10

Y1 - 2005/10

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

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

KW - Exact payments

KW - On-line e-cash

KW - Paillier cryptosystem

KW - Unlinkability

KW - Zero-knowledge proofs of knowledge

UR - http://www.scopus.com/inward/record.url?scp=27844591780&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27844591780&partnerID=8YFLogxK

U2 - 10.1093/ietfec/e88-a.10.2769

DO - 10.1093/ietfec/e88-a.10.2769

M3 - Article

AN - SCOPUS:27844591780

VL - E88-A

SP - 2769

EP - 2777

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 10

ER -