Image Forgery Localization via Block-Grained Analysis of JPEG Artifacts

In this paper, we propose a forensic algorithm to discriminate between original and forged regions in JPEG images, under the hypothesis that the tampered image presents a double JPEG compression, either aligned (A-DJPG) or non-aligned (NA-DJPG). Unlike previous approaches, the proposed algorithm does not need to manually select a suspect region in order to test the presence or the absence of double compression artifacts. Based on an improved and unified statistical model characterizing the artifacts that appear in the presence of both A-DJPG or NA-DJPG, the proposed algorithm automatically computes a likelihood map indicating the probability for each $8 \times 8$ discrete cosine transform block of being doubly compressed. The validity of the proposed approach has been assessed by evaluating the performance of a detector based on thresholding the likelihood map, considering different forensic scenarios. The effectiveness of the proposed method is also confirmed by tests carried on realistic tampered images. An interesting property of the proposed Bayesian approach is that it can be easily extended to work with traces left by other kinds of processin

Secure Watermarking for Multimedia Content Protection: A Review of its Benefits and Open Issues

Distribution channels such as digital music downloads, video-on-demand, multimedia social networks, pose new challenges to the design of content protection measures aimed at preventing copyright violations. Digital watermarking has been proposed as a possible brick of such protection systems, providing a means to embed a unique code, as a fingerprint, into each copy of the distributed content. However, application of watermarking for multimedia content protection in realistic scenarios poses several security issues. Secure signal processing, by which name we indicate a set of techniques able to process sensitive signals that have been obfuscated either by encryption or by other privacy-preserving primitives, may offer valuable solutions to the aforementioned issues. More specifically, the adoption of efficient methods for watermark embedding or detection on data that have been secured in some way, which we name in short secure watermarking, provides an elegant way to solve the security concerns of fingerprinting applications. The aim of this contribution is to illustrate recent results regarding secure watermarking to the signal processing community, highlighting both benefits and still open issues. Some of the most interesting challenges in this area, as well as new research directions, will also be discussed

Detection of Nonaligned Double JPEG Compression Based on Integer Periodicity Maps

In this paper, a simple yet reliable algorithm to detect the presence of nonaligned double JPEG compression (NA-JPEG) in compressed images is proposed. The method evaluates a single feature based on the integer periodicity of the blockwise discrete cosine transform (DCT) coefficients when the DCT is computed according to the grid of the previous JPEG compression. Even if the proposed feature is computed relying only on DC coefficient statistics, a simple threshold detector can classify NA-JPEG images with improved accuracy with respect to existing methods and on smaller image sizes, without resorting to a properly trained classifier. Moreover, the proposed scheme is able to accurately estimate the grid shift and the quantization step of the DC coefficient of the primary JPEG compression, allowing one to perform a more detailed analysis of possibly forged image

TTP-free Asymmetric Fingerprinting based on Client Side Embedding

In this paper, we propose a solution for implementing an asymmetric fingerprinting protocol within a client-side embedding distribution framework. The scheme is based on two novel client-side embedding techniques that are able to reliably transmit a binary fingerprint. The first one relies on standard spread-spectrum like client-side embedding, while the second one is based on an innovative client-side informed embedding technique. The proposed techniques enable secure distribution of personalized decryption keys containing the Buyer's fingerprint by means of existing asymmetric protocols, without using a trusted third party. Simulation results show that the fingerprint can be reliably recovered by using either non-blind decoding with standard embedding or blind decoding with informed embedding, and in both cases it is robust with respect to common attacks. To the best of our knowledge, the proposed scheme is the first solution addressing asymmetric fingerprinting within a clientside framework, representing a valid solution to both customer's rights and scalability issues in multimedia content distributio

Ant colony optimization (ACO) based data hiding in image complex region

This paper presents data an Ant colony optimization (ACO) based data hiding technique. ACO is used to detect complex region of cover image and afterward, least significant bits (LSB) substitution is used to hide secret information in the detected complex regions’ pixels. ACO is an algorithm developed inspired by the inborn manners of ant species. The ant leaves pheromone on the ground for searching food and provisions. The proposed ACO-based data hiding in complex region establishes an array of pheromone, also called pheromone matrix, which represents the complex region in sequence at each pixel position of the cover image. The pheromone matrix is developed according to the movements of ants, determined by local differences of the image element’s intensity. The least significant bits of complex region pixels are substituted with message bits, in order to hide secret information. The experimental results, provided, show the significance of the performance of the proposed method

Investigating Inconsistencies in PRNU-Based Camera Identification

PRNU (Photo-response non-uniformity) is widely considered a unique and reliable fingerprint for identifying the source of an image. The PRNU patterns of two different sensors, even if belonging to the same camera model, are strongly uncorrelated. Therefore, such a fingerprint is used as evidence by various law enforcement agencies for source identification, manipulation detection, etc. However, in recent smartphones, images are subjected to significant in-camera processing associated with computational photography. This heavy processing introduces non-unique artifacts (NUA) in such images and masks the uniqueness of the PRNU fingerprint. In this work, we investigate the robustness of PRNU in modern smartphones. We propose a model that explains the unexpected behavior of PRNU in such smartphones. Finally, we present two methods to identify images suffering from NUA. Our methods achieve high accuracy in identifying such images

On the secrecy of compressive cryptosystems under finite-precision representation of sensing matrices

In recent years, the Compressed Sensing (CS) framework has been shown to be an effective private key cryptosystem. If infinite precision is available, then it has been shown that spherical secrecy can be achieved. However, despite its theoretically proven secrecy properties, the only practically feasible implementations involve the use of Bernoulli sensing matrices. In this work, we show that different distributions employing a much larger finite alphabet can be considered. More in detail, we consider the use of quantized Gaussian sensing matrices and experimentally show that, besides being suitable for practical implementation, they can achieve higher secrecy with respect to Bernoulli sensing matrices. Furthermore, we show that this approach can be used to tune the secrecy of the CS cryptosystems based on the available machine precision

Selective encryption in the CCSDS standard for lossless and near-lossless multispectral and hyperspectral image compression

In this paper, we investigate low-complexity encryption solutions to be embedded in the recently proposed CCSDS standard for lossless and near-lossless multispectral and hyperspectral image compression. The proposed approach is based on the randomization of selected components in the image compression pipeline, namely the sign of prediction residual and the fixed part of Rice-Golomb codes, inspired by similar solutions adopted in video coding. Thanks to the adaptive nature of the CCSDS algorithm, even simple randomization of the sign of prediction residuals can provide a sufficient scrambling of the decoded image when the encryption key is not available. Results on the standard CCSDS test set show that the proposed technique uses on average only about 20% of the keystream compared to a conventional stream cipher, with a negligible increase of the rate of the encoder

On the fly estimation of the sparsity degree in Compressed Sensing using sparse sensing matrices

In this paper, we propose a mathematical model to estimate the sparsity degree k of exactly k-sparse signals acquired through Compressed Sensing (CS). Our method does not need to recover the signal to estimate its sparsity, and is based on the use of sparse sensing matrices. We exploit this model to propose a CS acquisition system where the number of measurements is calculated on-the-fly depending on the estimated signal sparsity. Experimental results on block-based CS acquisition of black and white images show that the proposed adaptive technique outperforms classical CS acquisition methods where the number of measurements is set a priori