Copy Attack Research Articles

A New System for Fake Profile Recognition in Social Networks

The billions of users all over the world are spending online social network, such as Twitter, Facebook, Tumbler and LinkedIn. The flaws in this social media may indications to abuse user’s information and execute an attack of identity cloning. In this work mainly focuses, a new method for hiding data to hide precise details in profile pictures to learn botnets and fake profiles. In this paper, presents an ordering and investigation of recognition mechanisms of genetic copy attacks on online network of social, purely established on attribute likeness, friend network likeness, and profile inquiry for a time interval and record of Internet Protocol sequences. This work, proposals an algorithm for transform discrete wavelet for hiding the data. So, the system can prevent the replica attacks and offer the whole user data privacy protective. Similarly, when users upload the profile image or photos it would be first watermarked and then updated. Java static watermarking systems and algorithms is been used for watermarking procedure. Here tracking any fake users updating the same profile picture given easier and tracking their IP address also became easier. Also, our system raises certain features which can be investigated to the users through process of registration. Thus, providing secure authentication. Hence avoiding clone attacks in social media became easier.

Perceptual Image Hashing With Texture and Invariant Vector Distance for Copy Detection

Content-based image copy detection has become one of the important technologies in copyright protection, where two major processes, content-based feature extraction and matching are included. However, it is certainly true that enough storage space is required to establish feature database for matching, which greatly increases time and storage consumption, as well as lacks flexibility. Fortunately, perceptual image hashing is a good strategy to address these problems, in which content-based features are extracted and further encoded to hash codes. On the one hand, content-based features provide and ensure higher copy detection accuracy, while on the other hand, hash codes instead of feature database reduce storage space and improve time efficiency. Meanwhile, a better balance between robustness and discrimination is one of the most objectives of image hashing, which is conducive to its application in multimedia management and security. Consequently, we present an effective image hashing method for copy detection. Specifically, to obtain perceptual robustness against to copy attacks, we extract the global statistical characteristics in gray-level co-occurrence matrix (GLCM) to reveal texture changes. Then, to make up the discrimination limitation, we leverage the local dominant DCT coefficients from the first row/column in each sub-image to calculate vector distance. Finally, two kinds of complementary information (global feature via texture and local feature via vector distance) are simultaneously preserved to generate hash codes. Various experiments performed on benchmark database indicate that our proposed perceptual image hashing provides higher detection accuracy and better balance between robustness and discrimination than the state-of-the-art algorithms.

Fractional-Order Spatial Steganography and Blind Steganalysis for Printed Matter: Anti-Counterfeiting for Product External Packing in Internet-of-Things

This paper advocates a novel conceptual formulation of the fractional-order spatial steganography (FSS) and blind steganalysis for printed matter, which can be efficiently employed in the anti-counterfeiting for product external packing in Internet-of-Things (IoT). Traditional digital steganography is not printable. Within the limits of our knowledge, until now, there are not a well-established steganography and a corresponding steganalysis for printed matter in IoT, which should receive desired attention. Fractional calculus has potentially received prominence in applications in the domain of image processing mainly because of its strengths like long-term memory, nonlocality, and weak singularity. Therefore, in an attempt to overcome the aforementioned technical limitation of traditional digital steganography, this paper has studied here, as an interesting theoretical problem, would it be possible to apply the capability of preserving the edges and textural details of fractional calculus to the achievement of the steganography and steganalysis for printed matter in IoT. Motivated by this inspiration, in this work, this paper introduces a novel conceptual formulation of an FSS and a fractional-order blind steganalysis (FBS) for printed matter. At first, according to the opponent process theory of color vision, to better achieve the imperceptibility of the hidden secret information, this paper uses both the self-similar complex textures in a neighborhood and the opponent channel of blue versus yellow to implement FSS for printed matter. Second, without requiring a priori knowledge regarding the characteristics of the original carrier image, hidden secret image, and steganography, an FBS, a fractional-order multimodal function optimization algorithm, is proposed. Finally, the efficient capability of hiding secret information of FSS and that of detecting secret information of FBS are analyzed in detail experimentally, respectively. These two important advantages lead to the superiority of the proposed approach for defending against statistics attack, rotation and distortion attack, cropping attack, scaling attack, noise attack, and color copy attack. The main contribution of this paper is the first preliminary attempt of a feasible achievement of a spatial steganography and a blind steganalysis for printed matter.

A robust watermarking scheme against frame blending and projection attacks

Camcorder based video copy attack has become a serious threat to the electronic movie distribution services. Although watermarking is used to authenticate against such camcorder based copy attack, in the camcorder recorded videos, the embedded watermark suffers from several geometric distortions and temporal de-synchronizations. This paper proposes a watermarking scheme which is robust against the distortion due to cam-cordering process. Firstly, a comprehensive literature survey has been done on the watermarking schemes resilient to the cam-cording attack. Based on the existing limitations of the state-of-art literature, a watermarking scheme is devised to embed a watermark which is robust against to frame blending and projection attacks which are the major distortions caused during cam-cording. A comprehensive set of experiments has been carried out to show the applicability of the proposed scheme over the existing literature.

Effective and Efficient Image Copy Detection with Resistance to Arbitrary Rotation

For detecting the image copies of a given original image generated by arbitrary rotation, the existing image copy detection methods can not simultaneously achieve desirable performances in the aspects of both accuracy and efficiency. To address this challenge, a novel effective and efficient image copy detection method is proposed based on two global features extracted from rotation invariant partitions. Firstly, candidate images are preprocessed by an averaging operation to suppress noise. Secondly, the rotation invariant partitions of the preprocessed images are constructed based on pixel intensity orders. Thirdly, two global features are extracted from these partitions by utilizing image gradient magnitudes and orientations, respectively. Finally, the extracted features of images are compared to implement copy detection. Promising experimental results demonstrate our proposed method can effectively and efficiently resist rotations with arbitrary degrees. Furthermore, the performances of the proposed method are also desirable for resisting other typical copy attacks, such as flipping, rescaling, illumination and contrast change, as well as Gaussian noising.

A multiple reversible watermarking technique for fingerprint authentication

The classical fingerprint recognition system can be compromised at the database and the sensor. Therefore, to beef up security of the fingerprint recognition system, reversible watermarking is proposed to protect these two points. Reversible watermarks thwart manipulations, $${viz}$$viz., copy and replay attacks and ensure that native fingerprint recognition accuracy remains unaffected. Fingerprint-dependent watermark $$W_1$$W1 authenticates the database and shields it against the copy attack. The second watermark $$W_2$$W2 verifies fingerprint captured by the sensor and foil replay attack. $$W_2$$W2 is derived from the higher order moments of the fingerprint. Divergence in the computed and extracted watermarks indicates loss of authenticity. The experimental results validate proposed hypothesis.

A Novelty Approach on Forgery Digital Image Detection based Image Source Identification ANN

In imaging science, the photo editing software packages can alter the original images without any detecting traces of tampering. Hence, the image forgery detection technique plays an important role in verifying the integrity of digital image forensics for authentication. The techniques such as watermarking are used for authentication but it can be modified through third parties attack through extraction. Malicious and digital imaging (digital products) tamper detection is the subject of this article. In particular, we focus on a special type of digital forgery detection - copy attack campaign, in which part of the image is copied and pasted into the image and the cover features a large image of intentions another. In this paper, we investigate the dynamic forged copy detection problem, and describes a highly efficient and reliable detection method that based on image source ANN identification.. Even when the region is enhanced copy / retouching and background merger, and the method can successfully identify counterfeit forgery when images are saved in a lossy format (such as JPEG). The performance of the method's performance several forged images.

Multi-Hop Video Routing Methods: State of the Art

In this paper video transmission in the Internet scenario, where packets move from source to destination, has been studied. In this various methods and schemes are discussed to transmit the packet from sender to destination efficiently. Various methods like encryption, scrambling techniques are used to hide the content from the intruders. These algorithms are compared on various parameters like delay, PSNR, throughput to provide the smooth playback of video at the destination. These algorithms are efficient to transmit the video data securely from sender to destination. Still the problem of video copy attack exists where an intruder can copy all the coming packets and extract frames from them. If the sequence of packets is same as sequence of frames then whole video can be thus copied. In future algorithms preventing the packet copy attack on the video data in the network.

A Video Characteristics Watermarking Algorithm Based on Bees Evolutional Computation

Digital video watermarking is an efficient way of copyright protection. A robust watermarking was proposed that ccording to the video features using the evolutional method of video image classification processing, suitable for video performance and human visual characteristics of video watermarking, and put forward a kind of using Bees evolutional algorithm for video image classification processing of video watermarking algorithm. All the key frame numbers are converts to a binary matrix after data transformation. At last the binary image is produced. From this, the watermarking image reflects the video’s features, so it is effective to resist the watermark copy attack.

A novel signature based on the combination of global and local signatures for image copy detection

ABSTRACTTo prevent digital image from unauthorized use, image copy detection is an important technique in the field of copyright protection. The conventional methods of image copy detection concentrate on extracting global or local signatures to resist various kinds of copy attacks. However, the global signatures are sensitive to some geometric transformations, such as rotation and cropping, while the local signatures are not discriminative enough to identify copies from similar images. Considering both the robustness and discriminability, a novel image signature based on the combination of global and local signatures is proposed for image copy detection. Firstly, the interest points are detected from a given image by using the Hessian–Affine detector. Secondly, the image is divided into some circle tracks, and thus the interest points are distributed into these tracks. Finally, to combine the advantages of the circle‐track‐based global signature and the interest points, the global distribution characteristics of interest points based on circle tracks are used to generate our image signature. Experimental results demonstrate the effectiveness of our proposed method in the aspects of both robustness and discriminability. Copyright © 2013 John Wiley & Sons, Ltd.

Visual attention guided video copy detection based on feature points matching with geometric-constraint measurement

In this paper, to efficiently detect video copies, focus of interests in videos is first localized based on 3D spatiotemporal visual attention modeling. Salient feature points are then detected in visual attention regions. Prior to evaluate similarity between source and target video sequences using feature points, geometric constraint measurement is employed for conducting bi-directional point matching in order to remove noisy feature points and simultaneously maintain robust feature point pairs. Consequently, video matching is transformed to frame-based time-series linear search problem. Our proposed approach achieves promising high detection rate under distinct video copy attacks and thus shows its feasibility in real-world applications.

Watermarking Algorithm Based on Video Features

A variety of video watermarking algorithm is not rare. But the connection of watermarking algorithm and video feature is a completely new field. This algorithm attempts to generate the watermarking image based the number of video’s key frames. All the key frame numbers are converts to a binary matrix after data transformation, at last the binary image is produced. According to those steps, the watermarking image reflects the video’s features, so it is easy to resist the watermark copy attack.

A robust hashing algorithm based on SURF for video copy detection

To protect digital video from unauthorized use, video copy detection is an active research topic in the field of copyright control. For content-based copy detection, the key issue is to extract robust transformation-invariant feature. In this paper, a robust hashing algorithm based on speeded up robust feature (SURF) and ordinal measure (OM) is proposed for video copy detection. Since SURF is an invariant feature based on scale space theory, the local feature is extracted by SURF in a frame-by-frame manner. Every frame is divided into 4 × 4 blocks, and every block is traversed by Hilbert-order rasterization to count the number of SURF points. The Hash value is built by the difference of SURF points between adjacent blocks in Hilbert curve. Moreover, two special copy attacks, i.e., picture-in-picture and video flipping, are specifically discussed. Experimental results show the effectiveness of the proposed approach in both accuracy and efficiency.

A Defensive OTP-Based Mechanism against Application Layer DDoS Attacks

In this paper, we present the design and implementation of OTP-DEF, a kernel extension to protect web servers against application layer DDoS attacks. OTP-DEF provides authentication by using OTP-based tests, which is different from other systems that use graphical tests. First of all, according to the load of web server, an OTP-DEF web-server should fall into one of three following modes: normal, suspected attack or confirmed attack mode, and the OTP-DEF authentication mechanism shall only be activated when web-server is in suspected attack mode. Secondly, we use OTP as our puzzle, which can automatically change at the certain time interval. It makes our proposal can defend socially-engineered attack, copy attacks, replay attacks and Brute-Force Attack. Thirdly, OTP-DEF uses an intermediate stage to identify the IP addresses that ignore the test, and persistently bombard the server with requests despite repeated failures at solving the puzzles. These machines are zombies because their intent is to congest the server. Once these machines are identified, OTP-DEF blocks their requests, turns the tests off, and allows access to legitimate users who are unable or unwilling to solve tests. Finally, OTP-DEF requires no modifications to client software.

A New Robust Watermarking Scheme to Increase Image Security

In digital image watermarking, an image is embedded into a picture for a variety of purposes such as captioning and copyright protection. In this paper, a robust private watermarking scheme for embedding a gray-scale watermark is proposed. In the proposed method, the watermark and original image are processed by applying blockwise DCT. Also, a Dynamic Fuzzy Inference System (DFIS) is used to identify the best place for watermark insertion by approximating the relationship established between the properties of HVS model. In the insertion phase, the DC coefficients of the original image are modified according to DC value of watermark and output of Fuzzy System. In the experiment phase, the CheckMark (StirMark MATLAB) software was used to verify the method robustness by applying several conventional attacks on the watermarked image. The results showed that the proposed scheme provided high image quality while it was robust against various attacks, such as Compression, Filtering, additive Noise, Cropping, Scaling, Changing aspect ratio, Copy attack, and Composite attack in comparison with related methods.

Blind Watermarking of Color Images Using Karhunen-Loeve Transform Keying

This paper presents a method for blind digital watermarking of color images. The proposed scheme performs a decorrelation of the RGB color bands of the image to be watermarked using a Karhunen–Loeve transform (KLT), then marks the coefficients of the KLT of the first band obtained. The novelty of the method resides in the fact that the KLT basis images used for the transforms are not related to the image being marked, but are from an image taken as the secret key used throughout the scheme. The watermarking of the chosen KLT coefficients is performed using an i.i.d. Gaussian sequence. The method shows good robustness to attacks and signal processing operations, in particular to JPEG compression, filtering, resampling and noise addition, maintaining at the same time a high image quality. In addition, the scheme is secure against protocol attacks such as copy attack and ambiguity attack.

Near-Optimal Watermark Estimation and Its Countermeasure: Antidisclosure Watermark for Multiple Watermark Embedding

Robustness is a critical requirement for a watermarking scheme to be practical. Current watermarking methods usually claim a certain degree of robustness against those attacks that aim to destroy a hidden watermark at the expense of degrading the quality of the media data. However, there exist watermark-estimation attack (WEA), such as the collusion attack, which can remove watermarks while making the attacked data further transparent to its original. Another kind of attack is the copy attack, which can cause protocol ambiguity within a watermarking system. The aim of this paper is to deal with the WEA, which is clever at disclosing hidden information for unauthorized purposes. To this end, we begin by gaining insight into the WEA, leading to formal definitions of optimal watermark estimation and near-perfect cover data recovery. Subject to these definitions, a new content-dependent watermark (CDW) is proposed to deal with watermark-estimation attack. Mathematical analyses and experimental results consistently verify the effectiveness of the proposed watermark estimation and recovery algorithm, and the proposed content-dependent watermark. To our knowledge, this anti-disclosure watermark is the first work that can give those multiple-redundant watermark embedding approaches resistance to both collusion and copy attacks

Security analysis of transformed-key asymmetric watermarking system

Asymmetric watermarking schemes have been widely discussed recently. Transformed-key asymmetric watermarking (TKAW) system is one of the schemes, which was proposed by Choi et al. This letter discusses the weaknesses of TKAW. In TKAW, the inner product of the received signal and public key almost equals to zero. As a result, it cannot resist projection attack. To prove this point, we will demonstrate how to find the most relevant unwatermarked signal y/spl tilde/ for a given watermark embedded signal y and prove that /spl par/y-y/spl par//spl les/|/spl alpha/|, where /spl alpha/ is a constant adjusted to a value that makes the watermark imperceptible. Moreover, we also find that the feature y-y/spl tilde/, a predicted watermark of a stego image, can be copied from a stego image to another image, which means that the TKAW system cannot resist copy attack either.

Owner–customer right protection mechanism using a watermarking scheme and a watermarking protocol

Over the past few years, there have been more and more robust watermarking schemes proposed for copyright protection of digital documents. The authors combine cryptography with watermarking to simultaneously address the problems of protecting the owner's copyright and the legal customer's ownership. The authors propose a robust watermarking scheme based on visual cryptography and a watermarking protocol based on asymmetric cryptography. It is worthwhile to note that the proposed schemes are resistant to counterfeit, collusion, averaging, and copy attacks, while the large majority of robust watermarking schemes are not. Furthermore, the application of digital signature and timestamp makes public verification possible.

A Novel Blind Video Watermarking Scheme Based on Independent Dynamic Component

Video copyright protection has become important as it is possible to make unlimited copies of digital video without quality loss. Video watermark is the main method of video copyright protection. A novel blind video watermarking scheme is proposed in this paper, in which independent component analysis (ICA) is used to extract the common static component and relative dynamic component from the consecutive frames. And then a designed watermark is embedded into the wavelet coefficients of the obtained dynamic component according to the 4-neighboring-mean based algorithm. The binarization of the 3-level-approximate sub-image of the I-frame in each GOP (GOP-Group of Picture) is selected as the watermark for this GOP. Given such watermark, the scheme can easily resist copy attack and temporal synchronization. Besides, because the watermarks of different GOPs and their embedding positions in a GOP are different, the intra-video collusion attack can be resisted effectively and there is no possibility for inter-video collusion attack to succeed. The simulation shows the feasibility of this scheme, which can resist well temporal synchronization, copy attack, and collusion attack.