A study of the obtainable watermark data rate for information hiding algorithms is presented in this paper. As the perceptual entropy for wideband monophonic audio signals is in the range of four to five bits per sample, a significant amount of additional information can be inserted into signal without causing any perceptual distortion. Experimental results showed that transform domain watermar...

In this information era, digital information sharing and transfer plays a vital role and their use has increased exponentially with the development of technology. Thus providing security of data is a topic of concern. Data hiding is a powerful tool that provides mechanism for securing data over insecure channel by concealing information within information. Steganography inherits data hiding con...

it has been proved that sphericity testing for digraphs is an np-complete problem. here, we investigate sphericity of 3-connected single source digraphs. we provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $o(n)$ time.

Steganography is the art or practice of concealing a message, image, or file within another message, image, or file. In steganography, there is a technique in which the least significant bit is modified to hide the secret message, known as the least significant bit (LSB) steganography. Least significant bit matching images are still not well detected, especially, at low embedding rate. In this ...

Many existing steganographic methods hide more secret data into edged areas than smooth areas in the host image, which does not differentiate textures from edges and causes serious degradation in actual edge areas. To avoid abrupt changes in image edge areas, as well as to achieve better quality of the stego-image, a novel image data hiding technique by adaptive Least Significant Bits (LSBs) su...

In this paper, we present some attacks on GAGE, InGAGE, and CiliPadi which are candidates of the first round of the NIST-LWC competition. GAGE and InGAGE are lightweight sponge based hash function and Authenticated Encryption with Associated Data (AEAD), respectively and support different sets of parameters. The length of hash, key, and tag are always 256, 128, and 128 bits, respec...

In today’s digital world securing different forms of content is very important in terms of protecting copyright and verifying authenticity. One example is watermarking of digital audio and images. We believe that a marking scheme analogous to digital watermarking but for documents is very important. In this paper we describe the use of laser amplitude modulation in electrophotographic printers ...

Similarity-sensitive hashing seeks compact representation of vector data as binary codes, so that the Hamming distance between code words approximates the original similarity. In this paper, we show that using codes of fixed length is inherently inefficient as the similarity can often be approximated well using just a few bits. We formulate a sequential embedding problem and approach similarity...

In this paper, a new reversible watermarking method is presented that reduces the size of a stereoscopic image sequence while keeping its content visible. The proposed technique embeds the residuals of the right frames to the corresponding frames of the left sequence, halving the total capacity. The residual frames may result in after a disparity compensated procedure between the two video stre...