With the amount of available text data on the web growing rapidly, the need for users to search such information is dramatically increasing. Full text search engines and relational databases each have unique strengths as development tools but also have overlapping capabilities. Both can provide for storage and update of data and both support search of the data. Full text systems are better for quickly searching high volumes of unstructured text for the presence of any word or combination of words. They provide rich text search capabilities and sophisticated relevancy ranking tools for ordering results based on how well they match a potentially fuzzy search request. Relational databases, on the other hand, excel at storing and manipulating structured data -- records of fields of specific types (text, integer, currency, etc.). They can do so with little or no redundancy. They support flexible search of multiple record types for specific values of fields, as well strong tools for quickly and securely updating individual records. The web being a collection of largely unstructured document which is ever growing in size, the appeal of using RDBMS for searching this collection of documents has become very costly.
This paper describes the architecture, design and implementation of a prototype website search engine powered by Lucene to search through any website. This approach involves the development of a small scale web crawler to gather information from the desired website. The gathered information are then converted to a Lucene document and stored in the index. The time taken to search the index is very short when compared with how long it takes for a relational database to process a query.

In this paper, we introduce a new attack, Reinforcement Swap Attack, against Directed Diffusion based WSNs, which exploits the vulnerabilities of Directed Diffusion specifications. Its main idea is the disruption of configuration information, such as routing information to misuse route establishment along the network. Our approach is to swap Directed Diffusion reinforcement rule which means that the good route is excluded and the bad route is included. Moreover, our attack is activated and deactivated periodically to prolong its lifetime and hence brings down the target network. For the proposed attack, we present analysis, simulation, and experimental measurements. We show that the system achieves maximal damage on system performance represented by many metrics.

Power analysis attacks are types of side channel attacks that are based on analyzing the power consumption of the cryptographic devices. Correlation power analysis is a powerful and efficient cryptanalytic technique. It exploits the linear relation between the predicted power consumption and the real power consumption of cryptographic devices in order to recover the correct key. The predicted power consumption is determined by using the appropriate consumption model. Until now, only a few models have been proposed and used.
In this paper, we describe the process to conduct the CPA attack against AES on SASEBO-GII board. We present a comparison between the Hamming Distance model and the Switching Distance model, in terms of number of power traces needed to recover the correct key using these models. The global successful rate achieves 100% at 11100 power traces. The power traces needed to recover the correct key have been decreased by 12.6% using a CPA attack with Switching Distance model.

IMS (IP Multimedia Subsystem) is designed to provide multiple-services and can be accessed from any access network. With the advent of new multimedia services; user requirement also changed and required delay tolerant services from the service providers. The new multimedia services demands the restrictions on network parameters and this can be achieved by analyzing the traffic flow from the core as well as access network capabilities. As access and core IMS network are independent of each other and does not exchange user SLA with each other. In this paper we proposed framework based on Session border controller (SBC) that proactively monitored the traffic statistics as well as interact with access network operator for getting user's SLA and reserve resources accordingly. We are also proposing alterations in SIP invite and re-invite message to incorporate requested information. These alterations will be useful in ensuring availability of user's handset capabilities to IMS core network.

Mobile Ad-Hoc Networks (MANETs) are autonomous and decentralized wireless systems. Mobile Ad hoc Network is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many Routing protocols have been proposed so far to improve the routing performance and reliability. This research paper describes the characteristics of ad hoc routing protocols Ad-hoc On Demand Distance Vector Routing (AODV), Optimized link State Routing (OLSR), Temporally Ordered Routing Algorithm (TORA), Dynamic Source Routing (DSR), Destination-Sequenced Distance-Vector Routing (DSDV) based on the performance metrics like packet delivery fraction, Average delay, Normalized Routing load, Throughput and Jitter under low mobility and low traffic network as well as under high mobility and high traffic network. Results show that AODV has maximum throughput under low traffic and DSDV has maximum throughput under high traffic. As network becomes dense OLSR, DSR and DSDV perform well in terms of Throughput than AODV and TORA. TORA performs well in dense networks in terms of packet delivery fraction but at the same time Normalized Routing load of TORA is maximum among all the protocols in both the networks. DSDV has least Normalized Routing load in both low and high traffic. OLSR and DSDV give the least Jitter and Average Delay in both networks.

The present paper provides a new mechanism with two stages for efficient authentication based on Honey Comb Polynomial Interpolation (HCPI) and Morphological Border Sorted Pixel Value Difference (MBSPVD) scheme. A simple polynomial interpolation technique on new hexagonal structure called Honey Comb structure (HCS) is used for generating the key of the digital watermark. The polynomial interpolation gives a high secured key, which is difficult to break. HCS is used in the present paper to select pixel positions for generating the Digital Watermark key (DWK). The significant factor of the present method is, the digital watermark is generated by using DWK. The importance of HCS representation is that it possesses special computational features that are pertinent to the vision process. The HCS has features of higher degree of circular symmetry, uniform connectivity, greater angular resolution, and which leads to reduce storage and computation in image processing operations. The DWK is placed in the image by using MBSPVD method. Its guarantees high authentication, robustness, security and copyright protection. The Lagrange Polynomial interpolation (LPI) is used for retrieving the digital watermark from the DWK. The LPI accomplish the aim of image authentication and protection without reducing the image quality. The proposed HCPI-MBSPVD is tested with various attacks and compared with various existing image authentication and copyright protection methods. The comparisons and results indicate the efficacy of the proposed method.

Internet has become one of the most versatile sources of information and on the other way it has become source of various security threats. Various existing vulnerabilities in the web portals are compromised easily by hackers sitting at their places. There are so many vulnerabilities available in various websites in case of government sectors may be because of financial constraints or other. E-government is a new fast growing area in developing as well as in developed countries. New e-governance applications are emerging and being implemented and utilized by the common man. Providing government information and services on the web has resulted in mushrooming of websites with very little attention is paid to security issues of these websites. This paper discusses certain security issues & vulnerabilities in websites of educational institutes. The organizations taken into consideration are educational institutes of Haryana.

Replication strategy is mostly useful for replicating the called mobile user's profile at selected locations where some caller mobile users have higher calling rate. It plays important role in personal communication services (PCS) in order to reduce call setup cost and call setup time. In prior replication schemes, replicated sites (visitor location registers) have no inter relationship. We have proposed a novel and innovative replication tree which is buildup from replicated VLRs (visitor location registers). VLRs are replicated based on effective replication probability of caller mobile user. Home location register (HLR) keeps update replica at root VLR in the replication tree and root VLR forwards update replica to a VLR in the replication tree on demand. The main objective of the proposed scheme is to reduce call setup time and call setup cost by enabling replication of called mobile user's location profile at certain visitor location registers (VLRs) where caller mobile user roams. We have presented analytical modeling which shows that setting inter-relationship among the replicated sites helps in further reducing the call setup cost.