Dynamics User Identification Using Pairwise Client Coupling
Journal Title: Bonfring International Journal of Software Engineering and Soft Computing - Year 2019, Vol 9, Issue 2
Abstract
In this paper due to the increasing vulnerabilities in the internet, security alone isnt sufficient to keep a rupture, however digital crime scene investigation and cyber intelligence is also required to prevent future assaults or to identify the potential attacker. The unpretentious and incognito nature of biometric information gathering of keystroke dynamics has a high potential for use in cyber forensics or cyber intelligence and crime scene investigation or digital knowledge. The keystroke dynamics is a biometric assumption that different people typify in a unique way. The information accessing from computer systems is normally controlled by client accounts with usernames and passwords. If the set of data falls into the wrong hands, such a scheme has little security. For example fingerprints, can be used to strengthen security, however they require very expensive additional hardware. Keystroke dynamics with no additional hardware can be used. Keystroke dynamics is for the most part applicable to verification and identification also possible. In verification it is known who the client is supposed to be and the biometric system should verify if the user is who he claims to be in identification, the biometric The system should identify the client with keystroke dynamics without additional knowledge. This paper examines the usefulness of keystroke dynamics to determine the users identity. We propose three plans for user identification when entering a keyboard. We use different machine learning algorithms in conjunction with the proposed user coupling technology. In particular, we show that combined user coupling in a bottom - up tree structure scheme provides the best performance in terms of both precision and time complexity. The techniques proposed are validated by keystroke data. Lastly, we also examined the performance of the identification system and demonstrated that the performance was not optimal, as expected.
Authors and Affiliations
Tejaswi D, Rajasekar Rangasamy
Keywords
Related Articles
- EP ID EP588025
- DOI 10.9756/BIJSESC.9023
- Views 103
- Downloads 0
Parallel and Multiple E-Data Distributed Process with Progressive Duplicate Detection Model
In present, duplicate detection methods need to process ever larger datasets in ever shorter time: It is difficult to maintain the dataset. This project presents progressive duplicate detection algorithm that gradually i...
Review of Data Mining Classification Techniques
A Classification is one the most valuable critical techniques. In huge information Classification procedures is helpful to deal with substantial measure of information. Orders are utilized to foresee straight out class n...
A Survey on Big Data Security and Related Techniques to Improve Security
Upgrade of security and protection in portable server farms is challengeable with proficient security key administration. For promoting and research, huge numbers of the organizations utilize huge information, however mi...
Secure Sharing of Sensitive Data on a Big Data Platform
Clients store immense measures of delicate information on a major information stage. Sharing touchy information will help ventures decrease the expense of giving clients customized benefits and offer some incentive inclu...
Enhanced on Data Encryption Standard for Secured Cloud Storage
Present days many users store their significant data in cloud. To ensure that the security of the cloud stored data users need to encrypt the important data. The point of data security which has always been noteworthy as...