An identifiable yet unlinkable authentication system with smart cards for multiple services

Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, Hiroto Yasuura

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

Abstract

The purpose of this paper is to realize an authentication system which satisfies four requirements for security, privacy protection, and usability, that is, impersonation resistance against insiders, personalization, unlinkability in multi-service environment, and memory efficiency. The proposed system is the first system which satisfies all the properties. In the proposed system, transactions of a user within a single service can be linked (personalization), while transactions of a user among distinct services can not be linked (unlinkability in multi-service environment). The proposed system can be used with smart cards since the amount of memory required by the system does not depend on the number of services. First, this paper formalizes the property of unlinkability in multi-service environment, which has not been formalized in the literatures. Next, this paper extends an identification scheme with a pseudorandom function in order to realize an authentication system which satisfies all the requirements. This extension can be done with any identification scheme and any pseudorandom function. Finally, this paper shows an implementation with the Schnorr identification scheme and a collision-free hash function as an example of the proposed systems.

Original languageEnglish
Title of host publicationComputational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings
Pages236-251
Number of pages16
EditionPART 4
DOIs
Publication statusPublished - May 20 2010
Event2010 International Conference on Computational Science and Its Applications, ICCSA 2010 - Fukuoka, Japan
Duration: Mar 23 2010Mar 26 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 4
Volume6019 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2010 International Conference on Computational Science and Its Applications, ICCSA 2010
CountryJapan
CityFukuoka
Period3/23/103/26/10

Fingerprint

Smart cards
Smart Card
Authentication
Data storage equipment
Hash functions
Identification Scheme
Pseudorandom Function
Personalization
Transactions
Privacy Protection
Requirements
Hash Function
Usability
Collision
Distinct

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Nakamura, T., Inenaga, S., Ikeda, D., Baba, K., & Yasuura, H. (2010). An identifiable yet unlinkable authentication system with smart cards for multiple services. In Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings (PART 4 ed., pp. 236-251). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6019 LNCS, No. PART 4). https://doi.org/10.1007/978-3-642-12189-0-21

An identifiable yet unlinkable authentication system with smart cards for multiple services. / Nakamura, Toru; Inenaga, Shunsuke; Ikeda, Daisuke; Baba, Kensuke; Yasuura, Hiroto.

Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings. PART 4. ed. 2010. p. 236-251 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6019 LNCS, No. PART 4).

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

Nakamura, T, Inenaga, S, Ikeda, D, Baba, K & Yasuura, H 2010, An identifiable yet unlinkable authentication system with smart cards for multiple services. in Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings. PART 4 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 4, vol. 6019 LNCS, pp. 236-251, 2010 International Conference on Computational Science and Its Applications, ICCSA 2010, Fukuoka, Japan, 3/23/10. https://doi.org/10.1007/978-3-642-12189-0-21
Nakamura T, Inenaga S, Ikeda D, Baba K, Yasuura H. An identifiable yet unlinkable authentication system with smart cards for multiple services. In Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings. PART 4 ed. 2010. p. 236-251. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 4). https://doi.org/10.1007/978-3-642-12189-0-21
Nakamura, Toru ; Inenaga, Shunsuke ; Ikeda, Daisuke ; Baba, Kensuke ; Yasuura, Hiroto. / An identifiable yet unlinkable authentication system with smart cards for multiple services. Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings. PART 4. ed. 2010. pp. 236-251 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 4).
@inproceedings{f67fc7ad1f5c42c28cd641fb37b39eed,
title = "An identifiable yet unlinkable authentication system with smart cards for multiple services",
abstract = "The purpose of this paper is to realize an authentication system which satisfies four requirements for security, privacy protection, and usability, that is, impersonation resistance against insiders, personalization, unlinkability in multi-service environment, and memory efficiency. The proposed system is the first system which satisfies all the properties. In the proposed system, transactions of a user within a single service can be linked (personalization), while transactions of a user among distinct services can not be linked (unlinkability in multi-service environment). The proposed system can be used with smart cards since the amount of memory required by the system does not depend on the number of services. First, this paper formalizes the property of unlinkability in multi-service environment, which has not been formalized in the literatures. Next, this paper extends an identification scheme with a pseudorandom function in order to realize an authentication system which satisfies all the requirements. This extension can be done with any identification scheme and any pseudorandom function. Finally, this paper shows an implementation with the Schnorr identification scheme and a collision-free hash function as an example of the proposed systems.",
author = "Toru Nakamura and Shunsuke Inenaga and Daisuke Ikeda and Kensuke Baba and Hiroto Yasuura",
year = "2010",
month = "5",
day = "20",
doi = "10.1007/978-3-642-12189-0-21",
language = "English",
isbn = "3642121888",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 4",
pages = "236--251",
booktitle = "Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings",
edition = "PART 4",

}

TY - GEN

T1 - An identifiable yet unlinkable authentication system with smart cards for multiple services

AU - Nakamura, Toru

AU - Inenaga, Shunsuke

AU - Ikeda, Daisuke

AU - Baba, Kensuke

AU - Yasuura, Hiroto

PY - 2010/5/20

Y1 - 2010/5/20

N2 - The purpose of this paper is to realize an authentication system which satisfies four requirements for security, privacy protection, and usability, that is, impersonation resistance against insiders, personalization, unlinkability in multi-service environment, and memory efficiency. The proposed system is the first system which satisfies all the properties. In the proposed system, transactions of a user within a single service can be linked (personalization), while transactions of a user among distinct services can not be linked (unlinkability in multi-service environment). The proposed system can be used with smart cards since the amount of memory required by the system does not depend on the number of services. First, this paper formalizes the property of unlinkability in multi-service environment, which has not been formalized in the literatures. Next, this paper extends an identification scheme with a pseudorandom function in order to realize an authentication system which satisfies all the requirements. This extension can be done with any identification scheme and any pseudorandom function. Finally, this paper shows an implementation with the Schnorr identification scheme and a collision-free hash function as an example of the proposed systems.

AB - The purpose of this paper is to realize an authentication system which satisfies four requirements for security, privacy protection, and usability, that is, impersonation resistance against insiders, personalization, unlinkability in multi-service environment, and memory efficiency. The proposed system is the first system which satisfies all the properties. In the proposed system, transactions of a user within a single service can be linked (personalization), while transactions of a user among distinct services can not be linked (unlinkability in multi-service environment). The proposed system can be used with smart cards since the amount of memory required by the system does not depend on the number of services. First, this paper formalizes the property of unlinkability in multi-service environment, which has not been formalized in the literatures. Next, this paper extends an identification scheme with a pseudorandom function in order to realize an authentication system which satisfies all the requirements. This extension can be done with any identification scheme and any pseudorandom function. Finally, this paper shows an implementation with the Schnorr identification scheme and a collision-free hash function as an example of the proposed systems.

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

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

U2 - 10.1007/978-3-642-12189-0-21

DO - 10.1007/978-3-642-12189-0-21

M3 - Conference contribution

SN - 3642121888

SN - 9783642121883

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

SP - 236

EP - 251

BT - Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings

ER -