Unlinkable electronic coupon protocol with anonymity control

Toru Nakanishi, Nobuaki Haruna, Yuji Sugiyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

Abstract

In a variant of the electronic cash protocol, an electronic coupon protocol, a withdrawn coin is divided into many sub-coins whose face values are fixed in advance, and the sub-coins are only used in payments. The original coin is called ticket and the sub-coins are called sub-tickets. The electronic cash protocol should satisfy not only the anonymity that the payer cannot be traced from the payments, but also the unlinkability. The unlinkability means that anyone cannot determine whether payments were made by the same payer. If the unlinkability does not hold, tracing the payer from one payment leads to tracing the payer from all his/her payments, and the link between the payments also facilitates the de-anonymization. In the previously proposed electronic coupon protocol, payments of sub-tickets derived from the same ticket are linkable. Since the complete anonymity of payments facilitates fraud and criminal acts, the electronic cash protocols should equip the revocation of the anonymity. In this paper, an electronic coupon protocol is proposed, where all payments are unlinkable but the anonymity of the payments can be revoked.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages37-46
Number of pages10
Volume1729
ISBN (Print)3540666958, 9783540666950
Publication statusPublished - 1999
Event2nd International Information Security Workshop, ISW 1999 - Kuala Lumpur, Malaysia
Duration: Nov 6 1999Nov 7 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1729
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other2nd International Information Security Workshop, ISW 1999
CountryMalaysia
CityKuala Lumpur
Period11/6/9911/7/99

Fingerprint

Anonymity
Electronics
Tracing
Revocation
Electronic money

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Nakanishi, T., Haruna, N., & Sugiyama, Y. (1999). Unlinkable electronic coupon protocol with anonymity control. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1729, pp. 37-46). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1729). Springer Verlag.

Unlinkable electronic coupon protocol with anonymity control. / Nakanishi, Toru; Haruna, Nobuaki; Sugiyama, Yuji.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1729 Springer Verlag, 1999. p. 37-46 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1729).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nakanishi, T, Haruna, N & Sugiyama, Y 1999, Unlinkable electronic coupon protocol with anonymity control. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1729, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1729, Springer Verlag, pp. 37-46, 2nd International Information Security Workshop, ISW 1999, Kuala Lumpur, Malaysia, 11/6/99.
Nakanishi T, Haruna N, Sugiyama Y. Unlinkable electronic coupon protocol with anonymity control. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1729. Springer Verlag. 1999. p. 37-46. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Nakanishi, Toru ; Haruna, Nobuaki ; Sugiyama, Yuji. / Unlinkable electronic coupon protocol with anonymity control. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1729 Springer Verlag, 1999. pp. 37-46 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{50c1a20986584d4f85117396ed621160,
title = "Unlinkable electronic coupon protocol with anonymity control",
abstract = "In a variant of the electronic cash protocol, an electronic coupon protocol, a withdrawn coin is divided into many sub-coins whose face values are fixed in advance, and the sub-coins are only used in payments. The original coin is called ticket and the sub-coins are called sub-tickets. The electronic cash protocol should satisfy not only the anonymity that the payer cannot be traced from the payments, but also the unlinkability. The unlinkability means that anyone cannot determine whether payments were made by the same payer. If the unlinkability does not hold, tracing the payer from one payment leads to tracing the payer from all his/her payments, and the link between the payments also facilitates the de-anonymization. In the previously proposed electronic coupon protocol, payments of sub-tickets derived from the same ticket are linkable. Since the complete anonymity of payments facilitates fraud and criminal acts, the electronic cash protocols should equip the revocation of the anonymity. In this paper, an electronic coupon protocol is proposed, where all payments are unlinkable but the anonymity of the payments can be revoked.",
author = "Toru Nakanishi and Nobuaki Haruna and Yuji Sugiyama",
year = "1999",
language = "English",
isbn = "3540666958",
volume = "1729",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "37--46",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Unlinkable electronic coupon protocol with anonymity control

AU - Nakanishi, Toru

AU - Haruna, Nobuaki

AU - Sugiyama, Yuji

PY - 1999

Y1 - 1999

N2 - In a variant of the electronic cash protocol, an electronic coupon protocol, a withdrawn coin is divided into many sub-coins whose face values are fixed in advance, and the sub-coins are only used in payments. The original coin is called ticket and the sub-coins are called sub-tickets. The electronic cash protocol should satisfy not only the anonymity that the payer cannot be traced from the payments, but also the unlinkability. The unlinkability means that anyone cannot determine whether payments were made by the same payer. If the unlinkability does not hold, tracing the payer from one payment leads to tracing the payer from all his/her payments, and the link between the payments also facilitates the de-anonymization. In the previously proposed electronic coupon protocol, payments of sub-tickets derived from the same ticket are linkable. Since the complete anonymity of payments facilitates fraud and criminal acts, the electronic cash protocols should equip the revocation of the anonymity. In this paper, an electronic coupon protocol is proposed, where all payments are unlinkable but the anonymity of the payments can be revoked.

AB - In a variant of the electronic cash protocol, an electronic coupon protocol, a withdrawn coin is divided into many sub-coins whose face values are fixed in advance, and the sub-coins are only used in payments. The original coin is called ticket and the sub-coins are called sub-tickets. The electronic cash protocol should satisfy not only the anonymity that the payer cannot be traced from the payments, but also the unlinkability. The unlinkability means that anyone cannot determine whether payments were made by the same payer. If the unlinkability does not hold, tracing the payer from one payment leads to tracing the payer from all his/her payments, and the link between the payments also facilitates the de-anonymization. In the previously proposed electronic coupon protocol, payments of sub-tickets derived from the same ticket are linkable. Since the complete anonymity of payments facilitates fraud and criminal acts, the electronic cash protocols should equip the revocation of the anonymity. In this paper, an electronic coupon protocol is proposed, where all payments are unlinkable but the anonymity of the payments can be revoked.

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

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

M3 - Conference contribution

AN - SCOPUS:84948140143

SN - 3540666958

SN - 9783540666950

VL - 1729

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

SP - 37

EP - 46

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

PB - Springer Verlag

ER -