Recently, Wen et al. have developed three-factor authentication protocol for multi-server environment, claiming it to be resistant to several kinds of attacks. In this paper, we review Wen et al.’s protocol and find that it does not... more
Recently, Wen et al. have developed three-factor authentication protocol for multi-server environment, claiming it to be resistant to several kinds of attacks. In this paper, we review Wen et al.’s protocol and find that it does not fortify against many security vulnerabilities: (1) inaccurate password change phase, (2) failure to achieve forward secrecy, (3) improper authentication, (4) known session-specific temporary information vulnerability and (5) lack of smart card revocation and biometric update phase. To get rid of these security weaknesses, we present a safe and reliable three-factor authentication scheme usable in multi-server environment. The Burrows–Abadi–Needham logic shows that our scheme is accurate, and the formal and informal security verifications show that it can defend against various spiteful threats. Further, we simulate our scheme using the broadly known Automated Validation of Internet Security Protocols and Applications tool, which ensures that it is safe from the active and passive attacks and also prevent the replay and man-in-the-middle attacks. The performance evaluation shows that the presented protocol gives strong security as well as better complexity in the terms of communication cost, computation cost and estimated time.
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
In secure multiparty quantum computation (SMQC), the multiplication is one of the fundamental operations that can be used to assemble the complex quantum protocols. The existing protocols have the approach of either (n, n) threshold or... more
In secure multiparty quantum computation (SMQC), the multiplication is one of the fundamental operations that can be used to assemble the complex quantum protocols. The existing protocols have the approach of either (n, n) threshold or (t, n) threshold, with high cost and low security. In this paper, we propose a secret sharing based quantum protocol for (t, n) threshold secure multiparty multiplication, where t out of n players can compute the multiplication efficiently with low cost. In this protocol, the multiparty quantum multiplication can be performed if the number of secrets are more than the number of players as the secrets are shared using the linear secret sharing. Further, the security analysis shows that it is more secure against the intercept, entangle-measure, collusion, collective, and coherent attacks as compared to the existing protocols.
Research Interests:
Research Interests:
Research Interests:
In remote patient monitoring the wireless medical sensor networks WMSNs play a crucial role. In WMSNs, the sensor nodes are deployed in patient’s body for collecting physiological data. The patient’s physiological data are highly... more
In remote patient monitoring the wireless medical sensor networks WMSNs play a crucial role. In WMSNs, the sensor nodes are deployed in patient’s body for collecting physiological data. The patient’s physiological data are highly sensitive and important. Any malicious modification in physiological data will make wrong diagnoses and harm the patient health. Therefore, privacy, data security, and user authentication are extremely important for accessing patient’s real-time data over an insecure channel. In this regard, we design a secure and robust three-factor remote user authentication and key agreement scheme for remote patient monitoring. We simulate our protocol using AVISPA (Automated Validation of Internet Security Protocols and Applications) tool, which asserts that the protocol is secure from the replay and man-in-the-middle attacks. The informal security verification proves that the suggested protocol is secure from various security threats. Performance comparison shows that the proposed scheme is efficient in terms of computation cost and communication cost.
Research Interests:
In this paper, we present a safe and reliable remote user authentication and session key agreement scheme using the Rabin cryptosystem. The Rabin cryptosystem relies on prime integer factorization, which provides high security. Our scheme... more
In this paper, we present a safe and reliable remote user authentication and session key agreement scheme using the Rabin cryptosystem. The Rabin cryptosystem relies on prime integer factorization, which provides high security. Our scheme is validated using the Burrows–Abadi–Needham logic, which proved that it facilitates mutual authentication and session key agreement securely. The informal security analysis shows that the proposed scheme is secured against various malicious attacks. We simulate our scheme using the well-known Automated Validation of Internet Security Protocols and Applications tool, which confirms that the proposed scheme can defend from the passive and active attacks and also prevents the man-in-the-middle and replay attacks. Further, the performance evaluation shows that our scheme provides robustness against various security attacks as well as efficient in the terms of smart card storage cost, estimated execution time, communication cost and computation cost.
Research Interests:
Research Interests:
In secure multiparty quantum computation (SMQC), the multiplication is one of the fundamental operations that can be used to assemble the complex quantum protocols. The existing protocols have the approach of either (n, n) threshold or... more
In secure multiparty quantum computation (SMQC), the multiplication is one of the fundamental operations that can be used to assemble the complex quantum protocols. The existing protocols have the approach of either (n, n) threshold or (t, n) threshold, with high cost and low security. In this paper, we propose a secret sharing based quantum protocol for (t, n) threshold secure multiparty multiplication, where t out of n players can compute the multiplication efficiently with low cost. In this protocol, the multiparty quantum multiplication can be performed if the number of secrets are more than the number of players as the secrets are shared using the linear secret sharing. Further, the security analysis shows that it is more secure against the intercept, entangle-measure, collusion, collective, and coherent attacks as compared to the existing protocols.
Research Interests:
Research Interests:
Research Interests:
In this paper, we propose a secure two-factor remote user authentication protocol using Elliptic curve cryptography. The proposed protocol provides the mutual authentication of participants, session key agreement and user anonymity. The... more
In this paper, we propose a secure two-factor remote user authentication protocol using Elliptic curve cryptography. The proposed protocol provides the mutual authentication of participants, session key agreement and user anonymity. The security of our proposed protocol is based on one way hash function and elliptic curve cryptosystem and it is secure against all relevant security attacks. Compared with other relevant protocol, the security analysis and performance evaluation show that our proposed protocol can provide high level of security with less communication and computation cost. In addition, the BAN logic is applied to demonstrate the validity of the proposed protocol.
Research Interests:
Research Interests:
Research Interests:
Owing to the strict relationship between protein structure and their functions, the 3D structure prediction and classification of protein sequences has become one of the most challenging tasks in recent years. Despite of all the recent... more
Owing to the strict relationship between protein structure and their functions, the 3D structure prediction and classification of protein sequences has become one of the most challenging tasks in recent years. Despite of all the recent advancement in the field of molecular biology, the structural and behavioural nature of most of the protein and DNA sequences is still intractable. Notwithstanding with the large and new verities of new techniques which are proposed in recent years, sequence alignment and structure prediction is still an open problem. Therefore, in this paper we present a novel approach based on cross validation technique to predict the tertiary protein structure. The results so obtained are based on gravitational search methodology and were evaluated with reference to other existing methods for structure prediction and classification over structural benchmark datasets. The results which we gained after the experimental analysis, clearly demonstrates the robustness of...
Research Interests: Computer Science, Protein Folding, Computational Biology, Protein Structure Prediction, Simulated Annealing, and 10 moreMagnetic Resonance Spectroscopy, Macromolecular X-Ray Crystallography, Biological Sciences, Mathematical Sciences, Personnel Management, Protein structure, Proteins, Protein Conformation, Ab Initio, and CASP
Abstract The video oriented applications require considerably large amount of bandwidth. The bandwidth assigned to a video is very much dependent on its popularity. For popular videos, the bandwidth requirement is large. The popularity... more
Abstract The video oriented applications require considerably large amount of bandwidth. The bandwidth assigned to a video is very much dependent on its popularity. For popular videos, the bandwidth requirement is large. The popularity of a video is not static; it ...
Research Interests:
Abstract The staircase broadcasting scheme has optimal performance for the buffer storage and the disk transfer rate. However, this scheme sometime fails to provide the video data to the users in time. This limitation has been overcome... more
Abstract The staircase broadcasting scheme has optimal performance for the buffer storage and the disk transfer rate. However, this scheme sometime fails to provide the video data to the users in time. This limitation has been overcome in the conservative staircase scheme ...
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Abstract Communication technologies have provided bandwidth in Gigabytes and researchers are working to further enhance it. The bandwidth is still a bottleneck in many of the multimedia applications such as video-on-demand,... more
Abstract Communication technologies have provided bandwidth in Gigabytes and researchers are working to further enhance it. The bandwidth is still a bottleneck in many of the multimedia applications such as video-on-demand, movie-on-demand, etc. Therefore, apart from ...
Research Interests:
Research Interests:
Research Interests:
Research Interests:
... Therefore, a scheme should have good scheduling policy that can consider the viewer defection probabilities and latencies besides the batch size. There have been some good scheduling policies in literature (Dan et al., 1994; Aggarwal... more
... Therefore, a scheme should have good scheduling policy that can consider the viewer defection probabilities and latencies besides the batch size. There have been some good scheduling policies in literature (Dan et al., 1994; Aggarwal et al., 1996a). ... In Aggarwal et al. ...
Research Interests:
Research Interests:
AbstractIn a broadcasting scheme, the user's latency is a very important parameter. The harmonic broadcasting scheme has been found to have the best performance for user's latency and staircase broadcasting scheme has been... more
AbstractIn a broadcasting scheme, the user's latency is a very important parameter. The harmonic broadcasting scheme has been found to have the best performance for user's latency and staircase broadcasting scheme has been found to have the best performance for local storage as ...
Research Interests:
... 8020/RID/R&D-28/2001-02. Satish Chand is with the Computer Engineering Division, Netaji Subhas Institute of Technology, Delhi, India (e-mail: schand86@ hotmail.com). ... buffer DTR T1 S1 + S2 + S4 + S7 +S2 1 1 S1 + S3 + S6 +... more
... 8020/RID/R&D-28/2001-02. Satish Chand is with the Computer Engineering Division, Netaji Subhas Institute of Technology, Delhi, India (e-mail: schand86@ hotmail.com). ... buffer DTR T1 S1 + S2 + S4 + S7 +S2 1 1 S1 + S3 + S6 + S12 nil 0 0 ...
Research Interests:
12 Abstract: The staircase scheme is one of the important schemes as regards the buffer storage and disk transfer rate. However, it does not always provide the video data to the users in time. This drawback has been removed in the... more
12 Abstract: The staircase scheme is one of the important schemes as regards the buffer storage and disk transfer rate. However, it does not always provide the video data to the users in time. This drawback has been removed in the conservative staircase broadcasting ...
Research Interests:
Research Interests:
The staircase scheme is one of the important broadcasting schemes. It however does not provide the video data to all users on time. This problem has been overcome in the conservative staircase scheme at the cost of bandwidth. The number... more
The staircase scheme is one of the important broadcasting schemes. It however does not provide the video data to all users on time. This problem has been overcome in the conservative staircase scheme at the cost of bandwidth. The number of segments in the conservative staircase scheme is less and hence the segment size is large, which signifies the user's waiting time. Thus, the conservative staircase scheme has more user's waiting time than the staircase scheme. In this paper, we propose a hybrid scheme of the staircase and conservative staircase schemes that provides the video data to users on time and has better performance than the conservative staircase scheme for the user's waiting time.
Research Interests:
Research Interests:
Abstract In bespoke data broadcasting scheme a considerable amount of buffer storage is saved at the cost of comparatively much less latency time. In this paper a modified form of the bespoke scheme has been proposed. In the modified... more
Abstract In bespoke data broadcasting scheme a considerable amount of buffer storage is saved at the cost of comparatively much less latency time. In this paper a modified form of the bespoke scheme has been proposed. In the modified bespoke scheme the buffer ...
Research Interests:
In adaptive segment-based patching scheme, the video is divided into fixed number of segments, which are transmitted over the server channels. For efficient transmission of the video segments, the server channels are classified into two... more
In adaptive segment-based patching scheme, the video is divided into fixed number of segments, which are transmitted over the server channels. For efficient transmission of the video segments, the server channels are classified into two types – regular and patching channels. A regular channel generally transmits fixed number of segments and a patching channel helps transmitting those segments that cannot
Research Interests:
... Hari Om is Research Scholar with the School of Computer and Systems Science, Jawaharlal Nehru University, Delhi, India (e-mail: hariom63@rediffmail.com). ... In [18], permutation based pyramid broadcasting scheme proposed by Aggarwal... more
... Hari Om is Research Scholar with the School of Computer and Systems Science, Jawaharlal Nehru University, Delhi, India (e-mail: hariom63@rediffmail.com). ... In [18], permutation based pyramid broadcasting scheme proposed by Aggarwal et al. ...
Research Interests:
In multimedia applications the storage and bandwidth are crucial resources. The requirement for bandwidth is more critical than storage in the sense that when bandwidth is very high, it can compensate for storage requirement to a large... more
In multimedia applications the storage and bandwidth are crucial resources. The requirement for bandwidth is more critical than storage in the sense that when bandwidth is very high, it can compensate for storage requirement to a large extent, whereas high storage may not compensate for bandwidth, especially, in real time multimedia applications. A new strategy for bandwidth channelization for videos
Research Interests:
Research Interests: Applied Mathematics, Computer Science, Real Time Computing, Modeling, Binary Code, and 12 moreComputer Network, Data storage, Downloading, Jitter, Applied Mathematical Modelling, Exponential distribution, Binary Tree, Discrete random variable, Video Communication, Stochastic Model, Bandwidth, and Upload
Research Interests:
In this article, the authors have proposed a secure two-factor remote user authentication and session key agreement protocol. As they have shown in the presented scheme, is precise and secure according to both formal and informal security... more
In this article, the authors have proposed a secure two-factor remote user authentication and session key agreement protocol. As they have shown in the presented scheme, is precise and secure according to both formal and informal security analysis. For formal security analysis, they have applied BAN (Burrows-Abadi-Needham) logic which certifies that the presented scheme provides the amenity of mutual authentication and session key agreement safely. The informal security verification has shown that the proposed scheme is more vigorous against various sort of cruel threats. Moreover, the authors have simulated the presented scheme using broadly accepted AVISPA tool, whose simulation results make sure that the protocol is not dangerous from active and passive attacks together with replay and man-in-the-middle attacks. In addition, the performance evaluation and the security comparison have revealed that the presented scheme gives strong security as well as better complexity in the cont...
Research Interests:
The polyharmonic broadcasting scheme. a variant of the harmonic scheme, supports hetrer user's latency than those of carrtioirs and quasi-harmonic schemes, hesides delivering the video data in time to /he users unlike the harmonic... more
The polyharmonic broadcasting scheme. a variant of the harmonic scheme, supports hetrer user's latency than those of carrtioirs and quasi-harmonic schemes, hesides delivering the video data in time to /he users unlike the harmonic scheme. However, its storage i-eqrrii-ement at the client's site is ven; large that may counteract its perjarmame .for user- 's latency. Basicall,v this scheme works by
Research Interests:
... The authors express their sincere thanks to Dr. Harish Parthasarthy for his invaluable comments and suggestions. ... [1] Satish Chand and Hari Om, "Buffer Evaluation in Variable Bandwidth Channelization for Videos," IEEE... more
... The authors express their sincere thanks to Dr. Harish Parthasarthy for his invaluable comments and suggestions. ... [1] Satish Chand and Hari Om, "Buffer Evaluation in Variable Bandwidth Channelization for Videos," IEEE Transactions on Consumer Electronics, Vol. 49(2), pp. ...
Research Interests:
ABSTRACT One of the important protocols for increasing the network lifetime in wireless sensor networks (WSNs) is hybrid energy efficient distributed (HEED) protocol. This protocol considers two parameters for deciding the cluster heads,... more
ABSTRACT One of the important protocols for increasing the network lifetime in wireless sensor networks (WSNs) is hybrid energy efficient distributed (HEED) protocol. This protocol considers two parameters for deciding the cluster heads, i.e., residual energy and node density and has been designed for the homogeneous WSNs. In this paper, we consider the implementation of HEED for a heterogeneous network. Depending upon the type of nodes, it defines one-level, two-level, and three-level heterogeneity and accordingly the implementation of HEED is referred to as hetHEED-1, hetHEED-2, and hetHEED-3, respectively. We also consider one more parameter, i.e., distance and apply fuzzy logic to determine the cluster heads and accordingly the hetHEED-1, hetHEED-2, and hetHEED-3 are named as HEED-FL, hetHEED-FL-2, hetHEED-FL-3, respectively. The simulation results show that as the level of heterogeneity increases in the network, the nodes remain alive for longer time and the rate of energy dissipation decreases. And also, increasing the heterogeneity level helps sending more packets to the base station and increases the network lifetime. The increase in the network energy increases the network lifetime manifold. In fact, using fuzzy logic, the network lifetime increases by 114.85 % that of the original HEED without any increase in the network energy. Thus, the hetHEED-FL-3 provides the longest lifetime (387.94 % increase) in lifetime at the cost of 19 % increase in network energy), sends maximum number of packets to the base station, and has minimum rate of energy dissipation.
Research Interests:
Ant Colony Optimization (ACO) is one of the important techniques for solving optimization problems. It has been used to find locations to deploy sensors in a grid environment [12], in which the targets, called point of interest (PoI), are... more
Ant Colony Optimization (ACO) is one of the important techniques for solving optimization problems. It has been used to find locations to deploy sensors in a grid environment [12], in which the targets, called point of interest (PoI), are located on grid points in a square grid. The locations of sensors, which are grid points, are determined by considering the sink location as the starting point for deploying sensors. Though that work provides optimum number of sensors to cover all targets with respect to the given sink location, yet it does not provide which sink location provides minimum number of sensors to cover the targets. In this paper, we use ACO technique and find the sink location for which the number of sensors is minimum among all available locations in the grid. In our algorithm, we compute sum of distances of the targets from that sensor, which are in its range. Then we add these sums for all sensors in the grid. This distance corresponds to the given sink location. We repeat same process for computing the distance by changing the sink location in the grid. We choose that sink location for which the distance is minimum and this sink location requires minimum number of sensors to cover all targets. We carry out simulations to demonstrate the effectiveness of our proposed work.
Research Interests:
Research Interests:
AbstractThe harmonic broadcasting scheme has the best performance for the user latency. It, however, does not always provide the video data in time to the users. To provide the video data reliably, its two main variantscautious and... more
AbstractThe harmonic broadcasting scheme has the best performance for the user latency. It, however, does not always provide the video data in time to the users. To provide the video data reliably, its two main variantscautious and quasi-harmonic schemes have ...