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
Y1 - 2010
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
AN - SCOPUS:77952297408
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
PB - Springer Verlag
T2 - 2010 International Conference on Computational Science and Its Applications, ICCSA 2010
Y2 - 23 March 2010 through 26 March 2010
ER -