This paper presents the information flow control model NetIFC to prevent information leakage when a net service is being executed. NetIFC offers the following features: (1) it blocks at least statements as possible and (2) it reduces runtime overhead. To achieve the first feature, NetIFC strictly controls output statements because only output may leak information. To achieve the second feature, NetIFC is executed in parallel with a service in different sites to monitor the service. This monitoring style substantially reduce runtime overhead when comparing with embedding a model in a net service.

Nowadays, web applications are popular targets for security attackers. Using specific security mechanisms, we can prevent or detect a security attack on a web application, but we cannot find out the criminal who has carried out the security attack. Being unable to trace back an attack, encourages hackers to launch new attacks on the same system. Web application forensics aims to trace back and attribute a web application security attack to its originator. This may significantly reduce the security attacks targeting a web application every day, and hence improve its security. The aim of this paper is to carry out a detailed overview about the web application forensics. First, we define the web applications forensics, and we present a taxonomic structure of the digital forensics. Then, we present the methodology of a web application forensics investigation. After that, we illustrate the forensics supportive tools for a web application forensics investigation. After that, we present a detailed presentation of a set of the main considered web application forensics tools. Finally, we provide a comparison of the main considered web application forensics tools.

Scalability and Complexity are crucial performance parameters in the design of Interconnection networks for multiprocessor system. This paper proposed and analyzed a new scalable interconnection network topology named as Linear Crossed Cube (LCQ). LCQ designed is based on the principle of hypercube architecture however, it improves some of the drawbacks of hypercube such as complex extensibility and its VLSI Layout. It inherits most of the desirable properties of hypercube type architectures; the most notably are small diameter and symmetry. LCQ has linear extension at each level of the extension while preserving all the desired topological properties. To evaluate the performance of proposed LCQ, standard scheduling algorithms are being implemented on it. The performance parameters such as Load Imbalance Factor (LIF) and balancing time are evaluated on the proposed LCQ as well as on other similar multiprocessor architectures. To compare the performance of proposed LCQ, standard scheduling scheme is also implemented on other similar multiprocessor architectures. The comparative simulation study shows that the proposed network can be considered as low-cost multiprocessor architecture for parallel system when appropriate scheduling algorithm is implemented onto it.

This paper represents The Ant Colony Optimization for MTSP and Swarm Inspired Multipath Data Transmission with Congestion Control in MANET using Total Queue Length based on the behavioral nature in the biological ants. We consider the problem of congestion control for multicast traffic in wireless networks. MANET is multi hop wireless network in which the network components such as PC, mobile phones are mobile in nature. The components can communicate with each other without going through its server. One kind of agent (salesman) is engaged in routing. One is Routing agent (salesman), who collects the information about network congestion as well as link failure and same is message agent (salesman) that uses this information to get his destination nodes. Though a number of routing protocols exists, which aim to provide effecting routing but few provide a plausible solution to overall network congestion. We attempt to explore the property of the pheromone deposition by the real ant for MTSP. The proposed algorithm using path pheromone scents constantly updates the goodness of choosing a particular path and measuring the congestion in the network using total queue length and Hop-distance.

Although there are different techniques proposed for intrusion detection in the literature, most of them consider standalone misuse or anomaly intrusion detection systems. However, by taking the advantages of both systems a better hybrid intrusion detection system can be developed. In this paper, we present an effective hybrid layered intrusion detection system for detecting both previously known and zero-day attacks. In particular, a two layer system that combines misuse and anomaly intrusion detection systems is proposed. The first layer consists of misuse detector which can detect and block known attacks and the second layer comprises of anomaly detector which can efficiently detect and block previously unknown attacks. The misuse detector is modeled based on random forests classifier and the anomaly detector is built using bagging technique with ensemble of one-class support vector machine classifiers. Data pre-processing is done using automatic feature selection and data normalization. Experimental results show that the proposed intrusion detection system outperforms other well-known intrusion detection systems in detecting both previously known and zero-day attacks.

This research paper present a novel approach of Image based steganography scheme where a pseudorandom sequence generator function is used to randomize the mapping sequence in a pseudorandom fashion. The embedding process of the secret message is done according to the pseudo-random sequence, and extraction is done using the same sequence at the other end. At the base level, 2D-DCT is used to hide the bits of secret message inside the stego image by replacing the LSBs of DCT coefficients. Since in previous paper the LSB substitution technique is already used, here in this paper the previous concept is extended and used DCT instead of LSB technique. A new text randomization algorithm (4-2 swap text randomization algorithm) is also used to modify the secret message before embedding.

Nowadays, Wireless Sensor Networks (WSNs) are widely used in many areas, especially in environment applications, military applications, queue tracking, etc. WSNs are vulnerable to different types of security attacks due to various constraints such as broadcasted nature of transmission medium, deployment in open or hostile environment where they are not physically protected, less memory, and limited battery power. So, security system is the crucial requirements of these networks. One of the most notably routing attacks is the sinkhole attack where an adversary captures or insert nodes in the sensor field that advertise high quality routes to the base station. In this paper, a mechanism is proposed against sinkhole attacks which detect malicious nodes using hop counting. The main advantage of the proposed technique is that, a node can detects malicious nodes only collaborating with the neighbor nodes without requiring any negotiation with the base station. Simulation result shows that, the proposed technique successfully detects the sinkhole nodes for large sensor field.

Traditional alphanumeric passwords used for remote user authentication does not offer both usability and security. Graphical passwords were proposed as an alternative to these textual passwords for improving usability and security. This paper proposes a remote user authentication scheme, which extends the existing pass text scheme. The usability and security of the proposed scheme is analyzed. Using Morea tool the Usability of the proposed scheme is investigated.