Harsh Kumar Verma

Work place: Department of Computer Science and Engineering, Dr B R Ambedkar National Institute of Technology, Jalandhar, Punjab, India

E-mail: er.ramankumar@aol.in


Research Interests: Computer systems and computational processes, Computer Networks, Information Security, Information-Theoretic Security


Dr. Harsh Kumar Verma is working as an Associate Professor and Head in the Department of Computer Science and Engineering at National Institute of Technology, Jalandhar (Deemed University) since 1996. 
His major areas of research are Scientific Computing, Information security and Software Systems. He has a number of publications in National as well as International Journals. He is a life member of Computer Society of India, ISTE. He is also a member of IEEE Computer Section.

Author Articles
A Modified Pixel-Value Differencing Image Steganographic Scheme with Least Significant Bit Substitution Method

By Aruna Malik Geeta Sikka Harsh Kumar Verma

DOI: https://doi.org/10.5815/ijigsp.2015.04.08, Pub. Date: 8 Mar. 2015

Pixel value differencing is a steganographic technique for gray scaled images. In this paper, we propose a modified pixel value differencing image steganographic scheme with least significant bit substitution method. Our method divides the cover image into the blocks of two consecutive pixels and calculates the absolute difference between the pixels of a block similar to [1, 2]. If the difference is less than a particular threshold, i.e. 15 (in this paper) than 4 bits of secret data are taken and these bits are embedded onto the LSBs of the block's pixels through least significant bit substitution method otherwise the number of bits to be hidden are selected based on some characteristics of the block and hidden. The experimental results show that our method significantly improves the quality of stego image as compared to the [1, 3] and have sufficient payload.

[...] Read more.
Security Analysis and Performance Evaluation of Enhanced Threshold Proxy Signature Scheme Based on RSA for Known Signers

By Raman Kumar Harsh Kumar Verma Renu Dhir

DOI: https://doi.org/10.5815/ijcnis.2012.09.08, Pub. Date: 8 Aug. 2012

An efficient threshold signature scheme solves the difficulties of the receiver to proof the approval of the document from the sender as well as detecting if the file has been altered by illegitimate parties. In these days there are plenty of signature schemes such as (t,n) threshold proxy signature scheme. The network is a shared medium so that the weakness security attacks such as eavesdropping, replay attack and modification attack. Thus, we have to establish a common key for encrypting/decrypting our communications over an insecure network. In this scheme, a (t,n) threshold proxy signature scheme based on RSA, any t or more proxy signers can cooperatively generate a proxy signature while t-1 or fewer of them can't do it. The threshold proxy signature scheme uses the RSA cryptosystem to generate the private and the public key of the signers. Comparison is done on the basis of time complexity, space complexity and communication overhead. We compare the performance of four schemes: Hwang et al., Wen et al., Geng et al. and Fengying et al. with the performance of a scheme that has been proposed by the authors of this article earlier. In the proposed scheme, both the combiner and the secret share holder can verify the correctness of the information that they are receiving from each other. Therefore, the enhanced threshold proxy signature scheme is secure and efficient against notorious conspiracy attacks.

[...] Read more.
Other Articles