Ved Prakash Gulati

A dynamic ID-based remote user authentication scheme

Password-based authentication schemes are the most widely used techniques for remote user authentication. Many static ID-based remote user authentication schemes both with and without smart cards have been proposed. Most of the schemes do not allow the users to choose and change their passwords, and maintain a verifier table to verify the validity of the user login. In this paper we present a dynamic ID-based remote user authentication scheme using smart cards. Our scheme allows the users to choose and change their passwords freely, and do not maintain any verifier table. The scheme is secure against ID-theft, and can resist the reply attacks, forgery attacks, guessing attacks, insider attacks and stolen verifier attacks.

A novel remote user authentication scheme using bilinear pairings

The paper presents a remote user authentication scheme using the properties of bilinear pairings. In the scheme, the remote system receives user login request and allows login to the remote system if the login request is valid. The scheme prohibits the scenario of many logged in users with the same login-ID, and provides a flexible password change option to the registered users without any assistance from the remote system.

Hierarchical key management scheme using polynomial interpolation

We present a hierarchical key management scheme using cryptographic hash function and Newtons polynomial interpolation for users key and system resources management. A similar technique has been proposed in 2002 by Shen and Chen, but their scheme suffers large computational overhead and security weakness. We show that our scheme is secure and efficient in comparisons to the Shen and Chens scheme.

An efficient secure key issuing protocol in ID-based cryptosystems

This paper presents an efficient and secure protocol for key issuing in ID-based cryptosystems using bilinear pairings. We use a simple blinding technique to eliminate the need of secure channel and multiple authorities approach to avoid the key escrow problem. We show that our protocol overcomes the disadvantages of other pairing based schemes and is efficient compared to the existing key issuing protocol.

Network traffic analysis using singular value decomposition and multiscale transforms

The present work integrates the multiscale transform provided by the wavelets and singular value decomposition (SVD) for the detection of anomaly in self-similar network data. The algorithm proposed in this paper uses the properties of singular value decomposition (SVD) of a matrix whose elements are local energies of wavelet coefficients at different scales. Unlike existing techniques, our method determines both the presence (i.e., the time intervals in which anomaly occurs) and the nature of anomaly (i.e., anomaly of bursty type, long or short duration, etc.) in network data. It uses the diagonal, left and right singular matrices obtained in SVD to determine the number of scales of self-similarity, location and scales of anomaly in data, respectively. Our simulation work on different data sets demonstrates that the method performs better than the existing anomaly detection methods proposed for self-similar data.

Security issues in mobile data networks

The rapid growth and development of mobile systems over the past years has exposed the capability and effective availability of mobile communication and thus paved the way for secure transmission and execution of data. The demand for such applications is currently experiencing a significant increase, and therefore, there is a strong call for advanced and efficient security mechanisms for mobile data network technologies. This paper deals with these mobile data security technologies and aims to exhibit their potential for integrity, availability and confidentiality. It provides a thorough analysis of the most important mobile packet data services and technologies, which can reveal the data in a secure manner. The article outlines its main technical characteristics, discusses its architectural aspects, based on security, and explains the access protocol and the services provided, in a secured way. This paper deals with security techniques for mobile data networks.

A security framework for mobile-to-mobile payment network

This paper presents a framework for a mobile-to-mobile payment system, where a mobile phone, with or without SIM card, is used as an EMV payment instrument and is linked to a debit or credit account in a bank to pay any merchant who has a mobile phone or an on-line EMV capable terminal. In a single phone, multiple credit or debit accounts from different banks can be configured without compromising on security. The customer or consumer can manage many accounts with a common PIN and the framework provides a secure and convenient payment mechanism over-the-air.

Security issues in wireless local area networks

The rapid growth and development of mobile systems over the past few years has exposed the capability and effective availability of wireless communication and thus paved the way for secure transmission and execution of data. This paper deals with this wireless local area security technologies and aims to exhibit their potential for integrity, availability and confidentiality. It provides a thorough analysis of the most WLAN packet data services and technologies, which can reveal the data in a secure manner. The article outlines its main technical characteristics, discusses its architectural aspects based on security and explains the access protocol, the services provided, in secured way. This paper deals with security techniques for wireless local area networks.

Frequency- and ordering-based similarity measure for host-based intrusion detection

This paper discusses a new similarity measure for the anomaly‐based intrusion detection scheme using sequences of system calls. With the increasing frequency of new attacks, it is getting difficult to update the signatures database for misuse‐based intrusion detection system (IDS). While anomaly‐based IDS has a very important role to play, the high rate of false positives remains a cause for concern. Defines a similarity measure that considers the number of similar system calls, frequencies of system calls and ordering‐of‐system calls made by the processes to calculate the similarity between the processes. Proposes the use of Kendall Tau distance to calculate the similarity in terms of ordering of system calls in the process. The k nearest neighbor (kNN) classifier is used to categorize a process as either normal or abnormal. The experimental results, performed on 1998 DARPA data, are very promising and show that the proposed scheme results in a high detection rate and low rate of false positives.

Strategy proof electronic markets

In electronic double auctions, property of incentive compatibility is very important. Incentive compatibility ensures that truthful bidding is the dominant strategy. Other important properties in electronic auctions are budget balance (BB) and individual rational (IR). The former ensures that the auction does not run in loss whereas the latter ensures voluntary participation. However these can be achieved only after sacrificing efficiency. The mechanisms based on uniform clearing price have been proposed in literature. Such mechanisms satisfy the properties of BB and IR. They are incentive compatible. However uniform price auction mechanism suffers from the problem of demand shading. Due to demand reduction, agents can acquire units at a lower price. This affects the property of incentive compatibility. Another problem with this approach is that it is not false name proof, meaning that agents can submit bids under different names to improve their utility. In electronic markets, where bids and asks are submitted remotely this property is very important. In this paper we propose discriminatory price mechanism, which is strategy proof, individually rational and budget balance. It is also false name proof, meaning agents cannot improve their utility by submitting false name bids.