An LSB Data Hiding Technique Using Prime Numbers

In this paper, a novel data hiding technique is proposed, as an improvement over the Fibonacci LSB data-hiding technique proposed by Battisti et al. First we mathematically model and generalize our approach. Then we propose our novel technique, based on decomposition of a number (pixel-value) in sum of prime numbers. The particular representation generates a different set of (virtual) bit-planes altogether, suitable for embedding purposes. They not only allow one to embed secret message in higher bit-planes but also do it without much distortion, with a much better stego-image quality, and in a reliable and secured manner, guaranteeing efficient retrieval of secret message. A comparative performance study between the classical Least Significant Bit (LSB)method, the Fibonacci LSB data-hiding technique and our proposed schemes has been done. Analysis indicates that image quality of the stego-image hidden by the technique using Fibonacci decomposition improves against that using simple LSB substitution method, while the same using the prime decomposition method improves drastically against that using Fibonacci decomposition technique. Experimental results show that, the stego-image is visually indistinguishable from the original cover-image.Comment: 6 Pages, 7 Figures, Third International Symposium on Information Assurance and Security, August 29-31, 2007, Manchester, United Kingdom, IEEE Computer Society press, USA, ISBN 0-7695-2876-7, pp. 101-106, 2007

Embedding Secret Data in HTML Web Page

In this paper, we suggest a novel data hiding technique in an HTML Web page. HTML Tags are case insensitive and hence an alphabet in lowercase and one in uppercase present inside an HTML tag are interpreted in the same manner by the browser,i.e., change in case in an web page is imperceptible to the browser. We basically exploit this redundancy and use it to embed secret data inside an web page, with no changes visible to the user of the web page, so that he can not even suspect about the data hiding. The embedded data can be recovered by viewing the source of the HTML page. This technique can easily be extended to embed secret message inside any piece of source-code where the standard interpreter of that language is case-insensitive.Comment: 10 Pages, 6 Figures, 2 Algorithms,1st International Conference on Image Processing and Communications, September 16-18, 2009, Bydgoszcz, Poland

Steganalysis: Detecting LSB Steganographic Techniques

Steganalysis means analysis of stego images. Like cryptanalysis, steganalysis is used to detect messages often encrypted using secret key from stego images produced by steganography techniques. Recently lots of new and improved steganography techniques are developed and proposed by researchers which require robust steganalysis techniques to detect the stego images having minimum false alarm rate. This paper discusses about the different Steganalysis techniques and help to understand how, where and when this techniques can be used based on different situations.Comment: 5 pages, 1 figur

Data Hiding Techniques using number decompositions

Data hiding is the art of embedding data into digital media in a way such that the existence of data remains concealed from everyone except the intended recipient. In this paper, we discuss the various Least Significant Bit (LSB) data hiding techniques. We first look at the classical LSB data hiding technique and the method to embed secret data into cover media by bit manipulation. We also take a look at the data hiding technique by bit plane decomposition based on Fibonacci numbers. This method generates more bit planes which allows users to embed more data into the cover image without causing significant distortion. We also discuss the data hiding technique based on bit plane decomposition by prime numbers and natural numbers. These methods are based on mapping the sequence of image bit size to the decomposed bit number to hide the intended information. Finally we present a comparative analysis of these data hiding techniques.Comment: 5 pages, 1 figure, 4 table

A Distributed and Cooperative Approach to Botnet Detection Using Gossip Protocol

Bots, in recent times, have posed a major threat to enterprise networks. With the distributed nature of the way in which botnets operate, the problems faced by enterprises have become acute. A bot is a program that operates as an agent for a user and runs automated tasks over the internet, at a much higher rate than would be possible for a human alone. A collection of bots in a network, used for malicious purposes, is referred to as a botnet. In this paper we suggested a distributed, co-operative approach towards detecting botnets is a given network which is inspired by the gossip protocol. Each node in a given network runs a standalone agent that computes a suspicion value for that node after regular intervals. Each node in the network exchanges its suspicion values with every other node in the network at regular intervals. The use of gossip protocol ensures that if a node in the network is compromised, all other nodes in the network are informed about it as soon as possible. Each node also ensures that at any instance, by means of the gossip protocol, it maintains the latest suspicion values of all the other nodes in the network.Comment: 8 pages, 1 figur

A PAXOS based State Machine Replication System for Anomaly Detection

A number of systems in recent times suffer from attacks like DDoS and Ping of Death. Such attacks result in loss of critical system resources and CPU cycles, as these compromised systems behave in an abnormal manner. The effect of such abnormalities is worse in case of compromised systems handling financial transaction, since it leads to severe monetary losses. In this paper we propose a system that uses the Replicated State Machine approach to detect abnormality in system usage. The suggested system is based on PAXOS algorithm, an algorithm for solving the consensus problem in a network of unreliable processors.Comment: 9 pages, 4 figure

Surveying Solutions to Securing On-Demand Routing Protocols in MANETs

A Mobile ad hoc Network or MANET is a wireless network of mobile devices that has the ability to self-configure and self-organise and is characterised by an absence of centralised administration and network infrastructure. An appreciable number of routing protocols used in a typical MANET have left the critical aspect of security out of consideration by assuming that all of its constituent nodes are trustworthy and non-malicious. In this paper, we discuss some of the major threats that such networks are vulnerable to, because of these inherently insecure protocols. The focus is specifically on the source-initiated and on-demand routing protocols. Further, solutions and modifications to these protocols that have been proposed over time, enabling them to mitigate the aforementioned threats to some extent, are also analysed.Comment: 7 pages, 1 table, updated refernce

Survey of Security and Privacy Issues of Internet of Things

This paper is a general survey of all the security issues existing in the Internet of Things (IoT) along with an analysis of the privacy issues that an end-user may face as a consequence of the spread of IoT. The majority of the survey is focused on the security loopholes arising out of the information exchange technologies used in Internet of Things. No countermeasure to the security drawbacks has been analyzed in the paper.Comment: 7 pages, 3 figure

FuGeIDS: Fuzzy Genetic paradigms in Intrusion Detection Systems

With the increase in the number of security threats, Intrusion Detection Systems have evolved as a significant countermeasure against these threats. And as such, the topic of Intrusion Detection Systems has become one of the most prominent research topics in recent years. This paper gives an overview of the Intrusion Detection System and looks at two major machine learning paradigms used in Intrusion Detection System, Genetic Algorithms and Fuzzy Logic and how to apply them for intrusion detection.Comment: 7 pages, 2 figures, 1 tabl

A Note On the Bounds for the Generalized Fibonacci-p-Sequence and its Application in Data-Hiding

In this paper, we suggest a lower and an upper bound for the Generalized Fibonacci-p-Sequence, for different values of p. The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two consecutive terms in generalized Fibonacci sequence converges to a p-degree polynomial and then use this result to prove the bounds for generalized Fibonacci-p sequence, thereby generalizing the exponential bounds for classical Fibonacci Sequence. Then we show how these results can be used to prove efficiency for data hiding techniques using generalized Fibonacci sequence. These steganographic techniques use generalized Fibonacci-p-Sequence for increasing number available of bit-planes to hide data, so that more and more data can be hidden into the higher bit-planes of any pixel without causing much distortion of the cover image. This bound can be used as a theoretical proof for efficiency of those techniques, for instance it explains why more and more data can be hidden into the higher bit-planes of a pixel, without causing considerable decrease in PSNR.Comment: 15 Pages, 2 Figures, 2 Table