IJCST Logo

International Journal of Computer Science and Technology Vol 5.4-3 Oct to Dec, 2014

S.No. Research Topic Paper ID Download
56

EVOSUITE – Test Suite Generation and Coverage Criteria

G.Karthika, S.V.P.K.Satya Dev

Abstract
Software testing is a critical element in the software development life cycle and has the potential to save time and money by identifying problems early and to improve customer satisfaction by delivering a more defect-free product. Testing is an integral part of the process of producing quality software product. The efficiency of testing critically depends on the quality of the test suite. A good test case provide a good chance of finding an yet to discover error and a successful test case uncovers a new error. Because exhaustive testing cannot be conducted, we can only sample test cases. Therefore, we can never be sure that our program is free of bugs. Because showing the absence of bugs is impossible, the aim of testing is to show that there are bugs. Testing is successful if we find bugs. In the present work a careful study was made on the role of coverage criteria and other factors in the test suite generation. A coverage criterion describes a finite subset of test cases out of the infinite number of possible tests one should execute.
Full Paper
IJCST/54/4/A-0373
57

Nearest Neighbor Search With Space Transformation to Preserve Location Privacy

Nela Surya Nagaraju, Y.Satish Kumar

Abstract
Location based service is a service which allows the user to receive service based on geographic location. Location Based Services are becoming important and gaining prominence with the increasing use of Mobile devices. There are so many issues in establishing Location Based Service out of which privacy is a paramount issue. User’s privacy can be breached by linking one’s identity, location, and query content. A good privacy-preserving LBS must be secure and provide accurate query results. In this work we study various protocols to deal with the privacy and the accuracy issues of privacy-preserving LBS. These protocols ensure the security level is close to perfect secrecy without the help of a trusted third party. These protocols must resist correlation attacks and support a multiuser scenario . A private circular query protocol deal with the privacy and the accuracy issues of privacypreserving LBS. The protocol consists of a space filling curve and a public-key homomorphic cryptosystem. These protocols should allow the service provider to authenticate any authorized requesting location-based services. The problem of preserving the location privacy and user anonymity of mobile users accessing authenticated location-based services is addressed in this work.
Full Paper
IJCST/54/4/A-0374
58

Communication Protocols for Privacy –Preservance in Location Based Services in Mobile Networks

Pavan Kumar Javva, S.V.P.K.Satya Dev

Abstract
In mobile networks, about the Location Information is an important parameter. An increasing number of ad hoc networking protocols and location-aware services require that mobile nodes learn the position of their neighbors. However, such a process can be easily disrupted by adversarial nodes. In absence of a priori trusted nodes, the discovery and verification of neighbor positions presents challenges that have been scarcely investigated in the literature. In this paper, we address this open issue by proposing a fully distributed cooperative solution that is robust against independent and colluding adversaries, and can be impaired only by an overwhelming presence of adversaries. Results show that our protocol can thwart more than 99 percent of the attacks under the best possible conditions for the adversaries, with minimal false positive rates.
Full Paper
IJCST/54/4/A-0375
59

Security and Mutual Trust in Cloud Computing Storage Systems

Shaik Meer Subhan Ali, Ch. Sekhar

Abstract
One important service provided by the cloud computing systems is Storage as a service. This service is provided to the clients to store the critical, complex and huge data of the clients in the remote servers. In this context the security and mutual trust play a very important role. This paper deals with the various aspects related to security and the mutual trust of the CSP and clients of the data stored in the cloud storage systems.
Full Paper
IJCST/54/4/A-0376
60

Single to Multi Cloud Security Issues

Vakkalagadda.J.R.V.Sai Mounika, K.Varada Raj Kumar

Abstract
Cloud Computing has established its roots in the IT industry as an alternative technology for traditional computing. The user applications can be deployed easily on the cloud under shared server and storage resources. Keeping the untrusting nature of the Cloud service providers, the security of the data stored in shared resources like cloud environment is at risk. The researches of the cloud environment focus on the single to multi cloud security. In this paper it is studied and understands that security in multi clouds can be further increased by using the Secret Sharing Algorithm. It suggests that it is better to shift from single to multi clouds for better security.
Full Paper
IJCST/54/4/A-0377
61

The Use of Comparative Questions in Comparable Entity Mining

Lanka Sri Naga Deepthi, Y.L.Sandhya Rani

Abstract
Comparison is a routine activity in human Decision making particularly while performing on line transactions. However, it is not that much easy to know what to compare and finding out the alternatives. In this work , we examine the mining of comparable entities from comparative questions that are posted by the users online to study the difficulties involved in this. we have studied the weakly supervised bootstrapping approach for comparative question identification and comparable entity extraction by leveraging a large collection of online question bank. The literature review revealed that this method gets an F1- measure of 82.5 percent in identification of comparative question and 83.3 percent in comparable entity extraction.
Full Paper
IJCST/54/4/A-0378
62

An Approach for Digital Forensics on Cloud Computing

Kandikuti Amara Babu, M.Madhava Rao

Abstract
Cloud computing became the most talked about technology in Information and communication technology in recent times. Many technology majors are using this technology and the scope of cloud computing is increasing day by day. Very important concern of the industry now is the Security. The cloud computing architectures often lack support for computer forensic investigations. Besides this, the existing digital forensics tools cannot cope with the dynamic nature of the cloud. This paper examines the challenges of digital forensics in the cloud, possible attacks on cloud-evidence, and mitigation strategies against those challenges.
Full Paper
IJCST/54/4/A-0379
63

Digital Image Encryption Based on Stochastic Diffusion

Indurthi Ravindra Kumar, K. Srinu

Abstract
In this paper we have studied a method for encrypted information hiding based on stochastic diffusion for the encryption of digital images. This process uses Least Significant Bit method for embedding information. we studied a novel approach for hiding encrypted data in a digital image. We consider an approach in which a plaintext image is encrypted with a cipher using the processes of stochastic diffusion and the output quantized into a 1-bit array generating a binary image cipher- text. This output is then embedded in a host image which is undertaken either in the lowest 1-bit layer or multiple 1-bit layers. Decryption is accomplished by extracting the binary image from the host image and correlating the result with the original cipher.
Full Paper
IJCST/54/4/A-0380
64

Secure Encounter-based Mobile Social Networks- Design Related Issues

Petla Janardhan, Vallabhaneni Pranav

Abstract
The users who share a location simultaneously are linked by an encounter based social network and encounter based systems. Whereas the conventional social networks link users who are friends already. The problems posed by this kind of new networks are different from those handled by the earlier social; network designs. In this paper, we study the functional and security requirements for these new systems, such as availability, security, and privacy, and present several design options for building secure encounter-based social networks. To highlight these challenges we examine one recently proposed encounter-based social network design and compare it to a set of idealized security and functionality requirements. We show that it is vulnerable to several attacks, including impersonation, collusion, and privacy breaching, even though it was designed specifically for security. Mindful of the possible pitfalls, we construct a flexible framework for secure encounter-based social networks, which can be used to construct networks that offer different security, privacy, and availability guarantees.
Full Paper
IJCST/54/4/A-0381
65

Identification of User Search Targets Using Feed Backs

Gujjarlapudi Srilatha, S.K.Chaitanya Rudraraju

Abstract
Different users may have different search objectives and goals for a huge and confusing search item. The search engine performance can be improved by identifying and analyzing the search goals . In this paper, we propose a studied the approach to identify the user search goals by analyzing search engine query logs. The search goals of different users by clustering the proposed feedback from the search sessions.. to get the best results it is necessary to capture different user search goals. These user goals are nothing but information on different aspects of a query that different users want to obtain. The judgment and analysis of user search goals can be improved by the relevant result obtained from search engine and user’s feedback. Here, feedback sessions are used to discover different user search goals based on series of both clicked and un clicked URL’s. The pseudo-documents are generated to better represent feedback sessions which can reflect the information need of user. With this the original search results are restructured and to evaluate the performance of restructured search results, classified average precision is used.
Full Paper
IJCST/54/4/A-0382
66

Cooperative Firewall Optimization and Privacy Preservance

Swathi Alla, G.Nirmala

Abstract
Firewalls are extensively used in internet for providing security and privacy. A firewall basing on its policy checks every incoming packet and decide whether to accept or decline the packet. The firewall policy became major factor in improving the quality of the network performance. This paper studies interfirewall optimization across administrative domains for the first time.
The important technical challenge is that firewall policies cannot be shared across domains because a firewall policy contains confidential information and even potential security holes, which can be exploited by attackers. In this paper, we propose the first cross-domain privacy-preserving cooperative firewall policy optimization protocol. Specifically, for any two adjacent firewalls belonging to two different administrative domains, our protocol can identify in each firewall the rules that can be removed because of the other firewall. The optimization process involves cooperative computation between the two firewalls without any party disclosing its policy to the other.
Full Paper
IJCST/54/4/A-0383
67

Reactive Jammers in Wireless Sensor Networks: The Trigger Service

G.Mounica, P.Naga Deepthi

Abstract
The broadcast nature and restricted usage of resources, made it difficult to provide security to Wireless sensor Networks. In recent times Reactive Jamming attacks became a big threat to the Wireless sensor Networks. These attacks can produce a great damage to the legitimate Communications. The reactive jammer attack is a light weight attack which is easy to launch but difficult to detect .This work suggest a new scheme to neutralize malicious reactive jammer nodes by changing the characteristic of trigger nodes to act as only receiver. Here the current approach attempts to identify the trigger nodes using the group testing technique, which enhances the identification speed and reduces the message complexity of the status report sent periodically between the sensor nodes and the base station.
Full Paper
IJCST/54/4/A-0384
68

Feature Subset Selection in High Dimensional Data Using Clustering

Sudheer Babu Nadakudur, Homer Benny Bandela

Abstract
Feature selection is a process of identifying a subset of potential features that can be used to produce useful results similar to the original feature set. The feature selection should be characterized and viewed viewed from the efficiency and effectiveness point of view. Efficiency is a matter of time needed to find a subset of features where as effectiveness deals with the quality of the subset of features. These two factors are studied using the fast clustering-based feature selection algorithm (FAST). According to this algorithm the features are divided into clusters first and then the most representative feature that strongly relates to the target class is selected from each cluster to form a subset of features. The FAST algorithm has the capability of generating a feature subset of potential features even though the features from different clusters are independent from each other. The efficiency and effectiveness of the FAST algorithm are evaluated through an empirical study.
Full Paper
IJCST/54/4/A-0385
69

Dynamic Risk Aware Mitiation of Malicious Nodes in Manet

D.R.V.Susmitha, T.SudhaRani

Abstract
Mobile Unexpected Networks (MANET) are extremely prone to attacks thanks to the dynamic nature of its network infrastructure.
attention since it might cause the foremost devastating damage to Manet. Even supposing there exist many intrusion response techniques to mitigate such essential attacks, existing solutions typically arrange to isolate malicious nodes supported binary or fuzzy response choices. However, binary responses might result in the surprising network partition, inflicting further damages to the network infrastructure, and fuzzy responses could lead on to uncertainty in countering routing attacks in manet. During this paper, we tend to propose a risk-aware response mechanism to consistently cope with the known routing attacks. Our risk-aware approach relies on AN extended dempster-Shafer mathematical theory of evidence introducing a notion of importance factors. Additionally, our experiments demonstrate the effectiveness of our approach with the thought of many performance metrics.
Full Paper
IJCST/54/4/A-0386
70

Resource Allocation Using Virtual Machines and Practical Outsourcing for Cloud Computing Environment

V.Sudarshan, K.Jagadeesh, A.Dileep Kumar

Abstract
Cloud computing allows business customers to scale up and down their resource usage based on needs. Many of the touted gains in the cloud model come from resource multiplexing through virtualization technology. In this paper, we present a system that uses virtualization technology to allocate data center resources dynamically based on application demands and support green computing by optimizing the number of servers in use. We introduce the concept of “skewers” to measure the unevenness in the multidimensional resource utilization of a server. By minimizing skewers, we can combine different types of workloads nicely and improve the overall utilization of server resources. We develop a set of heuristics that prevent overload in the system effectively while saving energy used. Trace driven simulation and experiment results demonstrate that our algorithm achieves good performance. To validate the computation result, we further explore the fundamental duality theorem of LP computation and derive the necessary and sufficient conditions that correct result must satisfy. Such result verification mechanism is extremely efficient and incurs close-to-zero additional cost on both cloud server and customers. Extensive security analysis and experiment results show the immediate practicability of our mechanism design.
Full Paper
IJCST/54/4/A-0387
71

A Proposed Solution to Secure MCC Uprising Issue and Challenges in the Domain of Cyber Security

S.Venkateswarlu, D.L. Anusha, S.Kranthi Kumar

Abstract
The development of cloud computing and mobility,mobile cloud computing has emerged and become a focus of research. By the means of on-demand self-service and extendibility, it can offer the infrastructure, platform, and software services in a cloud to mobile users through the mobile network. Security and privacy are the key issues for mobile cloud computing applications, and still face some enormous challenges. In order to facilitate this emerging domain, we firstly in brief review the advantages and system model of mobile cloud computing, and then pay attention to the security and privacy in the mobile cloud computing. MCC provides a platform where mobile users make use of cloud services on mobile devices. The use of MCC minimizes the performance, compatibility, and lack of resources issues in mobile computing environment. By deeply analyzing the security and privacy issues from three aspects: mobile terminal, mobile network and cloud, we give the current security and privacy approaches. The users of MCC are still below expectations because of the associated risks in terms of security and privacy. These risks are playing important role by preventing the organizations to adopt MCC environment. Significant amount of research is in progress in order to reduce the security concerns but still a lot work has to be done to produce a security prone MCC environment. This paper presents a comprehensive literature review of MCC and its security issues,challenges and possible solutions for the security issues.
Full Paper
IJCST/54/4/A-0388
72

An Approach for Personalized Labelled Privacy Preservation on Social Network Data

KodaliAnupama, Yelisela Rajesh

Abstract
Preserving privacy in publishing social network data becomes an important concern. With some local knowledge about individuals in a social network, an adversary may attack the privacy of some victims easily.In this paper,we take an initiative toward preserving privacy in social network data. A problem with many secure/ trusted computer systems intended for usage by the Department of Defense is that data often becomes over classified and is not labeled accurately upon output.Therefore, we are providing security based on the labels assigned for users in the social networks.To this aim, the algorithms transform the original graph into a graph in which nodes are sufficiently indistinguishable. The algorithmis designed to do so while losing as little information and while preserving as much utility as possible.
Full Paper
IJCST/54/4/A-0389
73

Survey on Human Gait Recognition

Avani P. Patel, Vaibhav C. Gandhi

Abstract
Human Gait recognition is a distance based behavioral type of biometrics and it is relatively a new area being studied nowadays.
This paper presents a survey of different Methods used for recognition of a Person based on different Activities such as walking style. All methods are explained and discussed individually and the Comparative study of Methods is discussed.
Full Paper
IJCST/54/4/A-0390
74

Prevention of Black Hole Attack in MANETs Using Clustering Based DSR Protocol

Harmanpreet Kaur, P. S. Mann

Abstract
A network is a system in which two or more than two computer systems are linked together with wires or without wires. Mobile Ad-Hoc networks (MANETs) are autonomous and decentralized networks. MANETs consists of mobile nodes that are free to move in and out of the network. Many routing protocols have been developed for MANETS, i.e. (Ad Hoc on Demand Distance Vector) AODV, (Dynamic Source Routing) DSR etc. Due to their dynamic topology, no infrastructure and no central management system MANETs are vulnerable to various security attacks. In this paper we have proposed a scheme to detect Black hole attack in a network.
Full Paper
IJCST/54/4/A-0391
75

Lock-In to the Meta Cloud with Attribute Based Encryption With Outsourced Decryption

V.Sudarshan, Dr. N.Satyanarayana, A.Dileep Kumar

Abstract
The emergence of yet more cloud offerings from a multitude of service providers calls for a meta cloud to smoothen the edges of the jagged cloud landscape.This meta cloud could solve the vendor lock-in problems that current public and hybrid cloud users face. Attribute-based encryption (ABE) is a public-keybased one-to-many encryption that allows users to encrypt and decrypt data based on user attributes. A promising application of ABE is flexible access control of encrypted data stored in the cloud, using access polices and ascribed attributes associated with private keys and ciphertexts. One of themain efficiency drawbacks of the existing ABE schemes is that decryption involves expensive pairing operations and the number of such operations grows with the complexity of the access policy. In such a system, a user provides an untrusted server, say a cloud service provider, with a transformation key that allows the cloud to translate any ABE ciphertext satisfied by that user’s attributes or access policy into a simple ciphertext, and it only incurs a small computational overhead for the user to recover the plaintext from the transformed ciphertext. Security of an ABE system with outsourced decryption ensures that an adversary (including a malicious cloud) will not be able to learn anything about the encrypted message; however, it does not guarantee the correctness of the transformation done by the cloud. In this paper, we consider a new requirement of ABE with outsourced decryption: verifiability. Informally, verifiability guarantees that a user can efficiently check if the transformation is done correctly.We give the formal model of ABE with verifiable outsourced decryption and propose a concrete scheme. We prove that our new scheme is both secure and verifiable, without relying on random oracles. Finally, we show an implementation of our scheme and result of performance measurements, which indicates a significant reduction on computing resources imposed on users.
Full Paper
IJCST/54/4/A-0392
76

An Integrated IP-MPLS Mobility Framework For Next Generation Networks

R Meenakshi Sundaram, S Albert Rabara, T Daisy Premila Bai , J Amutha

Abstract
Next Generation Network (NGN) is an integration of heterogeneous network environment, achieves the vision of next generation services for the delivery of voice, data and video. Researchers have proposed different protocols and architectures for NGN to access heterogeneous networks. Accessing to the devices connected through the NGN with seamless mobility is an important area of research in NGN. Several efforts have been carried out by researchers to integrate MPLS technology into IP networks to provide seamless mobility. But, not much progress has been made so far. Hence, in this paper, a novel framework to integrate IP in MPLS is proposed to achieve seamless mobility with end to end quality of service. The performance of the proposed framework has been tested by establishing a test bed in a simulated environment.
Full Paper
IJCST/54/4/A-0393
77

EIRQ Methods to Provide a Cost-Efficient Solution for Private Searching in Cloud Computing

G.Satya Suneetha, S.V.Ramana Murthy, T.S.V.V.S.Savithri

Abstract
As a characteristic cloud application an organization pledge the cloud services and approves its team to share files in the cloud.
Each file is explained by a set of keywords and the staff as authorized users can repossess files of their interests by querying the cloud with certain keywords. In such an environment how to protect user privacy from the cloud which is a third party outside the security boundary of the organization turn into a key problem. The communication cost acquires on the cloud will also be concentrated since files shared by the users need to be returned only once. Most significantly by using a series of secure functions COPS can protect user privacy from the ADL the cloud and other users. The main drawback is that it will cause a heavy querying overhead incurred on the cloud and thus goes against the original intention of cost efficiency. In this paper we present a method termed efficient information retrieval for ranked query (EIRQ) based on an aggregation and distribution layer (ADL) to condense querying overhead deserved on the cloud.
Full Paper
IJCST/54/4/A-0394
78

An Enhanced Context Aware Applications Architecture Using Collaborative Model

S.Srinivasa Reddy, S.Siva Rama Krishna, B.Gantaiah

Abstract
Asynchronous Event Handling and Synchronous Exception Handling mechanisms are devised as part of a forward recovery model to program robust context-aware applications which enable designing recovery actions to handle different kinds of failures such as service discovery failures, service binding failures, exceptions raised by a service, and context invalidations. Previously these context aware applications run on trusted servers which are assumed to be resilient to crash failures also. In this paper, we present a collaborative model for context-aware applications along with server deployment scenario. The proposed approach is developed for building collaborative activities in which users and environment services cooperate towards some shared objectives and tasks. We propose to use new server deployment scenarios such as replications and back up procedures to build more robust application architecture. The specification model allows expression of policies related to context-based discovery and secure access of resources, and role-based interactions among users and environmental services.
Full Paper
IJCST/54/4/A-0395
79

Phishing Attack Techniques

Ritika Arora, Neha Arora

Abstract
Now in a day’s phishing is a special type of network attack where the attacker creates a replica of an existing web page to fool users in to submitting personal, financial, transaction orpassword data to what they think is their service provider’swebsite. Phishing has two techniques, deceptive phishing and malware – based phishing.
Here we focus on deceptive phishing using social engineering schemes. To protect users against phishing, various anti-phishing techniques have been proposed. In this paper we have reviewed various phishing and anti-phishing methods for detecting and preventing phishing attack.
Full Paper
IJCST/54/4/A-0396
80

Matching XML Documents in Hierarchical Data

P.K.R. Madhuri, Prof. Ch.Sita Kameswari

Abstract
Duplicate detection consists in detecting multiple representations of a same real-world object, and that for every object represented in a data source. Duplicate detection is relevant in data cleaning and data integration applications and has been studied extensively for relational data describing a single type of object in a single table. This paper focuses on iterative duplicate detection in XML data. We consider detecting duplicates in multiple types of objects related to each other and devise methods adapted to semi-structured XML data. Relationships between different types of objects either form a hierarchical structure or a graph structure. Iterative duplicate detection require a similarity measure to compare pairs of object representations, called candidates, based on descriptive information of a candidate. The distinction between candidates and their description is not straightforward in XML, but we show that we can semi-automatically determine these descriptions using heuristics and conditions.
Full Paper
IJCST/54/4/A-0397