Current Issue - September 2018, Volume 10, Number 5

International Journal of Network Security & Its Applications (IJNSA)

ISSN 0974 - 9330 (Online); 0975 - 2307 (Print)

http://airccse.org/journal/ijnsa.html

Current Issue

September 2018, Volume 10, Number 5

Benchmarks for Evaluating Anomaly Based Intrusion Detection Solutions

Nicholas J. Miller and Mehrdad Aliasgari, California State University, USA

Paper Link : http://aircconline.com/ijnsa/V10N5/10518ijnsa01.pdf

The Effect of Information Technology Using Enterprise Security Risk Management

Michael O. Adekanye and Shawon S. M. Rahman, University of Hawaii-Hilo, USA

Paper Link : http://aircconline.com/ijnsa/V10N5/10518ijnsa02.pdf

A Tiered Blockchain Framework for Vehicular Forensics

Marcel C. Ugwu1, Izunna U. Okpala2, Collins I. Oham3 and Cosmas I. Nwakanma3, 1Seamfix Nigeria Limited, Nigeria, 

2National Institute for Nigerian Languages, Nigeria and 3Federal University of Technology, Nigeria

Paper Link : http://aircconline.com/ijnsa/V10N5/10518ijnsa03.pdf

COUNTERMEASURE TOOL - CARAPACE FOR NETWORK SECURITY

COUNTERMEASURE TOOL - CARAPACE FOR NETWORK SECURITY

Anand Bisen1, Shrinivas Karwa2, B.B. Meshram3

1,2,3Department of Computer Engineering, Veermata Jijabai Technological

Institute, Mumbai, MH, India

Abstract

Now a day frequency of attacks on network is increased. In this, denial of services (DOS) and IP spoofing are more common. It is very difficult to find out these attacks. Denial of services (DOS) and its type Distributed denial of services (DDOS) are significant problem because it is very hard to detect it. Its main aim to shut resource from internet, and make resource unavailable to legitimate users. IP source address forgery, or “spoofing,” is a long-recognized consequence of the Internet’s lack of packet-level authenticity. IP spoofing is very powerful when it implemented with Distributed denial of services (DDOS). In this paper we deal with the information gathering process to do attacks. The information gathering about the weaknesses of the target system and helps to do attack. Lastly we proposed a new model to protect from attacks.

Keywords

Distributed denial of service (DDOS), IP spoofing

Original Source Link : http://airccse.org/journal/nsa/0511ijnsa02.pdf

http://airccse.org/journal/jnsa11_current.html

System Dynamics Based Insider Threats Modeling

System Dynamics Based Insider Threats Modeling

Sang-Chin Yang 1 and Yi-Lu Wang 2

1 The Institute of Resource Management and Decision Science, Management College,National Defense University, Tahsi, Taoyuan 33509, Taiwan, Republic of China

2 School of Defense Science, Chung Cheng Institute of Technology, National Defense University, Tahsi, Taoyuan 33509, Taiwan, Republic of China

ABSTRACT

Insider threat has been recognized as one of the most dangerous security threats and become a much  more complex issue. Insider threat is resulted from the legitimate users abusing their privileges and cause tremendous damage or losses. Not always being friends, insiders can be main threats to the organization. Currently, there is no equivalent prevention solution for insider threat to an intrution prevention system or vulnerability scanner. From the survey of literature of insider threat studies, we conclude that the system dynamics (SD) is an effective tool to analyze the root causes of insider threat incidents and evaluate mitigation strategies from people, process, and technology perspectives. A generized case based SD model can be tailored and applied to analyze and evaluate specific insider threat incidents. We present a well known insider threat incident of Taiwan and tailor the generized case based SD model to analyze it. The simulation results indicate that the risk of insider threats can be reduced and the probability of detecting insider threats can be increased.

KEYWORDS

System Dynamics, Insider Threat, Modeling

Original Source Link : http://airccse.org/journal/nsa/0511ijnsa01.pdf

http://airccse.org/journal/jnsa11_current.html

MINING PATTERNS OF SEQUENTIAL MALICIOUS APIS TO DETECT MALWARE

A QoS Based MAC Protocol For Wireless Ad-hoc Network

A QoS Based MAC Protocol For Wireless Ad-hoc Network

Vandana khare1, Dr. D. SrinivasRao2, Dr. Y. Madhavee Latha3

1Associate professor, CMEC,Hyd(A.P), India

2ECE Professor, JNTUH,Hyd (A.P), India

3ECE Principal, MRECW, Hyd(A.P), India

Abstract

Multimedia communication over wireless Ad-hoc networks has become the driving technology for many of the important applications, experiencing dramatic market growth and promising revolutionary experiences in personal communication, gaming, entertainment, military, security, environment monitoring, and more. The advances in wireless communications and growth of real-time applications have necessitated the development of wireless networks that can support high Quality of Service (QoS) and power control. A node in an ad hoc network is normally battery operated which poses a huge constraint on the power consumption of such a node. Hence, designing a power efficient MAC protocol for ad hoc wireless networks is a major challenge. In this paper, we propose a CDMA based power controlled medium access protocol for mobile and ad hoc network (MNA). The protocol conserves power and provides QoS guarantees for multimedia traffics. In that network one of the fundamental challenger in MANETs is how to increase the overall network throughputs well as reading the delay while maintaining how energy consumption for packet processing in communication. simulation results shows that the performance of the protocol with increase in traffic while QoS is better in terms of Energy consumption, throughput, & communication delay than existing protocol.

Keywords: 

QoS, MANETS, Multimedia, CDMA throughput, delay.

Original Source Link : http://airccse.org/journal/nsa/0311nsa15.pdf

http://airccse.org/journal/jnsa11_current.html

IMAGE ENCRYPTION BASED ON DIFFUSION AND MULTIPLE CHAOTIC MAPS

IMAGE ENCRYPTION BASED ON DIFFUSION AND MULTIPLE CHAOTIC MAPS

1G.A.Sathishkumar ,2Dr.K.Bhoopathy bagan and 3Dr.N.Sriraam

1 Associate Professor, Department of Electronics and Communication Engineering, Sri Venkateswara College of Engineering,Sriperumbudur -602108.

2Professor and HEAD, Department of Instrumentation , Madras Institute of Technology, Chrompet, Chennai-600044

3 Professor and Head, Department of Biomedical Engineering, SSN College of Engineering, Chennai 603110

ABSTRACT

In the recent world, security is a prime important issue, and encryption is one of the best alternative way to ensure security. More over, there are many image encryption schemes have been proposed, each one of them has its own strength and weakness. This paper presents a new algorithm for the image encryption/decryption scheme. This paper is devoted to provide a secured image encryption technique using multiple chaotic based circular mapping. In this paper, first, a pair of sub keys is given by using chaotic logistic maps. Second, the image is encrypted using logistic map sub key and in its transformation leads to diffusion process. Third, sub keys are generated by four different chaotic maps. Based on the initial conditions, each map may produce various random numbers from various orbits of the maps.Among those random numbers, a particular number and from a particular orbit are selected as a key for the encryption algorithm. Based on the key, a binary sequence is generated to control the encryption algorithm. The input image of 2-D is transformed into a 1- D array by using two different scanning pattern (raster and Zigzag ) and then divided into various sub blocks. Then the position permutation and value permutation is applied to each binary matrix based on multiple chaos maps. Finally the receiver uses the same sub keys to decrypt the encrypted images. The salient features of the proposed image encryption method are loss-less, good peak signal –to noise ratio (PSNR), Symmetric key encryption, less cross correlation, very large number of secret keys, and key-dependent pixel value replacement.

KEYWORDS

Logistic Map, Tent Map, Quadratic Map, and Bernoulli Map, Chaos, diffusion process and Stream Cipher. 

Original Source Link : http://airccse.org/journal/nsa/0311nsa14.pdf

http://airccse.org/journal/jnsa11_current.html

A ROBUST MECHANISM FOR DEFENDING DISTRIBUTED DENIAL OF SERVICE ATTACKS ON WEB SERVERS

A ROBUST MECHANISM FOR DEFENDING DISTRIBUTED DENIAL OF SERVICE ATTACKS ON WEB SERVERS

Jaydip Sen

Innovation Labs, Tata Consultancy Services Ltd.,

Bengal Intelligent Park, Salt Lake Electronic Complex, Kolkata, INDIA

ABSTRACT

Distributed Denial of Service (DDoS) attacks have emerged as a popular means of causing mass targeted service disruptions, often for extended periods of time. The relative ease and low costs of launching such attacks, supplemented by the current inadequate sate of any viable defense mechanism, have made them one of the top threats to the Internet community today. Since the increasing popularity of web-based applications has led to several critical services being provided over the Internet, it is imperative to monitor the network traffic so as to prevent malicious attackers from depleting the resources of the network and denying services to legitimate users. This paper first presents a brief discussion on some of the important types of DDoS attacks that currently exist and some existing mechanisms to combat these attacks. It then points out the major drawbacks of the currently existing defense mechanisms and proposes a new mechanism for protecting a web-server against a DDoS attack. In the proposed mechanism, incoming traffic to the server is continuously monitored and any abnormal rise in the inbound traffic is immediately detected. The detection algorithm is based on a statistical analysis of the inbound traffic on the server and a robust hypothesis testing framework. While the detection process is on, the sessions from the legitimate sources are not disrupted and the load on the server is restored to the normal level by blocking the traffic from the attacking sources. To cater to different scenarios, the detection algorithm has various modules with varying level of computational and memory overheads for their execution. While the approximate modules are fast in detection and involve less overhead, they provide lower level of detection accuracy. The accurate modules employ complex detection logic and hence involve more overhead for their execution. However, they have very high detection accuracy. Simulations carried out on the proposed mechanism have produced results that demonstrate effectiveness of the proposed defense mechanism against DDoS attacks.

KEYWORDS

Distributed denial of service (DDoS), traffic flow, buffer, Poisson arrival, queuing model, statistical test of significance, Kolmogorov-Smirnov test, statistical hypothesis testing. 

Original Source Link : http://airccse.org/journal/nsa/0311nsa13.pdf

http://airccse.org/journal/jnsa11_current.html

Substitution-diffusion based Image Cipher

Substitution-diffusion based Image Cipher

Narendra K Pareek1, Vinod Patidar2 and Krishan K Sud2

1 University Computer Centre, Vigyan Bhawan,M L Sukhadia University, Udaipur-313 002, India.

2 Department of Physics, School of Engineering, Sir Padampat Singhania University, Bhatewar, Udaipur- 313 601, India.

ABSTRACT

In this paper, a new image encryption scheme using a secret key of 128-bit size is proposed. In the algorithm, image is partitioned into several key based dynamic blocks and further, each block passes through the eight rounds of diffusion as well as substitution process. In diffusion process, sequences of block pixels are rearranged within the block by a zigzag approach whereas block pixels are replaced with another by using difference calculation of row and column in substitution process. Due to high order of substitution and diffusion, common attacks like linear and differential cryptanalysis are infeasible. The experimental results show that the proposed technique is efficient and has high security features.

KEYWORDS

Image encryption, Image Processing, Diffusion, Substitution, Secret key, Information security.

Original Source Link : http://airccse.org/journal/nsa/0311nsa12.pdf

http://airccse.org/journal/jnsa11_current.html

STAGE STAFFING SCHEME FOR COPYRIGHT PROTECTION IN MULTIMEDIA

STAGE STAFFING SCHEME FOR COPYRIGHT PROTECTION IN MULTIMEDIA

Sumit Kumar1, Santosh Kumar1, Sukumar Nandi1

1Department of Computer Science & Engineering Indian Institute of Technology Guwahati, India

ABSTRACT

Copyright protection has become a need in today’s world. To achieve a secure copyright protection we embedded some information in images and videos and that image or video is called copyright protected. The embedded information can’t be detected by human eye but some attacks and operations can tamper that information to breach protection. So in order to find a secure technique of copyright protection, we have analyzed image processing techniques i.e. Spatial Domain (Least Significant Bit (LSB)), Transform Domain (Discrete Cosine Transform (DCT)), Discrete Wavelet Transform (DWT) and there are numerous algorithm for watermarking using them. After having a good understanding of the same we have proposed a novel algorithm named as Stage Staffing Algorithm that generates results with high effectiveness, additionally we can use self extracted-watermark technique to increase the security and automate the process of watermark image. The proposed algorithm provides protection in three stages. We have implemented the algorithm and results of the simulations are shown. The various factors affecting spatial domain watermarking are also discussed.

KEYWORDS

Copyright Protection, Stage staffing watermarking, Digital Multimedia, Encryption and Decryption algorithm for watermarking, Logistic Map, 2-D Arnold Cat Map, Stage Staffing

Original Source Link : http://airccse.org/journal/nsa/0311nsa11.pdf

http://airccse.org/journal/jnsa11_current.html

REPLICATION ATTACK MITIGATIONS FOR STATIC AND MOBILE WSN

REPLICATION ATTACK MITIGATIONS FOR STATIC AND MOBILE WSN

V.Manjula1 and Dr.C.Chellappan 2

1Department of Computer science and Engineering, Anna University, Chennai, India

ABSTRACT

Security is important for many sensor network applications. Wireless Sensor Networks (WSN) are often deployed in hostile environments as static or mobile, where an adversary can physically capture some of the nodes. once a node is captured, adversary collects all the credentials like keys and identity etc. the attacker can re-program it and replicate the node in order to eavesdrop the transmitted messages or compromise the functionality of the network. Identity theft leads to two types attack: clone and sybil. In particularly a harmful attack against sensor networks where one or more node(s) illegitimately claims an identity as replicas is known as the node replication attack. The replication attack can be exceedingly injurious to many important functions of the sensor network such as routing, resource  llocation, misbehavior detection, etc. This paper analyzes the threat posed by the replication attack and several novel techniques to detect and defend against the replication attack, and analyzes their effectiveness in both static and mobile WSN.

KEYWORDS

Security, Clone, Sybil, node replication attack, static and mobile WSN.

Original Source Link : http://airccse.org/journal/nsa/0311nsa10.pdf

http://airccse.org/journal/jnsa11_current.html

A NOVEL DATA ENCRYPTION TECHNIQUE BY GENETIC CROSSOVER OF ROBUST BIOMETRIC KEY AND SESSION BASED PASSWORD

A NOVEL DATA ENCRYPTION TECHNIQUE BY GENETIC CROSSOVER OF ROBUST BIOMETRIC KEY AND SESSION BASED PASSWORD

Tanmay Bhattacharya1, Sirshendu Hore 2, Ayan Mukherjee 3 and S. R. Bhadra Chaudhuri4

1 Sr. Lecturer, Dept. of IT, JIS College Engineering, Kalyani, West Bengal, India.

2Lecturer, Dept. of CSE, Hooghly Engineering & Technology College,Pipulpati,Hooghly, West Bengal, India.

3 Lecturer, Dept. of CSE, Institute of Science & Technology, Chandrakona Town,Paschim Medinipur, West Bengal, India.

4Professor, Dept. of E&TC Engg., Bengal Engineering & Science University, Shibpur,Howrah, West Bengal, India.

ABSTRACT

In Fingerprint based Biometric authentication image of the fingerprint can be scanned and can be used later on for the purpose of authentication. So this process does not provide very high security. This paper proposes another level of security by using the concept of combined key. The key is obtained by crossing over of the Session key generated from the password given by the legitimate user and the Biometric key generated from the fingerprint of the same user. The proposed approach trained the system by Artificial Neural Network in such a way that a small portion of the fingerprint is enough to generate the Biometric key which minimizes the chance of false rejection. So in this approach there is a significant improvement of the traditional authentication techniques.

KEYWORDS

ANN; Minutiae; Sessionbased; Training; SHA-512, Crossover;

Original Source Link : http://airccse.org/journal/nsa/0311nsa09.pdf

http://airccse.org/journal/jnsa11_current.html

UNCOERCIBILITY IN E-VOTING AND EAUCTIONING MECHANISMS USING DENIABLE ENCRYPTION

UNCOERCIBILITY IN E-VOTING AND EAUCTIONING MECHANISMS USING DENIABLE ENCRYPTION

Jaydeep Howlader1, Vivek Nair1, Saikat Basu2 and A. K. Mal3

1Department of Information Technology, National Institute of Technology, Durgapur,India

2Department of Computer Science and Engineering, National Institute of Technology,Durgapur, India

3Department of Electronics and Communication Engineering, National Institute of Technology, Durgapur, India

ABSTRACT

The uncoercibility to prevent rigging in e-voting and e-auction have been studied in different literatures. It is realized that the notion of a virtual booth and untappable channel are required to prevent coerciveness. Virtual booth protects the candidates to cast their private values without being observed by the adversary/coercer. However the adversary can influence the candidates after their casting. Adversary used to acquire the encrypted votes/bids either from the colluded authorities (voting server, auctioneer) or by eavesdropping the communicating channel and coerces the candidates to disclose their private values with the private keys and verifies whether the ciphers are the encryption of the private values. In the prior literatures of e-voting and e-auctioning, threshold-encryption and receipt-free mechanism are used to prevent the coercion and collusion respectively. But they assumed untappable channel to restrict eavesdropping. However, practically untappable channel is difficult to achieve. It should be a dedicated trusted link or continuous fiber link to implement untappable channel. In this paper we present an alternative of untappable channel using deniable encryption. An encryption scheme is deniable if the sender can formulate ‘fake random choice’ that will make the cipher text ‘look like’ an encryption of a different plaintext, thus keeping the real plaintext private. Deniable encryption does not restrict the adversary to eavesdrop, but if the candidates are coerced, they are able to formulate a different value fv and can convince the adversary that the ciphers are the encryption of fv , without revealing the true private value r v . Therefore, eavesdropping does not help the coercer, as he may be plausibly denied by the candidates. Our scheme is based on public key probabilistic encryption mechanism. We assume that the sender side (candidate) coercion is only applicable, that is, the coercer cannot coerce the receivers (authorities).

KEYWORDS

coercing, rigging, receipt-free, deniable encryption, probabilistic encryption 

Original Source Link : http://airccse.org/journal/nsa/0311nsa08.pdf

http://airccse.org/journal/jnsa11_current.html

Investigating the Combination of Text and Graphical Passwords for a more secure and usable experience

Investigating the Combination of Text and Graphical Passwords for a more secure and usable experience

C Singh1, L Singh2

1Chandrashekar Singh

2Lenandlar Singh Lecturer, University of Guyana

ABSTRACT

Security has been an issue from the inception of computer systems and experts have related security issues with usability. Secured systems must be usable to maintain intended security. Password Authentication Systems have either been usable and not secure, or secure and not usable. Increasing either tends to complicate the other.Text passwords are widely used but suffer from poor usability, reducing its security. Graphical Passwords, while usable, does not seem to have the security necessary to replace text passwords. Attempts using text or graphics only have mixed results. A combination password is proposed as a potential solution to the problem.This paper explores combination as a means of solving this password problem. We implemented three password systems: Text only, Graphics only and a Combination of Text and Graphics. Remote evaluations were conducted with 105 computer science students. Results from our evaluations, though not conclusive, suggest promise for combination passwords.

Keywords: 

security, usability, authentication.

Original Source Link : http://airccse.org/journal/nsa/0311nsa07.pdf

http://airccse.org/journal/jnsa11_current.html

Confidentiality & Authentication Mechanism for Biometric Information Transmitted over Low Bandwidth & Unreliable channel

Confidentiality & Authentication Mechanism for Biometric Information Transmitted over Low Bandwidth & Unreliable channel

Raju Singh1 and A.K.Vatsa

School of Computer Engineering and IT, Shobhit University, Meerut, India. 

ABSTRACT

The security of bio-metric information – finger print, retina mapping, DNA mapping and some other chemical and biological modified genes related information - transfer through low bandwidth and unreliable or covert channel is challenging task. Therefore, Security of biometric information is essential requirement in this fast developing communication world. Thus, in this paper, we propose efficient and effective mechanism for confidentiality and authentication for biometric information transmitted by using arithmetic encoding representation over low bandwidth and unreliable channel. It enhances the speed of encryption, decryption and authentication process. It uses arithmetic encoding scheme and public key cryptography e.g. modified version of RSA algorithm called RSA-2 algorithm.

KEYWORDS 

Public key cryptography, Encryption, Decryption, Biometric Information, Arithmetic encoding, Diffie-Hellman Algorithm, Covert Channel.

Original Source Link : http://airccse.org/journal/nsa/0311nsa06.pdf

http://airccse.org/journal/jnsa11_current.html

DESIGN AND EFFICIENT DEPLOYMENT OF HONEYPOT AND DYNAMIC RULE BASED LIVE NETWORK INTRUSION COLLABORATIVE SYSTEM

DESIGN AND EFFICIENT DEPLOYMENT OF HONEYPOT AND DYNAMIC RULE BASED LIVE NETWORK INTRUSION COLLABORATIVE SYSTEM

Renuka Prasad.B1, Dr Annamma Abraham2, and Abhas Abhinav3,Sunil.V.Gurlahosur4, Srinivasa Y5

1Research Scholar, Dr M.G.R University, Working as Lecturer in R.V.College ofEngineering, Bengaluru, Karnataka

2Head , Department of Mathematics,BMSIT, Bengaluru, Karnataka

3Head ,Research and Development, DeepRootLinux Pvt Ltd, Bengaluru,Karnataka

4&5Student, BE ,Computer Science and Engineering, SIT,Tumkur, Karnataka

ABSTRACT

The continuously emerging, operationally and managerially independent, geographically distributed computer networks deployable in an evolutionarily manner have created greater challenges in securing them. Several research works and experiments have convinced the security expert that Network Intrusion Detection Systems (NIDS) or Network Intrusion Prevention Systems (NIPS) alone are not capable of securing the Computer Networks from internal and external threats completely. In this paper we present the design of Intrusion Collaborative System which is a combination of NIDS,NIPS, Honeypots, software tools like nmap, iptables etc. Our Design is tested against existing attacks based on Snort Rules and several customized DDOS , remote and guest attacks. Dynamic rules are generated during every unusual behavior that helps Intrusion Collaborative System to continuously learn about new attacks. Also a formal approach to deploy Live Intrusion Collaboration Systems based on System of Systems Concept is Proposed.

KEYWORDS

Network Intrusion Detection, Network Intrusion Prevention, IPTABLES, Honeypot and NICS. 

Original Source Link : http://airccse.org/journal/nsa/0311nsa05.pdf

http://airccse.org/journal/jnsa11_current.html

THE KEY EXCHANGE CRYPTOSYSTEM USED WITH HIGHER ORDER DIOPHANTINE EQUATIONS

THE KEY EXCHANGE CRYPTOSYSTEM USED WITH HIGHER ORDER DIOPHANTINE EQUATIONS

Harry Yosh

HECO Ltd, Canberra, Australia

ABSTRACT

One-way functions are widely used for encrypting the secret in public key cryptography, although they are regarded as plausibly one-way but have not been proven so. Here we discuss the public key cryptosystem based on the system of higher order Diophantine equations. In this system those Diophantine equations are used as public keys for sender and recipient, and both sender and recipient can obtain the shared secret through a trapdoor, while attackers must solve those Diophantine equations without trapdoor. Thus the scheme of this cryptosystem might be considered to represent a possible one-way function. We also discuss the problem on implementation, which is caused from additional complexity necessary for constructing Diophantine equations in order to prevent from attacking by tamperers. 

KEYWORDS

public-key cryptography, one-way function, Diophantine equation, quotient ring, NP-complete

Original Source Link : http://airccse.org/journal/nsa/0311nsa04.pdf

http://airccse.org/journal/jnsa11_current.html

Digital Watermarking through Embedding of Encrypted and Arithmetically Compressed Data into Image using Variable-Length Key

Digital Watermarking through Embedding of Encrypted and Arithmetically Compressed Data into Image using Variable-Length Key

Sabyasachi Samanta 1, Saurabh Dutta 2, Goutam Sanyal3

1Haldia Institute of Technology, Haldia, WB, INDIA

2Dr. B. C. Roy Engineering College, Durgapur, WB, INDIA

3National Institute of Technology, Durgapur, WB, INDIA,

Abstract:

In this paper, we have encrypted a text to an array of data bits through arithmetic coding technique. For this, we have assigned a unique range for both, a number of characters and groups using those. Using unique range we may assign range only 10 characters. If we want to encrypt a large number of characters, then every character has to assign a range with their group range of hundred, thousand and so on. Long textual message which have to encrypt, is subdivided into a number of groups with few characters. Then the group of characters is encrypted into floating point numbers concurrently to their group range by using arithmetic coding, where they are automatically compressed. Depending on key, the data bits from text are placed to some suitable nonlinear pixel and bit positions about the image. In the proposed technique, the key length and the number of characters for any encryption process is both variable.

Key words:

pixel, invisible digital watermarking, arithmetic coding, symmetric key, nonlinear function. 

Original Souce Link : http://airccse.org/journal/nsa/0311nsa03.pdf

http://airccse.org/journal/jnsa11_current.html

CRYPTANALYSIS AND FURTHER IMPROVEMENT OF A BIOMETRIC-BASED REMOTE USER AUTHENTICATION SCHEME USING SMART CARDS

CRYPTANALYSIS AND FURTHER IMPROVEMENT OF A BIOMETRIC-BASED REMOTE USER AUTHENTICATION SCHEME USING SMART CARDS

Ashok Kumar Das

Center for Security, Theory and Algorithmic Research International Institute of Information Technology, Hyderabad 500 032, India

ABSTRACT

Recently, Li et al. proposed a secure biometric-based remote user authentication scheme using smart cards to withstand the security flaws of Li-Hwang’s efficient biometric-based remote user authentication scheme using smart cards. Li et al.’s scheme is based on biometrics verification, smart card and one-way hash function, and it also uses the random nonce rather than a synchronized clock, and thus it is efficient in computational cost and more secure than Li-Hwang’s scheme. Unfortunately, in this paper we show that Li et al.’s scheme still has some security weaknesses in their design. In order to withstand those weaknesses in their scheme, we further propose an improvement of their scheme so that the improved scheme always provides proper authentication and as a result, it establishes a session key between the user and the server at the end of successful user authentication.

KEYWORDS

Remote user authentication, Biometrics, Cryptanalysis, Smart cards, Security.

Original source Link : http://airccse.org/journal/nsa/0311nsa02.pdf

http://airccse.org/journal/jnsa11_current.html