Monjul Saikia

Coded Fingerprinting Based Watermarking to Resist Collusion Attacks and Trace Colluders

The alteration, repackaging, and redistribution of multimedia content like image, video, audio, etc. poses a serious threat to both national security and commercial markets. Presently with the growing popularity of digital media the world is becoming smaller and smaller. That is mainly due to the internet connectivity and WWW phenomena. But the copyright protection of intellectual properties has become a necessity for prevention of illegal copying and verification of content integrity. Here wavelet transform plays the role of an efficient and robust tool due to its multi-resolution capability along with singular value decomposition (SVD) for watermarking. Both of these when implemented with coded fingerprinting not only resist collusion attacks but can also help tracing colluders. This work here by focuses implementation of a hybrid watermarking scheme using SVD and wavelet transform along with coded fingerprinting developed for protection of the intellectual property.

Improving the performance of key pre-distribution scheme in sensor network using clustering of combinatorics

Key Pre-distribution Scheme in Wireless Sensor Network plays an important role of providing security to the network. A perfect key pre-distribution scheme provides better resiliency against malfunction of the sensor node or physical capture of nodes. Combinatorial design technique is well established method for KPS as it give excellent connectivity to the network. Also it is observed that good connectivity does not imply perfect resilience against node compromise. Resilience is the measure of ability of survival of the network in hostile environment. We propose a novel KPS based on combinatorial design, where nodes were clustered with the help of concept of formation of balanced incomplete blocks of combinatorial design theory. We have performed various experiments for performance analysis of the new proposed scheme showing the connectivity comparison, average hop count comparison and resilience measure with existing traditional KPS in various network scenarios.

Performance Analysis of Expander Graph Based Key Predistribution Scheme in WSN

Secret communication in Wireless Sensor Network is considered to be a challenging task due to high risk of node capture. Secret communication is only possible when communicating nodes share a common key for cryptographic purpose. Sensor nodes are often loaded with required secret key in its memory prior to deployment called key pre-distribution scheme (KPS). Various KPS have been proposed to provide secure communication and to minimize damage caused by intruder. In this paper, we will discuss properties of expander graph that are suitable in designing KPS and perform various experiments on KPS based on Ramanujan Expander graph for performance evaluation.

A Pure Combinational Logic Gate Based Forward Converter for New Five Moduli Set RNS

Choosing a proper moduli set for Residue Number System based building blocks greatly affects the performance of the whole system. The prevalent issue is that as the number of moduli increases the speed of the residue arithmetic units increases, whereas the forward converters (Binary to Residue converters) and Reverse converters (Residue to Binary converters) become slower and more complex. Different moduli sets with efficient converter are proposed by researchers. One of the most well formed special moduli set is {2n - 1, 2n, 2n + 1}. However some applications like cryptography algorithms require a very large dynamic range which cannot be achieved efficiently using the special moduli sets that consists of three or four moduli. When the required dynamic range is very large, these moduli have to be large, which results in lower performance of the arithmetic units in each modulo channel. In that case, the best solution is to use many small moduli (five or more) to represent the large dynamic range efficiently. In this paper a new novel five moduli set {2n - 1, 2n, 2n + 1, 2n+1 - 1, 2n-1 - 1} for even n with its forward conversion circuits are proposed. The proposed moduli set have a dynamic range that can represent up to 5n - 1 bits while keeping the moduli small enough and the converters efficient.

Spread Spectrum Embedding of Colluder Traceable Codeword in Multimedia

With digital multimedia distribution, intellectual property rights (IPR) are at a more risk than ever, due to the possibility of unlimited copying without fidelity loss. Encryption and copy protection mechanisms do not fully efficiently deal with the issue. Encryption usually protects the data only on the transport channel, and as soon as the data are decrypted for exhibit or playback, they can be copied. Copy protection mechanisms are difficult to realize in open systems as data are open to all. Thus, both encryption and copy protection offer only limited security. Watermarking has been proposed as a last line of defense in the protection of IPR. Watermarking methods embed information irremovably and invisibly into the host data. The watermark typically contains information about source and recipient of the distributed data. Thus, if pirated copies of the data are distributed, it can still be determined who owns the copyright and who the original, authorized recipient was. Thus, it allows tracing back illegally produced copies of the data. In the time of watermarking it is possible to assign some unique codeword to every copy to be distributed, by which it is possible to detect any alteration made to the watermarked copy. This paper presents spread spectrum watermarking of a specially designed colluder traceable codeword with help of combinatorial design in digital image.

Hybrid image watermarking scheme using SVD and PDFB based contourlet transform

Copyright protection of intellectual property is a very large and growing business. This is due to the easier availability of all multimedia data with just a click of a mouse, resulting to the increase of piracy. Watermarking is one of the popular methods of authentication to help protect intellectual property rights. Of the various forms of multimedia data image is one of the most popular variant. Here a method of digital image watermarking is presented using singular value decomposition (SVD) which one of the very popular mathematical computation tools. Along with it a lot of transforms have been used earlier like discrete wavelet transform (DWT), DCT, Fourier transform, etc. to provide hybrid techniques. But here an unconventional transform introduced in the middle of this decade, called contourlet transform (CT) has been used. This transform being similar to DWT fits well to provide a robust watermarking scheme along with the SVD. Here the combination of pyramidal and directional filter bank (PDFB) in CT has been used.

Secure energy aware multi-path routing with key management in wireless sensor network

With the ability to work under critical environments where human interception is difficult, wireless sensor networks serves as a useful communication means for data transmission and collection. But like other wireless networks WSN is also prone to adversary interventions. So the researchers are addressing this issue to make routing protocols secure for communication. But due to the severe resource constraints on sensor nodes like limited battery life and limited storage capacity prevents the traditional complex security mechanisms to be employed on the sensor nodes. In this paper we propose a new routing algorithm called Secure Energy Aware Multipath Routing with Key Management (SEAM-KM) in Wireless Sensor Network. This protocol focuses on using a base station as the central control block for all kinds of computation like shortest path selection, routing table generation, Updating the routing table and distribution of pair wise keys among the sensor nodes and the base station. Leaving the energy consuming computations to be performed by the base station, the lifetime of the sensor nodes can be prolonged. Moreover distribution of pair wise keys among sensor nodes provides security among sensor nodes and also increases the resilience of the network. This protocol is resistive to some of the specific attacks which rely on forming attractive routes to lure the sensor nodes to communicate through the already compromised nodes.

Chaotic Map Based Image Encryption in Spatial Domain: A Brief Survey

Image encryption is a process of conversion of original image into an unintelligible form, which is not understood by anyone except authorized parties after performing decryption operation on it with the help of a secret key. Image encryption is a challenging task due to its large amount of data and correlation among pixels restricts using traditional encryption algorithm. So, to obtain an efficient and robustness against security violation during image transmission chaotic based image encryption techniques are proven to be more suitable. These techniques are considered more effective due to low computational power, high sensitivity to initial conditions. In this paper, we discuss about chaos and their properties and we give a general overview of chaotic map based image encryption scheme and various phases in the process.

A Novel Key Predistribution Scheme for Minimum Angle Routing in Wireless Sensor Network

The main objective of a sensor network is to forward the information regarding any event detected by a sensor node. For efficient routing of the packets through the network, effective and portable routing is essential. We find that a minimum angle-based routing algorithm is highly efficient with low computational cost. In addition to a fast routing mechanism, security is also a major concern of any sensor network. Symmetric key encryption is widely used for this purpose, with secret keys loaded prior to deployment. In this chapter, we propose a novel key predistribution scheme especially applicable for minimum angle-based routing.

Location-Independent Key Distribution for Sensor Network Using Regular Graph

Regular graph is the type of graph whose degree of all vertices are same, and this property makes it very useful in design of key distribution algorithm. Keys in wireless sensor node need to be evenly distributed for efficient storage and good connectivity. In the past various methods have been proposed to overcome the problem of key predistribution for wireless sensor network. Among these, the balanced incomplete block design technique from the theory of combinatorics provides a meaningful enhancement in key predistribution. Also various improvements have been done over this technique for especial arrangement of sensor network. Here, we use Paley graph a class of regular graph to model our key distribution in a location-independent sensor environment, where locations of sensor nodes are assumed to be unknown prior to deployment or key distribution. Experiments were performed and presented here.