1 Cloud Security and Data Integrity with Client Accountability Framework, Prema Mani, Theresa Jose, Janahanlal Stephen The Cloud based services provide much efficient and seamless ways for data sharing across the cloud. The fact that the data owners no longer possess data makes it very difficult to assure data confidentiality and to enable secure data sharing in the cloud. Despite of all its advantages this will remain a major limitation that acts as a barrier to the wider deployment of cloud based services. One of the possible ways for ensuring trust in this aspect is the introduction of accountability feature in the cloud computing scenario. The Cloud framework requires promotion of distributed accountability for such dynamic environment[1]. In some works, there‘s an accountable framework suggested to ensure distributed accountability for data sharing by the generation of only a log of data access, but without any embedded feedback mechanism for owner permission towards data protection[2].The proposed system is an enhanced client accountability framework which provides an additional client side verification for each access towards enhanced security of data. The integrity of content of data which resides in the cloud service provider is also maintained by secured outsourcing. Besides, the authentication of JAR(Java Archive) files are done to ensure file protection and to maintain a safer environment for data sharing. The analysis of various functionalities of the framework depicts both the accountability and security feature in an efficient manner. |
||||||
2 Various OSI Layer Attacks and Countermeasure to Enhance the Performance of WSNs during Wormhole Attack, Damandeep Kaur and Parminder Singh Wireless sensor networks are networks having non wired infrastructure and dynamic topology. In OSI model each layer is prone to various attacks, which halts the performance of a network .In this paper several attacks on four layers of OSI model are discussed and security mechanism is described to prevent attack in network layer i.e wormhole attack. In Wormhole attack two or more malicious nodes makes a covert channel which attracts the traffic towards itself by depicting a low latency link and then start dropping and replaying packets in the multi-path route. This paper proposes promiscuous mode method to detect and isolate the malicious node during wormhole attack by using Ad-hoc on demand distance vector routing protocol (AODV) with omnidirectional antenna. The methodology implemented notifies that the nodes which are not participating in multi-path routing generates an alarm message during delay and then detects and isolate the malicious node from network. We also notice that not only the same kind of attacks but also the same kind of countermeasures can appear in multiple layer. For example, misbehavior detection techniques can be applied to almost all the layers we discussed. |
||||||
3 Secure Multi-Party Negotiation: An Analysis for Electronic Payments in Mobile Computing, Dr.K.Ravikumar , A.Udhayakumar This paper is an attempt to base on auctions which presents a frame work for the secure multi-party decision protocols. In addition to the implementations which are very light weighted, the main focus is on synchronizing security features for avoiding agreements manipulations and reducing the user traffic. Through this paper one can understand that this different auction protocols on top of the frame work can be collaborated using mobile devices. This paper present the negotiation between auctioneer and the proffered and this negotiation shows that multiparty security is far better than the existing system. |
||||||
4 Low Energy Routing for WSN’s, Ravi Kishore Kodali and Prof. Narasimha Sarma, NVS The main tasks of a Wireless Sensor Network (WSN) are data collection from its nodes and communication of this data to the base station (BS). The protocols used for communication among the WSN nodes and between the WSN and the BS, must consider the resource constraints of nodes, battery energy, computational capabilities and memory. The WSN applications involve unattended operation of the network over an extended period of time. In order to extend the lifetime of a WSN, efficient routing protocols need to be adopted. The proposed low power routing protocol based on tree-based network structure reliably forwards the measured data towards the BS using TDMA. An energy consumption analysis of the WSN making use of this protocol is also carried out. It is found that the network is energy efficient with an average duty cycle of 0:7% for the WSN nodes. The OmNET++ simulation platform along with MiXiM framework is made use of. |
||||||
5 Enhancing Data Storage Security in Cloud Computing Through Steganography, Mrinal Kanti Sarkar, Trijit Chatterjee in cloud computing data storage is a significant issue because the entire data reside over a set of interconnected resource pools that enables the data to be accessed through virtual machines. It moves the application software’s and databases to the large data centers where the management of data is actually done. As the resource pools are situated over various corners of the world, the management of data and services may not be fully trustworthy. So, there are various issues that need to be addressed with respect to the management of data, service of data, privacy of data, security of data etc. But the privacy and security of data is highly challenging. To ensure privacy and security of data-at-rest in cloud computing, we have proposed an effective and a novel approach to ensure data security in cloud computing by means of hiding data within images following is the concept of steganography. The main objective of this paper is to prevent data access from cloud data storage centers by unauthorized users. This scheme perfectly stores data at cloud data storage centers and retrieves data from it when it is needed. |
||||||
6 Selfish Node Isolation & Incentivation using Progressive Thresholds, Dais John, Rosna P Haroon The problems associated with selfish nodes in MANET are addressed by a collaborative watchdog approach which reduces the detection time for selfish nodes thereby improves the performance and accuracy of watchdogs[1]. In the related works they make use of credit based systems, reputation based mechanisms, pathrater and watchdog mechanism to detect such selfish nodes. In this paper we follow an approach of collaborative watchdog which reduces the detection time for selfish nodes and also involves the removal of such selfish nodes based on some progressively assessed thresholds. The threshold gives the nodes a chance to stop misbehaving before it is permanently deleted from the network. The node passes through several isolation processes before it is permanently removed. Another version of AODV protocol is used here which allows the simulation of selfish nodes in NS2 by adding or modifying log files in the protocol. |
||||||
7 Genetic Algorithm based Layered Detection and Defense of HTTP Botnet, Seena Elizebeth Mathew, Abdul Ali, Janahanlal Stephen A System state in HTTP botnet uses HTTP protocol for the creation of chain of Botnets thereby compromising other systems. By using HTTP protocol and port number 80, attacks can not only be hidden but also pass through the firewall without being detected. The DPR based detection leads to better analysis of botnet attacks [3]. However, it provides only probabilistic detection of the attacker and also time consuming and error prone. This paper proposes a Genetic algorithm based layered approach for detecting as well as preventing botnet attacks. The paper reviews p2p firewall implementation which forms the basis of filtering. Performance evaluation is done based on precision, F-value and probability. Layered approach reduces the computation and overall time requirement [7]. Genetic algorithm promises a low false positive rate. |
||||||
8 Permutation of Pixels within the Shares of Visual Cryptography using KBRP for Enhanced Security, ShabnaC.H, Hafsath C.A, Janahanlal Stephen The security of authentication of internet based co-banking services should not be susceptible to high risks. The passwords are highly vulnerable to virus attacks due to the lack of high end embedding of security methods. In order for the passwords to be more secure, people are generally compelled to select jumbled up character based passwords which are not only less memorable but are also equally prone to insecurity. Multiple use of distributed shares has been studied to solve the problem of authentication by algorithms based on thresholding of pixels in image processing and visual cryptography concepts where the subset of shares is considered for the recovery of the original image for authentication using correlation function[1][2].The main disadvantage in the above study is the plain storage of shares and also one of the shares is being supplied to the customer, which will lead to the possibility of misuse by a third party. This paper proposes a technique for scrambling of pixels by key based random permutation (KBRP) within the shares before the authentication has been attempted. Total number of shares to be created is dependent on the multiplicity of ownership of the account. By this method the problem of uncertainty among the customers with regard to security, storage, retrieval of holding of half of the shares is minimized. |
||||||
9 Responsive Parameter based an AntiWorm Approach to Prevent Wormhole Attack in Ad hoc Networks, Vrutik Shah and Dr. Nilesh Modi The recent advancements in the wireless technology and their wide-spread deployment have made remarkable enhancements in efficiency in the corporate and industrial and Military sectors The increasing popularity and usage of wireless technology is creating a need for more secure wireless Ad hoc networks. This paper aims researched and developed a new protocol that prevents wormhole attacks on a ad hoc network. A few existing protocols detect wormhole attacks but they require highly specialized equipment not found on most wireless devices. This paper aims to develop a defense against wormhole attacks as an Anti-worm protocol which is based on responsive parameters, that does not require as a significant amount of specialized equipment, trick clock synchronization, no GPS dependencies. |
||||||
10 A Real Time Framework of Multiobjective Genetic Algorithm for Routing in Mobile Networks, Subarno Banerjee, Rajarshi Poddar, and P. K. Guha Thakurta Routing in mobile networks is a multiobjective optimization problem. The problem needs to consider multiple objectives simultaneously such as Quality of Service parameters, delay and cost. This paper uses the NSGA-II multiobjectve genetic algorithm to solve the dynamic shortest path routing problem in mobile networks and proposes a framework for real-time software implementation. Simulations confirm a good quality of solution (route optimality) and a high rate of convergence. |
||||||
11 Novel Algorithm For Encryption:Hybrid of Transposition and Substitution Method, Suman Mor, Anurag Dagar, Swati Saini This paper presents an algorithm which is hybrib of Transposition and Substitution method.The main advantage of this approach is ,it doesn’t use any key from outside because key is present within the original message.Due to this the main problem of exchanging keys securely is solved.Both Transposition and Substitution method have their own limitations.So we use both these method so that the resultant cipher is more secure and strong. |
||||||
12 Enhanced Level of Security using DNA Computing Technique with Hyperelliptic Curve Cryptography, P.Vijayakumar, V.Vijayalakshmi, G.Zayaraz Hyperelliptic Curve Cryptography (HECC) is a Public Key Cryptographic technique which is required for secure transmission. HECC is better than the existing public key cryptography technique such as RSA, DSA, AES and ECC in terms of smaller key size. DNA cryptography is a next generation security mechanism, storing almost a million gigabytes of data inside DNA strands. Existing DNA based Elliptic Curve Cryptographic technique require larger key size to encrypt and decrypt the message resulting in increased processing time, more computational and memory overhead. To overcome the above limitations, DNA strands are used to encode the data to provide first level of security and HECC encryption algorithm is used for providing second level of security. Hence this proposed integration of DNA computing based HECC provides higher level of security with less computational and memory overhead. |
||||||
13 Congestion Control through Load Balancing Technique for Mobile Networks: A Cluster based Approach, Subhajit Sadhu, Sushovon Maity The Optimal Routing Path (ORP) for mobile cellular networks is proposed in this paper with the introduction of cluster-based approach. Here an improved dynamic selection procedure is used to elect cluster head. The cluster head is only responsible for the computation of least congested path. Hence the delay is reduced with the significant reduction on the number of backtrackings. |
||||||
14 Data Accuracy Models under Spatio - Temporal Correlation with Adaptive Strategies in Wireless Sensor Networks, Jyotirmoy Karjee , H.S Jamadagni Wireless sensor nodes continuously observe and sense statistical data from the physical environment. But what degree of accurate data sensed by the sensor nodes collaboratively is a big issue for wireless sensor networks. Hence in this paper, we describe accuracy models of sensor networks for collecting accurate data from the physical environment under two conditions. First condition: we propose accuracy model which requires a priori knowledge of statistical data of the physical environment called Estimated Data Accuracy (EDA) model. Simulation results shows that EDA model can sense more accurate data from the physical environment than the other information accuracy models in the network. Moreover using EDA model, there exist an optimal set of sensor nodes which are adequate to perform approximately the same data accuracy level achieve by the network. Finally we simulate EDA model under the thread of malicious attacks in the network due to extreme physical environment. Second condition: we propose another accuracy model using Steepest Decent method called Adaptive Data Accuracy (ADA) model which doesn’t require any a priori information of input signal statistics. We also show that using ADA model, there exist an optimal set of sensor nodes which measures accurate data and are sufficient to perform the same data accuracy level achieve by the network. Further in ADA model, we can reduce the amount of data transmission for these optimal set of sensor nodes using a model called Spatio- Temporal Data Prediction (STDP) model. STDP model captures the spatial and temporal correlation of sensing data to reduce the communication overhead under data reduction strategies. Finally using STDP model, we illustrate a mechanism to trace the malicious nodes in the network under extreme physical environment. Computer simulations illustrate the performance of EDA, ADA and STDP models respectively. |
||||||
15 Utilizing Data Mining Approches in the Detection of Intrusion in IPv6 Network: Review & Analysis, Redhwan M. A. Saad, Selvakumar Manickam, Sureswaran Ramadass The development of Internet protocols are greatly needed as the network security becomes one of the most important issues. This brings the need to develop IPv4 into IPv6 in order to proceed towards increasing the network capacity. Now Intruders are considered as one of the most serious threats to the internet security. Data mining techniques have been successfully utilized in many applications. Many research projects have applied data mining techniques to intrusion detection. Furthermore different types of data mining algorithms are very much useful to intrusion detection such as Classification, Link Analysis and Sequence Analysis. Moreover, one of the major challenges in securing fast networks is the online detection of suspicious anomalies in network traffic pattern. Most of the current security solutions failed to perform the security task in online mode because of the time needed to capture the packets and making decision about it. Practically, this study provides alliterative survey for the enhancement associated with IPv6 in terms of its security related functions. It is worthy mentioned that this study is concurred with the data mining approaches that have been used to detect intrusions. |
||||||
16 Applicability of Network Logs for Securing Computer Systems, Nikita Singh, Pavitra Chauhan, and Nidhi Chandra Logging the events occurring on the network has become very essential and thus playing a major role in monitoring the events in order to keep check over them so that they doesn’t harm any resources of the system or the system itself. The analysis of network logs are becoming the beneficial security research oriented field which will be desired in the computer era. Organizations are reluctant to expose their logs due to risk of attackers stealing the sensitive information from their respective logs. In this paper we are defining architecture and the security measures that can be applied for a particular network log. |
||||||
17 Generation of Anonymous Signature and Message using Identity Based Group Blind Signature, S.Kuzhalvaimozhi , Dr.G.Raghavendra Rao The essential functionality of any digital transaction system is the protection of the anonymity of user and the message. Group signature allows any valid group member to sign any number of messages on behalf of the group without revealing the member identity. A blind signature is a cryptographic scheme produces a signature, where the digital signature is obtained on a message from a signer without revealing any information about the message. In this paper we bring in a new cryptographic scheme called a Group Blind Digital Signature combines the existing concept of a Group Digital Signature and a Blind Digital Signature. This scheme is useful in many applications where anonymity is very important like evoting and ecash. This blind group signature scheme uses the identity based signature in which the public key can be derived from any arbitrary unique string. This reduces the complexity involved in certificate management as compared to the traditional public key signature scheme. Moreover, this signature scheme based on the bilinear pairings enables utilizing smaller key sizes |
||||||
18 Computation of Equivalent Moment of Inertia Due to Controlled Frequency in Case of Flywheel-less System Subjected to Peaky Torques, M. V. Palandurkar, J.P. Modak, and S. G. Tarnekar In order to eliminate bulky flywheels from the process machine having loads with severe torque fluctuations can be driven by an induction motor with control of input frequency using VVVf inverters. Situation of rise in load torque can be met by reduction in frequency at that instant. Situation of sudden reduction in load torque can be met by increase in frequency, at that instant. This paper deals with computations for such cases using the graphical relation between torque and speed, finally leading to a plot of instantaneous motor torque as a function of time. Based on this experimental work is carried out by giving reduced frequency at the instant applying peak load. |
||||||
19 Efficient ECC encryption for WSN’s, Ravi Kishore Kodali, and Prof. Narasimha Sarma, N.V.S. Elliptic Curve Cryptography (ECC) provides a secure means of key exchange between communicating nodes using the Diffie-Hellman (DH) Key Exchange algorithm. This work presents an ECC encryption implementation using of the DH key exchange algorithm. Both encryption and decryption of text messages using this algorithm, have been attempted. In ECC, encoding is carried out by mapping a message character to an affine point on an elliptic curve. It can be observed from the comparison of the proposed algorithm and Koblitz’s encoding method, that the proposed algorithm is as secure as Koblitz’s encoding method and the proposed algorithm has less computational complexity as the encoding phase is eliminated altogether. Hence, energy efficiency of the crypto system is improved and the same can be used in resource constrained applications, such as Wireless sensor networks (WSNs). It is almost infeasible to attempt a brute force attack. The security strength of the algorithm is proportional to the key length. However, any increase in the key length results in more communication overhead due to encryption. |