Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Shao, Zehuia; b | Li, Zepengc | Wu, Pua | Chen, Lanxiangd; * | Zhang, Xiaosonge
Affiliations: [a] Institute of Computing Science and Technology, Guangzhou University, Guangzhou, China | [b] School of Information Science and Engineering, Chengdu University, Chengdu, China | [c] School of Information Science and Engineering, Lanzhou University, Lanzhou, China | [d] College of Mathematics and Informatics, Fujian Normal University, Fujian Provincial Key Laboratory of Network Security and Cryptology, Fujian Network & Information Security Industry Technology Development Base, Fuzhou, China | [e] Center for Cyber Security, University of Electronic Science and Technology of China, Chengdu, China
Correspondence: [*] Corresponding author. Lanxiang Chen, College of Mathematics and Informatics, Fujian Normal University, Fujian Provincial Key Laboratory of Network Security and Cryptology, Fujian Network & Information Security Industry Technology Development Base, Fuzhou 350117, China. E-mail: lxiangchen@fjnu.edu.cn.
Abstract: Superior to single-factor authentication, multi-factor authentication (MFA) provides enhanced security by requiring at least two factors to authenticate an entity. It has been studied extensively in recent years and has been applied to various fields. However, there is no adaptive and quantified method to evaluate the dynamic threats coming from different attacks. In this paper, we introduce fuzzy dominating set to model the multiple factors of privacy-preserving identities, and propose an adaptive MFA combinatorial model to achieve adaptive choosing one or multiple privacy-preserving identities to authenticate the user. Moreover, we propose an integer linear programming for solving the Fuzzy Domination Model, and propose a greedy algorithm for Fuzzy Domination (GFD) and a primal dual greedy algorithm for Fuzzy Domination (PDFD) based on this integer linear programming. This work will reduce the gap between dynamic MFA and its practice applications. Finally, the effectiveness and efficiency of both algorithms in MFA are analyzed and experimental results demonstrate that PDFD is comparatively efficient and effective for solving instances with moderate orders.
Keywords: fuzzy dominating set, information security, multi-factor authentication, fuzzy graph theory
DOI: 10.3233/JIFS-181859
Journal: Journal of Intelligent & Fuzzy Systems, vol. 37, no. 4, pp. 4979-4985, 2019
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl