Jaypee Institute of Information Technology

About: Jaypee Institute of Information Technology is a education organization based out in Noida, Uttar Pradesh, India. It is known for research contribution in the topics: Cluster analysis & Wireless sensor network. The organization has 2136 authors who have published 3435 publications receiving 31458 citations. The organization is also known as: JIIT Noida.

Efficient protocols for unidirectional and bidirectional controlled deterministic secure quantum communication: different alternative approaches

Abstract: Recently, Hassanpour and Houshmand have proposed a protocol of controlled deterministic secure quantum communication (Hassanpour and Houshmand, Quantum Inf Process 14:739---753, 2015). The authors compared the efficiency of their protocol with that of two other existing protocols and claimed that their protocol is efficient. Here, we have shown that the efficiency of Hassanpour Houshmand (HH) protocol is not high, and there exist several approaches through which more efficient protocols for the same task can be designed. To establish this point, we have proposed an efficient protocol of controlled deterministic secure quantum communication which is based on permutation of particles technique and is considerably efficient compared to HH protocol. We have also generalized this protocol into its bidirectional counterpart. Interestingly, bipartite entanglement (Bell state) is sufficient for the realization of the proposed protocols, but HH protocol and other existing protocols require at least tripartite entanglement. Further, we have shown that it is possible to construct a large number of efficient protocols of unidirectional and bidirectional controlled deterministic secure quantum communication by using various alternative approaches and different quantum states. These alternative protocols can be realized by modifying the existing protocols of quantum secure direct communication and deterministic secure quantum communication. We have also shown that it is possible to design completely orthogonal-state-based protocols for unidirectional and bidirectional controlled deterministic secure quantum communication.

Robust video watermarking using significant frame selection based on coefficient difference of lifting wavelet transform

Abstract: This manuscript presents a significant frame selection (SFS) and quantization of coefficient difference based robust video watermarking scheme in the lifting wavelet transform domain (LWT). In this scheme, a new procedure based on the mathematical relationship between a number of original video frames, coefficient block size and embedding capacity for significant frame selection is proposed. Third level frequency sub-bands of selected frames are obtained using LWT and lower frequency sub-band (i.e. LH3 sub-band) is considered for watermark embedding. Watermark bits are embedded using the quantization of coefficient difference of two maximum frequency components of significant frame blocks. To improve the security against an external intruder, secret key based randomization of video frames, blocks of coefficients and watermark bits is incorporated. Various geometric and image processing operations are tested and the proposed scheme successfully proves its robustness without compromising the quality of watermarked image. Comparing with other existing schemes, a remarkable improvement in terms of robustness is observed however in some cases the imperceptibility is compromised.

Lightweight Cryptographic Primitives for Mobile Ad Hoc Networks

Abstract: The tight computing constraints of low capacity mobile devices require lightweight cryptographic implementations.A software and hardware based performance analysis of cryptographic primitives: lightweight encryption/decryption, lightweight key exchange and lightweight authentication using hashing mechanism are conducted in this work. The parameters taken for software comparison are: high throughput, minimum delay and for hardware are: minimum gate equivalents (GE) and minimum power consumption. Cryptographic primitives are combined using two scenarios: (i) authentication to plaintext and confidentiality to message_to_send and (ii) confidentiality to plaintext and authentication to message_to_send. Two combinations are having similar results comparisons but authentication to plaintext and confidentiality to message_to_send is more meaningful. Furthermore, these two combinations provide implementation of cryptographic primitives with 30% of total GE at 52 μW. Thus, these are two complete cryptographic solutions with ultra-lightweight features which are suitable for extremely resource constraint environments such as mobile sensor devices.

Trust and Reliability Based Scheduling Algorithm for Cloud IaaS

Abstract: Trust Models are used to enhance secure and reliable scheduling in Distributed, Grid and Cloud environment. Trust models that are being proposed or implemented in Distributed and Grid environment, does not fully fit in cloud computing environment. Since the parameters that have being taken into consideration in these trust models, does not fit in the cloud Infrastructure As A Service, a suitable trust model is proposed based on the existing model that is suitable for trust value management for the cloud IaaS parameters. Based on the above achieved trust values, a scheduling algorithm is also proposed that may further enhance the QOS of services been provided to the users.

Parallel Bat Algorithm-Based Clustering Using MapReduce

Abstract: As we are going through the era of big data where the size of the data is increasing very rapidly resulting into the failure of traditional clustering methods on such a massive data sets. If the size of data exceeds the storage capacity or memory of the system, the task of clustering will become more complex and time intensive. To overcome this problem, this paper proposes a fast and efficient parallel bat algorithm (PBA) for the data clustering using the map-reduce architecture. Efficient using the evolutionary approach for clustering purpose rather than using traditional algorithm like k-means and fast by paralyzing it using the Hadoop and map-reduce architecture. The PBA algorithm works by dividing the large data set into small blocks and clustering these smaller data blocks in parallel. The proposed algorithm inherits the bat algorithm features to cluster the data set. The proposed algorithm is validated on five benchmark data sets against particle swarm optimization with different number of nodes. Experimental results show that the PBA algorithm is giving competitive results as compared to the particle swarm optimization and also providing the significant speedup with increasing number of nodes.