ORCID Profile
0000-0003-3491-687X
Current Organisations
University of Melbourne
,
Deakin University
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: IEEE
Date: 13-12-2021
Publisher: Hawaii International Conference on System Sciences
Date: 2018
Publisher: IEEE
Date: 12-2019
Publisher: Institution of Engineering and Technology (IET)
Date: 14-09-2023
DOI: 10.1049/QTC2.12073
Publisher: Association for Computing Machinery (ACM)
Date: 07-12-2023
DOI: 10.1145/3533705
Abstract: Continuous Authentication (CA) technologies enable users to be authenticated beyond just the point of entry. In this article, we conduct a comprehensive review of over 2,300 articles to (a) identify the main components of CA research to date, and (b) explore the current gaps and future research directions. Through a Citation Network Analysis (CNA), we identified that there are currently three primary focus research areas on CA - Keystroke Dynamics Mouse Movements and Mobile Device Touch, as well as identify an emerging trend in more recent studies on multi-modal CA authentication which utilises the numerous sensors that are embedded in modern mobile devices. This study also highlights the current gaps in the literature such as the need for a consensus over how to evaluate the application and utility of CA, and the need to examine the feasibility of CA technologies that currently exist based on more use case studies.
Publisher: Association for Computing Machinery (ACM)
Date: 04-03-2022
DOI: 10.1145/3501260
Abstract: This article first formalizes the problem of unlinkable attribute-based authentication in the system where each user possesses multiple assertions and uses them interchangeably. Currently, there are no recommendations for optimal usage of assertions in such authentication systems. To mitigate this issue, we use conditional entropy to measure the uncertainty for a Relying Party who attempts to link observed assertions with user labels. Conditional entropy is the function of usage statistics for all assertions in the system. Personal decisions made by the users about the usage of assertions contribute to these statistics. This collective effect from all the users impacts the unlinkability of authentication and must be studied using game theory. We specify several instances of the game where context information that is provided to the users differs. Through game theory and based on conditional entropy, we demonstrate how each user optimizes usage for the personal set of assertions. In the experiment, we substantiate the advantage of the proposed rational decision-making approaches: Unlinkability that we obtain under Nash equilibrium is higher than in the system where users authenticate using their assertions at random. We finally propose an algorithm that calculates equilibrium and assists users with the selection of assertions. This manifests that described techniques can be executed in realistic settings. This does not require modification of existing authentication protocols and can be implemented in platform-independent identity agents. As a use case, we describe how our technique can be used in Digital Credential Wallets: We suggest that unlinkability of authentication can be improved for Verifiable Credentials.
Publisher: Springer Science and Business Media LLC
Date: 07-11-2021
Publisher: IEEE
Date: 10-2021
Publisher: Springer Science and Business Media LLC
Date: 30-06-2021
Publisher: Springer Science and Business Media LLC
Date: 05-05-2023
Publisher: IEEE
Date: 12-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2024
No related grants have been discovered for Jongkil Jay Jeong.