Electronic voting is a voting process using electronic mean that allows voters to cast their secret and secure vote over an unsecured channel. Many forward-thinking countries are adopting the electronic voting system to upgrade their election process. Since E-voting system is more complex so it requires more security as compared to the postal voting system. One of the fine tool to provide the voter anonymity is the blind signature scheme. Many blind signature proposals based on traditional public key cryptosystem have been discussed, however, they get the worst of certificate and public key management. In this sense, the objective of the paper is twofold. Firstly, we proposed a blind signature scheme using the identity-based cryptosystem. Proposed scheme uses the combination of Bolyreva’s blind signature scheme and Cha-Chaon’s Identity-based signature. Secondly, we show that proposed scheme is more suitable for E-voting system as compared with others ID-based blind signature scheme.

In Mobile Ad hoc Network, path between source and destination node changes too frequently due to unpredictable behavior and movement of mobile nodes. The data delivery to the intended destination becomes very challenging. The paths exist between source and destination node may be various types. Data delivery may be done with single or multiple paths. Single path sometimes not guaranteed about data delivery, so one of the better solution is multipath data delivery. Here, in this paper, we have considered Link Disjoint and Node Disjoint multipath for data delivery. For this AOMDV protocol with node and link disjoint is considered to evaluate performance. To evaluate their performance different node pause time considered with varying number of nodes. We have computed various QoS network metrics like throughput, average end-to-end delay, routing overhead to identify in which method of data delivery perform better and in what conditions.  The results obtain shows that Node Disjoint multipath method AOMDV performs better than Link Disjoint method. The simulation work carried out using Simulator NS-2.34.

An SQL injection attack compromises the interactive web based applications, running database in the backend. The applications provide a form to accept user input and convert it into the SQL statement and fire the same to the database. The attackers change the structure of SQL statement by manipulating user inputs. The existing static and dynamic SQLIA detectors are being used for accurate detection of SQL injection, but it ignores the efficiency of the system. These detectors repeatedly verify the same queries inside the system, which causes unnecessary wastages of system resources. This paper contains the design approach of a parallel algorithm for the detection of SQL injection. The Algorithm uses the concept of Hot Query Bank (HQB) to cooperate with the existing SQLIA detectors (e.g. AMNESIA, SQLGuard, etc) and enhances the system performance. It simply keeps the information of previously verified queries in order to skip the verification process on the next appearance. The system performance has been observed by conducting a series of experiments on multi core processors. The experimental results have shown that parallel-SQLIA detector is 65% more efficient in term of time complexity. Further this design can be implemented in real web application environment; and the design interface can be standardized to cooperate with web application and the SQLIA detectors.

In Mobile Ad Hoc Network, data delivery is very challenging through single path due to dynamic changes in the network topology. To cope up this issue multipath data delivery is very useful. Recently, many works have been carried out in this domain but few are addressing the queueing effect on multipath scenarios. In this paper, we have designed a network model that based on the existence of multipath between source and destination node and every node behave as M/M/1 queue. In order to do this we generate K (K=1, 2, 3…i) paths are available between each source toward the destination node. The traffic arrivals in each node follow poisson process with arrival rate λ packets/sec. The simulation work of this multipath scenario based on varying mean inter-arrival time. The effect of arrival rate on the performance of multipath network model is analysed and compared. To better understand the effect of arrival rate in application and network layer various QoS metrics are computed. Significant performance of individual node is noticed in the obtained results with various arrival rates.

Vehicular Ad-hoc Networks is one of the emerging research areas of Mobile ad- hoc network. One of the key problems of VANET is changing topology of vehicles which leads to frequent disconnections. Therefore, for communication among the running vehicles, routing of the message becomes a challenging problem. Although, many routing protocols have been proposed in the literatures, but the performance of these protocols, in different scenarios, depends on the value of parameters used in. The objective of our work is to find best fitness function value for Ad-hoc on demand multipath distance vector routing protocol, in real scenario map by obtaining an optimal value of parameters using Magnetic Optimization Algorithm. Therefore, in this paper, we have proposed an algorithm based on Magnetic Optimization Algorithm which finds the optimal value of parameters for Ad-hoc on demand multipath distance vector routing protocol in a given scenario. The fitness function guides Magnetic Optimization Algorithm to achieve the best fitness value. The experimental results, using the optimal value of parameters obtained by Magnetic Optimization Algorithm, show 81.41% drop in average end-to-end delay, 39.24 % drop in Normalized Routing Loads, and slight rise (0.77%) in the packet delivery ratio as compared to using default value of parameters in Ad-hoc on demand multipath distance vector routing protocol.