......

..

IJCTA-Volume 3 Issue 2/ March-April 2012
S.No
Title/Author Name
Page No
1
Cloud computing security with Nymble Technology
-Pradip U.Wawge,Ku.Ashvini R.Rathod,Prof. Amit R.Manakshe
Abstract
Misbehave blacklisting schemes allow online service provide in cloud computer to prevent Misbehave access by abusive users while preserving the privacy of all Misbehave users (both abusive and non-abusive). The scheme proposed for this purpose was Nymble, an extremely efficient scheme based only on symmetric primitives; however, Nymble relies on trusted third parties who can collude to de-Anonymizing users of the scheme.
Networks such as Tor allow users to access Internet services privately by using a series of routers to hide the client’s IP address from the server. The success of such networks, however, has been limited by users employing this anonymity for abusive purposes such as defacing popular Web sites. Web site administrators routinely rely on IP-address blocking for disabling access to misbehaving users, but blocking IP addresses is not practical if the abuser routes through an misbehave network. As a result, administrators block all known exit nodes of misbehave networks, denying anonymous access to misbehaving and behaving users alike. To address this problem, we present Nimble, a system in which servers can “blacklist” misbehaving users, thereby blocking users without compromising their anonymity. Our system is thus agnostic to different servers’ definitions of misbehaviour servers can blacklist users for whatever reason, and the privacy of blacklisted users is maintained.
Although the cloud computing model is considered to be a very promising internet-based computing platform, it results in a loss of security control over the cloud-hosted assets. This is due to the outsourcing of enterprise IT assets hosted on third-party cloud computing platforms. Moreover, the lack of security constraints in the Service Level Agreements between the cloud providers and consumers results in a loss of trust as well. Obtaining a security certificate such as ISO 27000 or NIST-FISMA would help cloud providers improve consumers trust in their cloud platforms' security.
Keywords: misbehave blacklisting, privacy, security, revocation, error detection, cloud computing.
503-509

  PDF

2
3-D Graphical Password Used For Authentication
-Vidya Mhaske-Dhamdhere,Bhakti Pawar, Pallavi Ghodke, Pratibha Yadav
Abstract
In today’s world, security is important aspect in day to day life.So, everyone used various ways for security purpose. People use passwords for their security.Generally, everyone uses textual password. Textual password is combination of alphabets and numbers. People keep textual password as name of their favorite things, actors or actress, dish and meaningful word from dictionary. But the person who is very close to that person can easily gues the password. Graphical password is advanced version of password. Graphical passwords have received considerable attention lately as Potential alternatives to text-based passwords. Graphical password is composed of images, parts of images, or sketches[4]- [7]. These passwords are very easy to use and remember. Biometric password is an extended feature of graphical passwords. Biometric password is consisting of face recognition, thumb impression, eye retina and heartbeats pulses[10]. In this paper, we present and evaluate our contribution, i.e., the 3-D password. The 3-D password is a multifactor authentication scheme. To be authenticated, we present a 3-D virtual environment where the user navigates and interacts with various objects. The sequence of actions and interactions toward the objects inside the 3- D environment constructs the user’s 3-D password. The 3-D password can combine most existing authentication schemes such as textual passwords, graphical passwords, and various types of biometrics into a 3-D virtual environment. The design of the 3-D virtual environment and the type of objects selected determine the 3-D password key space[10].
Keywords-Cryptography, encryption and decryption algorithms Authentication Biometrics, graphical passwords, multifactor, textual passwords, 3- Dpasswords, 3- virtual environment.
510-519

  PDF

3
Unique ID Management
-Hemangi Kulkarni, Aniket Yadav, Darpan Shah, Pratik Bhandari, Samuya Mahapatra
Abstract
The Unique ID system provides unique identification numbers to Indian residents. UID Number which would not just help the government to track down individuals, but would make life far easier for citizens as they would not have to submit multiple documents each time they want to avail a new public, private and government service. This system will contain personal details like name, sex, address, marital status, photo, identification mark and fingerprint biometric. The unique identification number will be in the formed of 12 digit alphanumeric number to provide more security. UID system helps to manage persons needs in his/her life span by using a single UID i.e. the number is used as Driving license number, Voter ID card number, registration number in any organization, bank account number, personal or professional details. Thissystem will create government jobs for computer sector in the development, implementation and maintenance of the UIDsystem. Keywords—Unique Identification Numbers, UID, EGovernment,UIDM, UIDAI
520-524


  PDF

4
Interpretation of formal proof for Cryptographic Protocols into Computational Model
-Sanjay Kumar Sonkar, Darmendra Lal Gupta, Dr. Anil Kumar Malviya, Ganesh Chandra, Vinod Kumar Yadav
Abstract
Cryptography is the spinal cord for all security measures involved in computing field so a lot of emphasis is required to be given to make it strong enough to deal all the transition of the security industry. We present a general method to prove security properties of multiple cryptographic protocols in an execution model where clients exchange messages using multiple protocols against active adversaries. The method discussed here allows to interpret the logical formal proofs of cryptographic systems into their computational equivalent. The security properties are expressed in terms of logics, which are then interpreted in a computational setup. Also, we further show that if the statement is true for any symbolic execution then the corresponding computational interpretation is widely accepted in all forms. The messages between clients are expressed in syntax form and do not require dealing with asymptotic notations and probability distribution. This paper provides a basic framework and edifice for extending the protocol specification language with other cryptographic primitives.
Keywords: Cryptographic protocols, Symbolic analysis, Protocol logic, formal methods for security protocols.
525-531



  PDF

5
Performance Testing on Board Processor
-Arvind Vishnubhatla
Abstract
We use Terahertz imaging arrays to get synthetic aperture imaging data.
As the data rates are extremely high we intend to make a custom processor for an unmanned vehicle taking due care of weight and DC power restrictions.
532-540

  PDF

6
Automatically Communication Path Creation and ReConfiguration in Dynamic Network Environment for Optimizing Performance to Netowk Applications
-Rakesh Kumar Singh
Abstract
Accessing network services across a wide area network still remains a challenging task and the difficulty mainly comes from the heterogeneous and constantly changing network environment, which usually causes undesirable user experience for network-oblivious applications. A promising approach to address this is to provide network awareness in communication paths. Many challenging problems remain, in particular: how to automatically create effective network paths whose performance is optimized for encountered network conditions; how to dynamically reconfigure such paths when network conditions change; and how to manage and distribute network resources among different paths and between different network regions. This paper describes solutions for these problems, built into a programmable network infrastructure called Switching Network Services (SNS). The SNS infrastructure provides applications with network-aware communication paths that are automatically created and dynamically modified. SNS highlights four key mechanisms which are: a high-level integrated type-based specification of components and network resources; automatic path creation strategies; system support for low overhead path reconfiguration; and distributed strategies for managing and allocating network resources.
We evaluate these mechanisms using experiments with typical applications running in the SNS infrastructure, and extensive simulation of a large scale network topology to compare with other alternatives. Experimental results validate the effectiveness of our approach, verifying that (1) the path-based approach provides the best and the most robust performance under a wide range of network configurations as compared to end-point or proxy-based alternatives; (2) automatic generation of network-aware paths is feasible and provides considerable performance advantages, requiring only minimal input from applications; (3) path reconfiguration strategies ensure continuous adaptation and provide desirable adaptation behaviors by using automatically generated paths; (4) both run-time overhead and reconfiguration time of SNS paths are negligible for most applications; (5) the resource management and allocation strategies allow effective setting up shared resource pools in the network and sharing resources among paths.
Key words: Network, Bandwidth, Protocol, Communication Path, Reconfiguration, etc
541-554



  PDF

7
Multicore Processing for Clustering Algorithms
-RekhanshRao, Kapil Kumar Nagwanshi, and SipiDubey
Abstract
Data Mining algorithms such as classification and clustering are the future of computation, though multidimensional data-processing is required. People are using multicore processors with GPU’s. Most of the programming languages doesn’t provide multiprocessing facilities and hence wastage of processing resources. Clustering and classification algorithms are more resource consuming. In this paper we have shown strategies to overcome such deficiencies using multicore processing platform OpelCL.
Keywords: GPGPU, NVIDIA, CUDA, Opencl, Parallel processing, clustering
555-560

  PDF

8

 

A Novel Low Power pattern Generation Technique for Concurrent Bist Architecture
-Y. Balasubrahamanyam, G. Leenendra Chowdary , T.J.V.S.Subrahmanyam
Abstract
This paper proposes a low power Linear Feedback Shift Register (LFSR) for Test Pattern Generation (TPG) technique with reducing power dissipation during testing. The correlations between the consecutive patterns are higher during normal mode than during testing. The proposed approach uses the concept of reducing the transitions in the test pattern generated by conventional LFSR. The goal of having intermediate patterns is to reduce the transitional activities of primary inputs which eventually reduce the switching activities inside the circuit under test, and hence, power consumption .The testing power is reduced by 46%with respect to the power consumed during the testing carried by conventional LFSR. Built-In Self-Test (BIST) techniques constitute an attractive and practical solution to the problem of testing VLSI circuits and systems. Input vector monitoring concurrent BIST schemes can circumvent problems appearing separately in on-line and in of-line BIST techniques
561-565


  PDF

9
Comparative Study: Block Truncating Coding, Wavelet and Fractal Image Compression
-Dinesh Gupta,Pardeep Singh,Nivedita,Sugandha Sharma
Abstract
We undertake a study of the performance difference of different transform coding techniques i.e. Block truncating coding, wavelet and fractal image compression. This paper focuses important features of transform coding in compression of still images, including the extent to which the quality of image is degraded by the process of compression and decompression. The above techniques have been successfully used in many applications. The techniques are compared by using the performance parameters PSNR, CR and reduced size. Images obtained with those techniques yield very good results.
Keywords-Block Truncating Coding (BTC), Compression ratio(CR) , Image Compression, Fractal Image Compression, Wavelet.
566-571


  PDF

10
Performance Analysis of Embedded Zero Tree and Set Partitioning in Hierarchical Tree
-Dinesh Gupta,Pardeep Singh,Nivedita,Sugandha Sharma
Abstract
Compressing an image is significantly different than compressing raw binary data. For this different compression algorithm are used to compress images. Discrete wavelet transform has been widely used to compress the image. Wavelet transform are very powerful compared to other transform because its ability to describe any type of signals both in time and frequency domain simultaneously. The proposed schemes investigate the performance evaluation of embedded zero tree and wavelet based compression algorithm- Set Partitioning in Hierarchical Trees (SPHIT) based image compression. The numerical analysis of such algorithms is carried out by measuring Peak Signal to Noise Ratio (PSNR), Compression Ratio (CR).
Keyword- Discrete wavelet Transform, embedded zero tree, Image Compression, set partitioning in hierarchical tree
572-577


  PDF

11
Probablistic Clustering based on Web Documents-An Hybrid Chaotic Approach
-Ashwini Kumar Verma,Kuldeep Singh Raguwanshi
Abstract
Web search engine are often forced to pass through long ordered list of documents called snippets. Snippets are web document attributes. These snippets are returned by search engines. The basis of document clustering is an alternative method of organizing retrieval results. Clustering yet needed to be deployed for the search engines. The approach adopted is formulation, simulation; formulation refers to the decomposition of different page rank values. Improved data clustering kmeans algorithm performs better results. Purpose of adopted web mining approach is to preserve web page conceptually similar, in page rank, link structure mining and probabilistic hybrid approach. Final goal is to eliminate the problem of increasing accuracy also with speed. As a result search engine gain popularity with incorporation of web mining. Proposed method ought to produce desired quality of clusters with probabilistic hybrid approach. Most users are unwilling to wait while accurate results are required at user’s end with probabilistic approach. Proposed model should be incorporated with the search engines to gain optimized results in terms of accuracy and speed.
Keywords-Fuzzy Clustering & Fuzzy Merging;Single Value Decomposition; Probablostic Distribution Function; Iris Dataset;Meta Information; Uniform Data Function; High Dimensional Data;
578-582


  PDF

12
Some Results on Generalized Fuzzy Soft Sets
-Manash Jyoti Borah, Tridiv Jyoti Neog, Dusmanta Kumar Sut
Abstract
The purpose of this paper is to put forward some new notions regarding generalized fuzzy soft set theory. Our work is an extension of earlier works of Majumder and Samanta on Generalized Fuzzy Soft Sets.
583-591

  PDF

13
Security Consideration With Dynamic Routing
-B.Visweswara Rao
Abstract
one of the major issues for data communication over wired and wireless networks is the security. the past work is on the designs of cryptography algorithms and system infrastructures. Dynamic routing algorithm called improved dynamic routing with security consideration, which is based on the concept of Zone Routing Protocol (ZRP) that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP) in wired networks and Destination-Sequenced Distance Vector (DSDV) protocol in wireless networks, without introducing extra control messages. This algorithm is mainly proposed to improve the and to overcome the limitations existing with the present cryptographic algorithms and protocols. Although some designs like IP security, Secure Socket Layer provide essential security, E-Mail security they unavoidably introduce substantial overheads in the Gateway/Host performance and effective network bandwidths.
Key words:Dynamic Routing, ZRP, DSDV, RIP, Secure socket Layer, Bellman Ford Algorithm.
592-606

  PDF

14
Software Engineering Challenges of Migration Projects
-S.Geetha,Dr.Alagaramy
Abstract
Organisations often face the challenges of migration from legacy systems to new target systems. Such migration efforts represent a complex engineering problem. This paper describes migration planning, identifies influencing factors, outlines a set of migration planning activities and offers a set of guidelines for the migration planning.
Keywords: migration, planning, legacy, strategy, process
607-610

  PDF

15
Minimizing Response Time and Effective Utilization of I/O-bound Processes using “Approximate Zero Response Algorithm"
-Dinesh Gupta, Sakshi Gupta, Neha Jhamb
Abstract
Various sheduling algorithm are available for the operating system to improve CPU utilization. Different scheduling algorithms have different properties that work on different scheduling criterias and the choice of a particular algorithm may favor one class of processes over another. SJF gives minimum average waiting time for a given set of processes. The Round Robin algorithm decreases the response time. In this paper we have proposed an algorithm which has response time aproximately zero and it increases the efficiency of I/O bounded process.
611-616


  PDF

16
Simulation Based: Study and Analysis of Routing Protocol in Vehicular Ad-hoc Network Environment
-Vaishali D. Khairnar,Dr. S. N. Pradhan
Abstract
A Vehicular Ad hoc Network (VANET) consists of vehicles which communicate with each other and exchange data via wireless communication links available between the vehicles which are in communication ranges of vehicles to improve the road safety in city. The communication between vehicles is used to provide road safety, comfort and entertainment. The performance of communication depends on how better routing takes place in the network. Routing data between the source and destination vehicle depends on the routing protocols being used in vehicular ad-hoc network. In this simulation based study we investigated about different ad hoc routing protocols for vehicular ad-hoc network (VANET). The main goal of our study was to identify which ad hoc routing protocol has better performance in highly mobile environment of vehicular ad-hoc network. We have measured the performance of routing protocols using 802.11p in vehicular ad-hoc network in which we considered the scenario of city (i.e. Route between Nerul and Vashi) where we have take 1200 different types of vehicles and checked their performance. Routing protocols are selected after the literature review. The selected protocols are then evaluated through simulation under 802.11p in terms of performance metrics (i.e PDR & E2E delay).
617-625


  PDF

17
Performance Analysis of Genetic CR selection in Multicast Multirate Network
- Sheeja.S, Dr.Ramachandra V. Pujeri
Abstract
This paper presents a performance analysis of different methods used to select the congestion representative over the genetic algorithm based Congestion Representative selection in a multicast multirate network. A huge volume of control traffic is introduced into the network, and the routers are heavily loaded because the entire rate control burden has been shifted to them. Therefore, the number of these operations is limited during a period and restricts the effectiveness of these multicast congestion control methods. In multi-rate technique, the source maintains several layers each with different transmission rate, and receivers give to different subsets of these layers depending on their and network’s bandwidth and congestion circumstances. In a multi-rate multicast session, each layer uses a separate multicast group address. On the whole operations and performance of MCC schemes deal with quite a lot of issues in achieving a well-performing multicast such as congestion representative (CR) selection. CR Selection based on the genetic algorithm is made so that a optimized representative is selected and fully dynamic order of joining the layers is achieved and performance is much better than the other conventional methods.
Keywords— congestion control, multirate, multicast, congestion representative, genetic algorithm
626-631


  PDF

18
A Quantitative Study and Comparison of Secure OLSR Routing Protocol
-S.Tamilarasan,M.Sathyam Reddy
Abstract
This paper presents the comparison of the secure OLSR (Optimized Link State Routing Protocol) in mobile ad-hoc network with other approach. We compare the security from the different approach and their effect on the existing OLSR. The Main aim of this paper is to study the various securities and compare the different attacks in MANET. Different approaches uses different cryptography security scheme and trying to provide the security to OLSR routing protocols. We also concern the different possible attacks on the OLSR and check that which security scheme is better to provide the security from the attacks.
Keywords OLSR, protocol, HASH chain, Encryption algorithm;
632-638

  PDF

19
Transitive Coupling (TC) and Fault Proneness (FP) in Object Oriented Systems: A New Methodology
-Amjan.Shaik,M.Sudhir Kumar,Md. Riyazuddin,S.V.Achuta Rao
Abstract
Demand for Quality Software has undergone with rapid growth during the last few years. This is leading to an increase in the development of metrics for measuring the properties of software such as Coupling, Cohesion or Inheritance that can be used in early quality assessments. Quality Models that explore the relationship between these properties and quality attributes such as fault proneness, maintainability, effort or productivity are needed to use these metrics effectively. The empirical studies carried out in recent literature concluded that none of the existing metrics particularly coupling and coherence was fever or not effective in ranking the reusability of object oriented components. Based on this conclusion we would like to propose a new coupling metric measuring model that can achieve expected performance to rank the reusability of the components. Since all of the existing metrics relied on binary relations between classes and methods the most or all of the existing models are not able to find the actual coupling metric value between any two classes. The proposed coupling metric measurement model considers transitive relations between methods and classes. We use a set of nine design metrics in our work. The proposed model predicts faulty classes with more than 80% accuracy.
Keywords: Transitive Coupling, Software Metrics, PCA, Fault Proneness and Software Quality.
639-649


  PDF

20
Frame based Motion Detection for real-time Surveillance
-Brajesh Patel, Neelam Patel
Abstract
In this paper a series of algorithm has been formed to track the feature of motion detection under surveillance system. In the proposed work a pixel variant plays a vital role in detection of moving object of a particular clip. If there is a little bit motion in a frame then it is detected very easily by calculating pixel variance. This algorithm detects the zero variation only when there is no motion in a real-time video sequence. It is simple and easier for motion detection in the fames of moving object having Avi file. In this work we enhanced the efficiency of moving object detection in a current pair of frame by implementing pixel base displacement algorithm in the frame of object as the current and previous. There are different levels at which tracking can be performed. At the highest level, the whole body is detected without paying attention to the details of the posture and limbs. At a lower level, the posture and limbs are tracked. At an even lower level, one or two parts of the body (such as hands) are tracked.
Most of the existing algorithms for moving object detection assume that the illumination in a scene remains constant. Unfortunately, this assumption is not valid, especially in outdoor environment. To resolve the problem of our existing methods (Simple Differencing method and Shading Model Method), we introduced an improvement “illumination compensation coefficient Ki” that makes it work well even when there is a moving object detected in the scene. In this work we present a new, illumination independent method for moving object detection in outdoor environment. We also used median value of the observed region instead of mean value in calculating the variance in proposed method because the comparison is faster than addition and division. It is shown in experimental results, this method is superior to other techniques if the illumination is allowed to vary.
This paper answered the crucial question regarding the detection of moving object and suggests the requirement of surveillances in the terms of security and in high tech world. Our selection criteria are directly based on the definition of Motion detection and tracking algorithms which explains the experimental performance of motion detection in a frame generated by real-time video & clips. This is usually analyzing the difference of two successive frames with the help of pixel variance. Software .net is used for the accomplishment of task
The purpose of surveillance is to provide more information of moving object by tracking its motion in multi frames at any work places as banking, cinema hall, shopping mall, offices and structural work. From the experimental data we can explain the change in pixel variant means that changes had occurred fromthe current frame to previous frame.
Index Terms - Pixel Variance, Threshold Value, Segmentation of Frames, Moving Object Detection, Surveillance System
650-655

  PDF

 
 
     
IJCTA © Copyrights 2010| All Rights Reserved.

This work is licensed under a Creative Commons Attribution 2.5 India License.