A Generic Framework For Three-Factor Authentication Preserving Security and Privacy in Distributed Systems
A Generic Framework For Three-Factor Authentication Preserving Security and Privacy in Distributed Systems
8, AUGUST 2011
Abstract—As part of the security within distributed systems, various services and resources need protection from unauthorized use.
Remote authentication is the most commonly used method to determine the identity of a remote client. This paper investigates a
systematic approach for authenticating clients by three factors, namely password, smart card, and biometrics. A generic and secure
framework is proposed to upgrade two-factor authentication to three-factor authentication. The conversion not only significantly
improves the information assurance at low cost but also protects client privacy in distributed systems. In addition, our framework
retains several practice-friendly properties of the underlying two-factor authentication, which we believe is of independent interest.
Index Terms—Authentication, distributed systems, security, privacy, password, smart card, biometrics.
1 INTRODUCTION
smart card and password. Our analysis, which will be given As an interactive protocol, SCPAP may face passive
shortly, points out two limitations of Li-Hwang’s scheme in attackers and active attackers.
practical application. In addition, there are no satisfactory Passive attacker. A passive attacker can obtain messages
solutions for three-factor authentication with additional transmitted between the client and the server. However, it
properties (e.g., key agreement with forward security), cannot interact with the client or the server.
which have been studied intensively in smart-card-based Active attacker. An active attacker has the full control of
password authentication. the communication channel. In addition to message eaves-
Organization of this paper. The remainder of this paper dropping, the attacker can arbitrarily inject, modify, and
is organized as follows: Section 2 briefly reviews the delete messages in the communication between the client
preliminaries of our framework. After that, we describe the
and the server.
challenges of biometric authentication in distributed
On the other hand, SCPAP is a two-factor authentication
systems in Section 3. The generic framework for three-
protocol, namely a successful login requires a valid smart
factor authentication is given in Section 4. Section 5
provides the analysis of the proposed framework, and its card and a correct password. According to the compro-
formal security proofs are given in the supplementary file, mised secret, an attacker can be further classified into the
which can be found on the Computer Society Digital following two types.
Library at http://doi.ieeecomputersociety.org/10.1109/ Attacker with smart card. This type of attacker has the
TPDS.2010.206. Section 6 concludes this paper. smart card, and can read and modify the data in the smart
card. Notice that there are techniques to restrict access to
both reading and modifying data in the smart card.
2 PRELIMINARIES Nevertheless, from the security point of view, authentica-
This section reviews the definitions of smart-card-based tion protocols will be more robust if they are secure against
password authentication, three-factor authentication, and attackers with the ability to do that.
fuzzy extractor. Attacker with password. The attacker is assumed to have
the password of the client but is not given the smart card.
2.1 Smart-Card-Based Password Authentication
Definition 2 (Secure SCPAP). The basic security requirement
Definition 1. A smart-card-based password authentication
of SCPAP is that it should be secure against a passive attacker
protocol (hereinafter referred to as SCPAP) consists of four
with smart card and a passive attacker with password. It is
phases.
certainly more desirable that SCPAP is secure against an
active attacker with smart card and an active attacker with
2-Factor-Initialization: The server (denoted by S) gen-
erates two system parameters P K and SK. P K is password.
published in the system, and SK is kept secret by S. An 2.2 Three-Factor Authentication
execution of this algorithm is denoted by 2-Factor-
Three-factor authentication is very similar to smart-card-
InitializationðÞ ! ðP K; SKÞ. Here, is system’s security
parameter which determines the size of P K and SK, and based password authentication, with the only difference
the security level of cryptographic algorithms. that it requires biometric characteristics as an additional
2-Factor-Reg: The client (denoted by C), with an initial authentication factor.
password P W , registers on the system by running this Definition 3 (Three-Factor Authentication). A three-factor
interactive protocol with S. The output of this protocol is a authentication protocol involves a client C and a server S, and
smart card SC. An execution of this protocol is denoted by consists of five phases.
The output of this protocol is “1” (if the authentication is 2.3.2 Statistic Distance
successful) or “0” (otherwise). The statistical distance between two probability distribu-
3-Factor-Password-Changing: This protocol enables a P
tions A and B is denoted by SDðA; BÞ ¼ 12 v j PrðA ¼ vÞ
client to change his/her password after a successful PrðB ¼ vÞj.
authentication. The data in the smart card will be updated
accordingly. 2.3.3 Entropy
3-Factor-Biometrics-Changing2: An analogue of pass- The min-entropy H1 ðAÞ of a random variable A is
word-changing is biometrics-changing, namely the client logðmaxa Pr½A ¼ aÞ.
can change his/her biometrics used in the authentication,
e.g., using a different finger or using iris instead of finger. 2.3.4 Fuzzy Extractor
While biometrics-changing is not supported by previous A fuzzy extractor extracts a nearly random string R from its
three-factor authentication protocols, we believe it provides biometric input w in an error-tolerant way. If the input
the client with more flexibility in the authentication. changes but remains close, the extracted R remains the
Cost effectiveness. In general, three-factor authentication same. To assist in recovering R from a biometric input w0 , a
is less computationally efficient than smart-card-based pass- fuzzy extractor outputs an auxiliary string P . However, R
word authentication, since the former requires additional remains uniformly random even given P . The fuzzy
computational resources for biometric authentication. To extractor is formally defined as below.
make three-factor authentication practical, biometric-related
Definition 5 (Fuzzy Extractor). An ðM; m; ‘; t; Þ fuzzy
operations must be performed fast and accurately. As
extractor is given by two procedures ðGen; RepÞ.
indicated in [16], the performance of extracting and
authenticating certain types of biometrics (e.g., face and
keystroke) is not satisfactory, but others (e.g., fingerprint and
iris) can satisfy practical requirements. (Examples include
fingerprint recognition in laptops and biometric visa.) Gen is a probabilistic generation procedure, which on
Security requirements. A three-factor authentication (biometric) input w 2 M outputs an “extracted” string R 2
protocol can also face passive attackers and active f0; 1g‘ and an auxiliary string P . For any distribution W on
attackers as defined in SCPAP (Section. 2.1). A passive M of min-entropy m, if <R; P > GenðW Þ, then we have
(an active) attacker can be further classified into the SDð<R; P >; <U‘ ; P >Þ . Here, U‘ denotes the uniform
following three types. distribution on ‘-bit binary strings.
Type I attacker has the smart card and the biometric
characteristics of the client. It is not given the password of
that client. Rep is a deterministic reproduction procedure allowing to
Type II attacker has the password and the biometric recover R from the corresponding auxiliary string P and any
characteristics. It is not allowed to obtain the data in the vector w0 close to w: for all w; w0 2 M satisfying
smart card. disðw; w0 Þ t, i f <R; P > GenðwÞ, t h e n w e h a v e
Type III attacker has the smart card and the password of Repðw0 ; P Þ ¼ R.
the client. It is not given the biometric characteristics of that
client. Notice that such an attacker is free to mount any
attacks on the (unknown) biometrics, including biometrics
3 CHALLENGES IN BIOMETRIC AUTHENTICATION
faking and attacks on the metadata (related to the This section is devoted to a brief description of three subtle
biometrics) stored in the smart card. issues in biometric authentication, namely privacy issues,
Definition 4 (Secure Three-Factor Authentication). For a error tolerance, and nontrusted devices.
three-factor authentication protocol, the basic security require- 3.1 Privacy Issues
ment is that it should be secure against passive type I, type II, A trivial way to include biometric authentication in smart-
and type III attackers. It is certainly more desirable that a card-based password authentication is to scan the biometric
three-factor authentication protocol is secure against active type characteristics and store the extracted biometric data as a
I, type II, and type III attackers. template in the server. During the authentication, a compar-
2.3 Fuzzy Extractor ison is made between the stored data and the input biometric
data. If there is a sufficient commonality, a biometric
This section briefly reviews the fuzzy extractor introduced
authentication is said to be successful. This method, how-
in [21].
ever, will raise several security risks, especially in a multi-
2.3.1 Metric Space server environment where user privacy is a concern (e.g., in a
A metric space is a set M with a distance function dis : distributed system). First, servers are not 100 percent secure.
M M ! IRþ ¼ ½0; 1Þ which obeys various natural prop- Servers with weak security protections can be broken in by
erties. One example of metric space is Hamming metric: M ¼ attackers, who will obtain the biometric data on those servers.
F n is over some alphabet F (e.g., F ¼ f0; 1g) and disðw; w0 Þ Second, servers are not 100 percent trusted. Server-A
is the number of positions in which they differ. (equivalently, its curious administrator) could try to login
to Server-B on behalf of their common clients, or distribute
2. This is motivated by the reviewer’s comment. users’ biometric information in the system. In either case,
Authorized licensed use limited to: Asia University. Downloaded on April 20,2024 at 02:35:31 UTC from IEEE Xplore. Restrictions apply.
1394 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 22, NO. 8, AUGUST 2011
user privacy will be compromised, and a single-point failure secret parameter for three-factor authentication. Let 2-
on a server will downgrade the whole system’s security level Factor-Initialization be the initialization algorithm in the
from three-factor authentication to two-factor authentication underlying SCPAP. Given a security parameter , the
(since clients are likely to register the same biometric authentication server S in our framework runs 2-Factor-
characteristics on all servers in the system).
Initialization twice:
Notice that there is a potential solution to preserve user
privacy even the server has a copy of clients’ biometric data. 1. 2-Factor-InitializationðÞ ! ðP K1 ; SK1 Þ.
The method is called “cancellable biometrics” [22]: Biometric 2. 2-Factor-InitializationðÞ ! ðP K2 ; SK2 Þ.
data can be intentionally distorted in a repeatable manner. Notice that the two pairs ðP K1 ; SK1 Þ and ðP K2 ; SK2 Þ are
This allows the client to generate different biometrics for
generated in an independent manner.
different purposes and register different biometric data on
The public parameter in three-factor authentication is the
different servers. Furthermore, the client can cancel his/her
biometric data on the server and enroll a new one whenever pair ðP K1 ; P K2 Þ, and the corresponding secret parameter is
necessary (e.g., if the biometric data stored on the server is the pair ðSK1 ; SK2 Þ.
compromised). However, cancellable biometrics has certain
4.2 3-Factor-Reg
limitations [23]. To date, there are generally two methods to
implement cancellable biometrics: 1) Biometric Salting and The registration in our framework is made up of the
2) Noninvertible Transforms. The former method needs an following steps. In the following, let h be a cryptographic
auxiliary data which must be kept secret, and it remains as a hash function chosen by the client C.
challenging work to design a noninvertible transform
function satisfying both performance and noninvertibility 1. An initial password P W1 is chosen by the client C.
requirements. Due to these concerns, our framework does 2. GenðBioDataÞ ! ðR; P Þ. A pair ðR; P Þ is generated
using C’s biometric template BioData and the
not use cancellable biometrics.
algorithm Gen in the fuzzy extractor. We assume
3.2 Error Tolerance and Nontrusted Devices there is a device extracting the biometric template
One challenge in biometric authentication is that biometric and carrying out all calculations in the fuzzy
characteristics are prone to various noise during data extractor. Notice that this step does not involve
collecting, and this natural feature makes it impossible to any interaction with the authentication server.
reproduce precisely each time biometric characteristics are 3. Let P W2 ¼ hðRÞ. The second “password” P W2 is
measured. A practical biometric authentication protocol calculated from the random string R. R will be
cannot simply compare the hash or the encryption of deleted immediately once the calculation of P W2 is
biometric templates (which requires an exact match). complete.
Instead, biometric authentication must tolerate failures 4.
within a reasonable bound. Another issue in biometric
authentication is that the verification of biometrics should
be performed by the server instead of other devices, since C (using P W1 ) and S (using SK1 ) first execute the 2-
such devices are usually remotely located from the server Factor-Reg protocol of SCPAP. Let Data1 be the data
and cannot be fully trusted. The above two subtle issues generated by S at this step.
seem to be neglected in a recent three-factor authentication 5.
protocol proposed by Li and Hwang [18]. The detailed
analysis of their protocol is given in the supplementary file
(Section 1), which can be found on the Computer Society C and S have another run of 2-Factor-Reg protocol,
Digital Library at http://doi.ieeecomputersociety.org/ where C registers P W2 and S uses SK2 to generate the
10.1109/TPDS.2010.206. corresponding data Data2 . P W2 will be deleted
immediately once the registration is complete.
4 A GENERIC FRAMEWORK FOR THREE-FACTOR 6. S generates a smart card SC which contains Data1
AUTHENTICATION and Data2 . The client C is given SC.
7. C updates the data in the smart card SC by adding
This section describes a generic approach for three-factor
Data3 ¼ fthe auxiliary string P , the description of the
authentication from a smart-card-based password authen-
hash function h, the reproduction algorithm Rep}.
tication protocol (SCPAP, Definition 1) and a fuzzy
extractor (Definition 5). The design philosophy of our This completes the description of the 3-Factor-Reg protocol
approach can be found in the supplementary file (Section 2), in our framework. As in the existing authentication
which can be found on the Computer Society Digital protocols, we assume the registration phase is performed
Library at http://doi.ieeecomputersociety.org/10.1109/ in a secure and reliable environment, and particularly the
TPDS.2010.206, where a graphical representation (Fig. 1) is device at Step 2 is trusted for its purpose. After a successful
given to illustrate the three-factor authentication process. registration, the client C will have a smart card SC (contains
4.1 3-Factor-Initialization fData1 ; Data2 ; Data3 g). The initial password is P W1 . Notice
We first describe the initialization phase in the proposed that neither the server nor the smart card has a copy of
framework. This phase generates a public parameter and a client’s biometric characteristics.
Authorized licensed use limited to: Asia University. Downloaded on April 20,2024 at 02:35:31 UTC from IEEE Xplore. Restrictions apply.
HUANG ET AL.: A GENERIC FRAMEWORK FOR THREE-FACTOR AUTHENTICATION: PRESERVING SECURITY AND PRIVACY IN... 1395
REFERENCES [24] H. Tian, X. Chen, and Y. Ding, “Analysis of Two Types Deniable
Authentication Protocols,” Int’l J. Network Security, vol. 9, no. 3,
[1] D.V. Klein, “Foiling the Cracker: A Survey of, and Improvements pp. 242-246, July 2009.
to, Password Security,” Proc. Second USENIX Workshop Security,
1990. Xinyi Huang received the PhD degree in
[2] Biometrics: Personal Identification in Networked Society, A.K. Jain, computer science (information security) in
R. Bolle, and S. Pankanti, eds. Kluwer, 1999. 2009, from the School of Computer Science
[3] D. Maltoni, D. Maio, A.K. Jain, and S. Prabhakar, Handbook of and Software Engineering, the University of
Fingerprint Recognition. Springer-Verlag, 2003. Wollongong, Australia. He is currently a post-
[4] Ed. Dawson, J. Lopez, J.A. Montenegro, and E. Okamoto, “BAAI: doctoral fellow in the School of Information
Biometric Authentication and Authorization Infrastructure,” Proc. Systems, Singapore Management University.
IEEE Int’l Conf. Information Technology: Research and Education His research interests focus on the cryptography
(ITRE ’03), pp. 274-278, 2004. and its applications in information systems. He
[5] J.K. Lee, S.R. Ryu, and K.Y. Yoo, “Fingerprint-Based Remote User has published more than 40 referred research
Authentication Scheme Using Smart Cards,” Electronics Letters, papers at international conferences and journals. His research results
vol. 38, no. 12, pp. 554-555, June 2002. have more than 350 citations.
[6] C.C. Chang and I.C. Lin, “Remarks on Fingerprint-Based
Remote User Authentication Scheme Using Smart Cards,”
ACM SIGOPS Operating Systems Rev., vol. 38, no. 4, pp. 91-96,
Yang Xiang received the PhD degree in
Oct. 2004.
computer science from Deakin University,
[7] C.H. Lin and Y.Y. Lai, “A Flexible Biometrics Remote User Melbourne, Australia, in April 2007. He is
Authentication Scheme,” Computer Standards Interfaces, vol. 27, currently with School of Information Technol-
no. 1, pp. 19-23, Nov. 2004. ogy, Deakin University. His research interests
[8] M.K. Khan and J. Zhang, “Improving the Security of ‘A Flexible include network and system security, distribu-
Biometrics Remote User Authentication Scheme’,” Computer ted systems, and wireless systems. In particu-
Standards Interfaces, vol. 29, no. 1, pp. 82-85, Jan. 2007. lar, he is currently leading in a research group
[9] C.J. Mitchell and Q. Tang, “Security of the Lin-Lai Smart Card developing active defense systems against
Based User Authentication Scheme,” Technical Report RHUL- large-scale network attacks and new Internet
MA20051, http://www.ma.rhul.ac.uk/static/techrep/2005/ security countermeasures. He has published more than 100 research
RHUL-MA-2005-1.pdf, Jan. 2005. papers in international journals and conferences. He has served as
[10] E.J. Yoon and K.Y. Yoo, “A New Efficient Fingerprint-Based program/general chair for many international conferences such as
Remote User Authentication Scheme for Multimedia Systems,” ICA3PP 11, IEEE HPCC 10/09, IEEE ICPADS 08, and NSS 10/09/08/
Proc. Ninth Int’l Conf. Knowledge-Based Intelligent Information and 07. He is on the editorial board of Journal of Network and Computer
Eng. Systems (KES), 2005. Applications. He is a member of the IEEE.
[11] Y. Lee and T. Kwon, “An improved Fingerprint-Based Remote
User Authentication Scheme Using Smart Cards,” Proc. Int’l Conf.
Computational Science and Its Applications (ICCSA), 2006.
[12] H.S. Kim, J.K. Lee, and K.Y. Yoo, “ID-Based Password Ashley Chonka received the bachelor of com-
Authentication Scheme Using Smart Cards and Fingerprints,” puter science degree in 2001 and the master’s of
ACM SIGOPS Operating Systems Rev., vol. 37, no. 4, pp. 32-41, information techology (professional) degree in
Oct. 2003. 2005. He also received the PhD degree from
[13] M. Scott, “Cryptanalysis of an ID-Based Password Authentication Deakin University on 5 May 2010. He has
Scheme Using Smart Cards and Fingerprints,” ACM SIGOPS successfully published more than 20 peer-
Operating Systems Rev., vol. 38, no. 2, pp. 73-75, Apr. 2004. reviewed papers and is currently a lecturer at
[14] A. Bhargav-Spantzel, A.C. Squicciarini, E. Bertino, S. Modi, M. Deakin University. His research interests are in
Young, and S.J. Elliott, “Privacy Preserving Multi-Factor Authen- the area of Network security, MultiCore, Cyber-
tication with Biometrics,” J. Computer Security, vol. 15, no. 5, Warfare, Chaos Theory, and Honeypot systems.
pp. 529-560, 2007.
[15] S. Goldwasser, S. Micali, and C. Rackoff, “The Knowledge
Complexity of Interactive Proof-Systems,” SIAM J. Computing,
vol. 18, no. 1, pp. 186-208, Feb. 1989.
[16] U. Uludag, S. Pankanti, S. Prabhakar, and A.K. Jain, “Biometric
Cryptosystems: Issues and Challenges,” Proc. IEEE, Special Issue
on Multimedia Security for Digital Rights Management, vol. 92,
no. 6, pp. 948-960, June 2004.
[17] C.-I. Fan and Y.-H. Lin, “Provably Secure Remote Truly Three-
Factor Authentication Scheme with Privacy Protection on Bio-
metrics,” IEEE Trans. Information Forensics and Security, vol. 4,
no. 4, pp. 933-945, Dec. 2009.
[18] C.T. Li and M.-S. Hwang, “An Efficient Biometrics-Based Remote
User Authentication Scheme Using Smart Cards,” J. Network and
Computer Applications, vol. 33, no. 1, pp. 1-5, 2010.
[19] P.C. Kocher, J. Jaffe, and B. Jun, “Differential Power Analysis,”
Proc. Int’l Cryptology Conf. (CRYPTO), pp. 388-397, 1999.
[20] T.S. Messerges, E.A. Dabbish, and R.H. Sloan, “Examining
Smart-Card Security under the Threat of Power Analysis
Attacks,” IEEE Trans. Computers, vol. 51, no. 5, pp. 541-552,
May 2002.
[21] Y. Dodis, L. Reyzin, and A. Smith, “Fuzzy Extractors: How to
Generate Strong Keys from Biometrics and Other Noisy Data,”
Proc. Int’l Conf. Theory and Applications of Cryptographic Techniques
(Eurocrypt), pp. 523-540, 2004.
[22] N.K. Ratha, J.H. Connell, and R.M. Bolle, “Enhancing Security and
Privacy in Biometrics-Based Authentication Systems,” IBM Sys-
tems J., vol. 40, no. 3, pp. 614-634, 2001.
[23] M.-H. Lim and A.B.J. Teoh, “Cancelable Biometrics,” Scholarpedia,
vol. 5, no. 1, p. 9201, 2010.
Authorized licensed use limited to: Asia University. Downloaded on April 20,2024 at 02:35:31 UTC from IEEE Xplore. Restrictions apply.
HUANG ET AL.: A GENERIC FRAMEWORK FOR THREE-FACTOR AUTHENTICATION: PRESERVING SECURITY AND PRIVACY IN... 1397
Jianying Zhou received the PhD degree in Robert H. Deng received the bachelor’s degree
information security from the University of from National University of Defense Technology,
London, in 1997. He is a senior scientist at China, the MSc and PhD degrees from the
Institute for Infocomm Research (I2 R), and Illinois Institute of Technology. He has been with
heads the Network Security Group. His research the Singapore Management University since
interests are in computer and network security, 2004, and is currently professor, associate dean
cryptographic protocol, mobile and wireless for Faculty & Research, School of Information
communications security. He has published Systems. Prior to this, he was principal scientist
about 150 referred papers at international and manager of Infocomm Security Department,
conferences and journals. He is actively involved Institute for Infocomm Research, Singapore. He
in the academic community, having served in many international has 26 patents and more than 200 technical publications in international
conference committees as general chair, program chair and PC conferences and journals in the areas of computer networks, network
member, having been in the editorial board and as a regular reviewer security and information security. He has served as general chair,
for many international journals. He is a cofounder and steering program committee chair, and program committee member of numerous
committee member of International Conference on Applied Cryptogra- international conferences. He is an associate editor of the IEEE
phy and Network Security (ACNS). Transactions on Information Forensics and Security, associate editor
of Security and Communication Networks Journal (John Wiley), and
member of Editorial Board of Journal of Computer Science and
Technology (the Chinese Academy of Sciences). He received the
University Outstanding Researcher Award from the National University
of Singapore in 1999 and the Lee Kuan Yew Fellow for Research
Excellence from the Singapore Management University in 2006. He was
named Community Service Star and Showcased Senior Information
Security Professional by (ISC)2 under its Asia-Pacific Information
Security Leadership Achievements program in 2010. He is a senior
member of the IEEE.
Authorized licensed use limited to: Asia University. Downloaded on April 20,2024 at 02:35:31 UTC from IEEE Xplore. Restrictions apply.