Information Technology

Phishing is considered a form of web threats that is defined as the art of mimicking a website of an honest enterprise aiming to obtain user’s confidential credentials such as usernames, passwords and social security numbers. Social engineering and technical tricks are commonly combined together in order to start a phishing attack. The phishing attack starts by uploading the post on social network site which contain fraud URL that seems authentic to potential victims advising them to meet site and update or validate their information by following a URL link. The fraud user posts their comment on social network service that contains URL which are malicious. These malicious URL some time it contains malware or virus. When user clicks on these fraud URL Then viruses enter into user system and system gets affected. The proposed system Extraction of feature set for detecting fraud URL using ANN in social networking services effectively detect fraud URL with high accuracy.

In this paper, a new 5×5 reversible parity preserving gate is proposed and employed to realize 1-bit reversible parity preserving full adder/subtractor. The proposed 1-bit full adder/subtractor is implemented using VHDL and compared to previously presented designs in the literature. The results show that the proposed design is more efficient in terms of number of DC inputs/outputs, delay and quantum cost. Also two reversible parity preserving four-bit parallel adder/subtractor and carry skip adder/subtractor are designed applying the proposed scheme and compared to the former designs.

The objective of this study is to investigate the factors affecting secure and multiple web service collaborations. Online shopping is one such area where the need arises to perform secure communications with several other trading partners. In this study we have chosen a popular Chinese internet E-commerce company that offers online shopping and other internet related services. We have compared the current model which they have adopted to perform those collaborations and also proposed the benefits they would obtain if changes are made in their communication patterns.

A "Mobile Ad hoc Network" (MANET) is an independent system where mobile hosts are connected by wireless links without any of the preexisting administration. Each node acts as a host and sometimes as a router to forward packets to other nodes. So Routing protocol plays an important role in MANETs because it is designed with self-motivated topology, mobile host, distributed environment and limited battery power. In previous researches, a lot of routing protocols were developed for MANETs such as CGSR, DSR and ZRP. This paper evaluates these protocols by on their uniqueness, functionalities, pros and cons. This paper also emphasizes on enhancement of different protocol’s performance.

Conceptual graphs (CGs) are a system of logic based on the existential graphs of Charles Sanders Peirce and the semantic networks of artificial intelligence. They express meaning in a form that is logically precise, humanly readable, and computationally tractable. With a direct mapping to language, conceptual graphs serve as an intermediate language for translating computer-oriented formalisms to and from natural languages. With their graphic representation, they serve as a readable, but formal design and specification language. CGs have been implemented in a variety of projects for information retrieval, database design, expert systems, and natural language processing. The rough set philosophy is founded on the assumption that with every object of the universe of discourse we associate some information (data, knowledge). For example if objects are patients suffering from a certain disease symptoms of the disease form information about patients- Objects characterized by the same information are indiscernible similar in view of the available information about them. The indiscernibility relation generated in this way is the mathematical basis of rough set theory.

In today’s modern and digital world countless milestones have been achieved by the human. Technology has completely enveloped us in some way or the other. Hence if there is not complete dependency but most it is on the use of technology. For example, communicating with someone using a device is technology. Today, there are endless organizations that are maneuvering in recent advancements in technology. Among these the one which concerns us is to secure information or data on the network. Network security is the most functional requirement of any system. So the question arises that how to secure the data on the network from the intruder. There are innumerable intrusion detection techniques to detect the intrusion in the system. This paper deals with some handful of the techniques with which we can secure our data on the network.

Frequent pattern mining algorithms are designed to find commonly occurring sets in databases. This class of algorithms is typically very memory intensive, leading to prohibitive runtimes on large databases. A class of reconfigurable architectures has been recently developed that have shown promise in accelerating some data mining applications. In this paper, I propose a new architecture for frequent pattern mining based on a systolic tree structure. The goal of this architecture is to mimic the internal memory layout of the original pattern mining software algorithm while achieving a higher throughput. We provide a detailed analysis of the area and performance requirements of our systolic tree-based architecture, and show that our reconfigurable platform is faster than the original software algorithm for mining long frequent patterns.

Mobile Ad hoc Networks (MANET) have been highly vulnerable to attacks due to the dynamic nature of its network infrastructure. Among these attacks, routing attacks have received considerable attention since it could cause the most devastating damage to MANET. Even though there exist several intrusion response techniques to mitigate such critical attacks, existing solutions typically attempt to isolate malicious nodes based on binary or na?ve fuzzy response decisions. However, binary responses may result in the unexpected network partition, causing additional damages to the network infrastructure, and na?ve fuzzy responses could lead to uncertainty in countering routing attacks in MANET. In this paper, we propose a risk-aware response mechanism to systematically cope with the identified routing attacks. Our risk-aware approach is based on an extended Dempster-Shafer mathematical theory of evidence introducing a notion of importance factors. In addition, our experiments demonstrate the effectiveness of our approach with the consideration of several performance metrics.

Data compression is a common requirement for most of the computerized applications. There are many number of unsecured data compression algorithms, which are dedicated to compress different unsecured data formats. Even for a single data type there are number of different compression algorithms, which use different approaches. In this research, we propose a simple and efficient data compression algorithm particularly suited to be used on available commercial basis using secured manner. Our intention is transmitting text data in secured as well as compressed in the open environment. It is using double compression technique based on Huffman coding algorithm and simple symmetric key algorithm. Experiment itself evaluates the performance of new secured data compression algorithm with other data compression algorithm.

Internet is widely used in the fast growing world and there are many limitations in the network. There are two main failures that occur in the network they are wireless packet loss and congestion. The performance of SCTP in wireless network is considered as the active area. Finding the failure in the wireless network is very important and it is analysed in this paper. So in this paper the route is established by on demand routing technique in which many features like the energy of the node, location, bandwidth of the packet are analysed. So when the packets need to be send it analyses all the features and establishes the route with the efficient node that has one hop count by using the SCTP transport protocol. On transmitting the packets some energy from the node gets reduced so there is a high chance of congestion since the capacity of the node is reduced. This can be avoided by the proactive approach by reducing the traffic send by the source when the node level reaches threshold. By using the multi-homing technique in the SCTP approach the packets can be sending till the alternate route is re-established. Thus the packet loss rate and end-end delay is reduced and QOS is increased in the system.