Unlinkable divisible electronic cash

Toru Nakanishi; Yuji Sugiyama

Unlinkable divisible electronic cash

Toru Nakanishi, Yuji Sugiyama

Graduate School of Natural Science and Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

36 Citations (Scopus)

Abstract

Recently, some divisible electronic cash (e-cash) systems have been proposed. However, in existing divisible e-cash systems, efficiency or unlinkability is not sufficiently accomplished. In the existing efficient divisible cash systems, all protocols are conducted in the order of the polynomial of log N where N is the divisibility precision (i.e., (the total coin amount)/ (minimum divisible unit amount)), but payments divided from a coin are linkable (i.e., anyone can decide whether the payments are made by the same payer). The linked payments help anyone to trace the payer, if N is large. On the other hand, in the existing unlinkable divisible e-cash system, the protocols are conducted in the order of the polynomial of N, and thus it is inefficient for large N. In this paper, an unlinkable divisible e-cash system is proposed, where all protocols are conducted in the order of (logN)².

Original language	English
Title of host publication	Information Security - 3rd International Workshop, ISW 2000, Proceedings
Editors	Josef Pieprzyk, Jennifer Seberry, Eiji Okamoto
Publisher	Springer Verlag
Pages	121-134
Number of pages	14
ISBN (Print)	3540414169, 9783540414162
Publication status	Published - Jan 1 2000
Event	3rd International Workshop on Information Security, ISW 2000 - Wollongong, Australia Duration: Dec 20 2000 → Dec 21 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1975
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	3rd International Workshop on Information Security, ISW 2000
Country/Territory	Australia
City	Wollongong
Period	12/20/00 → 12/21/00

Keywords

Divisibility
Electronic cash
Group signature
Unlinkability

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Cite this

Nakanishi, T., & Sugiyama, Y. (2000). Unlinkable divisible electronic cash. In J. Pieprzyk, J. Seberry, & E. Okamoto (Eds.), Information Security - 3rd International Workshop, ISW 2000, Proceedings (pp. 121-134). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1975). Springer Verlag.

Unlinkable divisible electronic cash. / Nakanishi, Toru; Sugiyama, Yuji.
Information Security - 3rd International Workshop, ISW 2000, Proceedings. ed. / Josef Pieprzyk; Jennifer Seberry; Eiji Okamoto. Springer Verlag, 2000. p. 121-134 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1975).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nakanishi, T & Sugiyama, Y 2000, Unlinkable divisible electronic cash. in J Pieprzyk, J Seberry & E Okamoto (eds), Information Security - 3rd International Workshop, ISW 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1975, Springer Verlag, pp. 121-134, 3rd International Workshop on Information Security, ISW 2000, Wollongong, Australia, 12/20/00.

Nakanishi, Toru ; Sugiyama, Yuji. / Unlinkable divisible electronic cash. Information Security - 3rd International Workshop, ISW 2000, Proceedings. editor / Josef Pieprzyk ; Jennifer Seberry ; Eiji Okamoto. Springer Verlag, 2000. pp. 121-134 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{04114348b5fe4688948d452f8b9a9abd,

title = "Unlinkable divisible electronic cash",

abstract = "Recently, some divisible electronic cash (e-cash) systems have been proposed. However, in existing divisible e-cash systems, efficiency or unlinkability is not sufficiently accomplished. In the existing efficient divisible cash systems, all protocols are conducted in the order of the polynomial of log N where N is the divisibility precision (i.e., (the total coin amount)/ (minimum divisible unit amount)), but payments divided from a coin are linkable (i.e., anyone can decide whether the payments are made by the same payer). The linked payments help anyone to trace the payer, if N is large. On the other hand, in the existing unlinkable divisible e-cash system, the protocols are conducted in the order of the polynomial of N, and thus it is inefficient for large N. In this paper, an unlinkable divisible e-cash system is proposed, where all protocols are conducted in the order of (logN)2.",

keywords = "Divisibility, Electronic cash, Group signature, Unlinkability",

author = "Toru Nakanishi and Yuji Sugiyama",

year = "2000",

month = jan,

day = "1",

language = "English",

isbn = "3540414169",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "121--134",

editor = "Josef Pieprzyk and Jennifer Seberry and Eiji Okamoto",

booktitle = "Information Security - 3rd International Workshop, ISW 2000, Proceedings",

note = "3rd International Workshop on Information Security, ISW 2000 ; Conference date: 20-12-2000 Through 21-12-2000",

}

TY - GEN

T1 - Unlinkable divisible electronic cash

AU - Nakanishi, Toru

AU - Sugiyama, Yuji

PY - 2000/1/1

Y1 - 2000/1/1

N2 - Recently, some divisible electronic cash (e-cash) systems have been proposed. However, in existing divisible e-cash systems, efficiency or unlinkability is not sufficiently accomplished. In the existing efficient divisible cash systems, all protocols are conducted in the order of the polynomial of log N where N is the divisibility precision (i.e., (the total coin amount)/ (minimum divisible unit amount)), but payments divided from a coin are linkable (i.e., anyone can decide whether the payments are made by the same payer). The linked payments help anyone to trace the payer, if N is large. On the other hand, in the existing unlinkable divisible e-cash system, the protocols are conducted in the order of the polynomial of N, and thus it is inefficient for large N. In this paper, an unlinkable divisible e-cash system is proposed, where all protocols are conducted in the order of (logN)2.

AB - Recently, some divisible electronic cash (e-cash) systems have been proposed. However, in existing divisible e-cash systems, efficiency or unlinkability is not sufficiently accomplished. In the existing efficient divisible cash systems, all protocols are conducted in the order of the polynomial of log N where N is the divisibility precision (i.e., (the total coin amount)/ (minimum divisible unit amount)), but payments divided from a coin are linkable (i.e., anyone can decide whether the payments are made by the same payer). The linked payments help anyone to trace the payer, if N is large. On the other hand, in the existing unlinkable divisible e-cash system, the protocols are conducted in the order of the polynomial of N, and thus it is inefficient for large N. In this paper, an unlinkable divisible e-cash system is proposed, where all protocols are conducted in the order of (logN)2.

KW - Divisibility

KW - Electronic cash

KW - Group signature

KW - Unlinkability

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

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

M3 - Conference contribution

AN - SCOPUS:84944265063

SN - 3540414169

SN - 9783540414162

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 121

EP - 134

BT - Information Security - 3rd International Workshop, ISW 2000, Proceedings

A2 - Pieprzyk, Josef

A2 - Seberry, Jennifer

A2 - Okamoto, Eiji

PB - Springer Verlag

T2 - 3rd International Workshop on Information Security, ISW 2000

Y2 - 20 December 2000 through 21 December 2000

ER -

Unlinkable divisible electronic cash

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this