Comparison of DCT, SVD and BFOA based multimodal biometric watermarking systems

AbstractDigital image watermarking is a major domain for hiding the biometric information, in which the watermark data are made to be concealed inside a host image imposing imperceptible change in the picture. Due to the advance in digital image watermarking, the majority of research aims to make a reliable improvement in robustness to prevent the attack. The reversible invisible watermarking scheme is used for fingerprint and iris multimodal biometric system. A novel approach is used for fusing different biometric modalities. Individual unique modalities of fingerprint and iris biometric are extracted and fused using different fusion techniques. The performance of different fusion techniques is evaluated and the Discrete Wavelet Transform fusion method is identified as the best. Then the best fused biometric template is watermarked into a cover image. The various watermarking techniques such as the Discrete Cosine Transform (DCT), Singular Value Decomposition (SVD) and Bacterial Foraging Optimization Algorithm (BFOA) are implemented to the fused biometric feature image. Performance of watermarking systems is compared using different metrics. It is found that the watermarked images are found robust over different attacks and they are able to reverse the biometric template for Bacterial Foraging Optimization Algorithm (BFOA) watermarking technique

Design and Analysis of an Intelligent Integrity Checking Watermarking Scheme for Ubiquitous Database Access

As a result of the highly distributed nature of ubiquitous database accessing, it is essential to develop security mechanisms that lend themselves well to the delicate properties of outsourcing databases integrity and copyright protection. Researchers have begun to study how watermarking computing can make ubiquitous databases accessing more confident work environments. One area where database context may help is in supporting content integrity. Initially, most of the research effort in this field was depending on distortion based watermark while the few remaining studies concentrated on distortion-free. But there are many disadvantages in previous studies; most notably some rely on adding watermark as an extra attributes or tuples, which increase the size of the database. Other techniques such as permutation and abstract interpretation framework require much effort to verify the watermark. The idea of this research is to adapt an optimized distortion free watermarking based on fake tuples that are embedded into a separate file not within the database to validate the content integrity for ubiquitous database accessing. The proposed system utilizes the GA, which boils down its role to create the values of the fake tuples as watermark to be the closest to real values. So that it's very hard to any attacker to guess the watermark. The proposed technique achieves more imperceptibility and security. Experimental outcomes confirm that the proposed algorithm is feasible, effective and robust against a large number of attacks

Watermarking Categorical Data : Algorithm and Robustness Analysis

The importance of watermarking digital databases has increased by leaps and bounds due to the high vulnerability of digital assets to piracy attempts when they traverse through the internet. To deter piracy, we propose a robust watermarking scheme for relational databases containing categorical data that resolves ownership issues. We propose a three-level security strategy. Firstly, the watermark is itself made secure using playfair cryptographic algorithm. Secondly, the database is securely partitioned using a primary key independent hash partitioning technique. This step virtually reorders the tuples before embedding. Thirdly, we entail a secret key based embedding process to ensure security. Linear feedback shift registers are implemented to generate pseudorandom numbers which selects different watermark bit index for each partition. The process of embedding does not produce any distortion in the database. Hence it is suitable for databases with categorical attributes containing sensitive information that cannot tolerate perturbations. Each watermark bit is embedded multiple times into different partitions. This makes the scheme highly robust against various attacks. The technique is proved by experimentally, and by theoretical analysis to be extremely robust. Experimental results show that it is 400 per cent resilient to subset addition attack, 100 per cent resilient to subset alteration attack, and 96 per cent resilient to tuple deletion attack. We prove analytically the resilience of the proposed technique against invertibility and additive attacks.Defence Science Journal, Vol. 65, No. 3, May 2015, pp.226-232, DOI: http://dx.doi.org/10.14429/dsj.65.844

Security Enhancement in Image Watermarking Using Combined Medium Sub-Band Wavelet Approach for Copyright Protection

Watermarking in multimedia content has secured attractive approaches in research society since nowadays the transmission of digital content in wireless medium has been enormous. Along with the distribution of digital content, it is important to claim ownership. A non-blind detection technique is proposed in this paper. First, an original image undergoes the wavelet decomposition such as LL1, LH1, HL1, and HH2. Afterward, the medium level sub-band coefficients of the image are subject to the comfortable shares for merging. Next, one of the shares from the LH1 band is merging with another one of the shares in HL1 band. In this stage, the copyright mark is fetched into the merged sub-band coefficients. Finally, an inverse wavelet transform  is applied to receive the watermarked image. To prove the authentication, the original image and the watermarked image undergo the same operation and acquire copyright information. Experimental results achieve that the proposed approach can withstand various image processing attacks

Data provenance with retention of reference relations

With the development of data transactions, data security issues have become increasingly important. For example, the copyright authentication and provenance of data have become the primary requirements for data security defence mechanisms. For this purpose, this paper proposes a data provenance system with retention of reference relations (called RRDP), which can enhance the security of data service in the process of publishing and transmission. The system model for data provenance with retention of reference relations adds virtual primary keys using reference relations between data tables. Traditional provenance algorithms have limitations on data types. This model has no such limitations. Added primary key is auto-incrementing integer number. Multi-level encryption is performed on the data watermarking to ensure the secure distribution of data. The experimental results show that the data provenance system with retention of reference relations has good accuracy and robustness of the provenance about common database attacks

HQR-Scheme: A High Quality and resilient virtual primary key generation approach for watermarking relational data

Most of the watermarking techniques designed to protect relational data often use the Primary Key (PK) of relations to perform the watermark synchronization. Despite offering high confidence to the watermark detection, these approaches become useless if the PK can be erased or updated. A typical example is when an attacker wishes to use a stolen relation, unlinked to the rest of the database. In that case, the original values of the PK lose relevance, since they are not employed to check the referential integrity. Then, it is possible to erase or replace the PK, compromising the watermark detection with no need to perform the slightest modification on the rest of the data. To avoid the problems caused by the PK-dependency some schemes have been proposed to generate Virtual Primary Keys (VPK) used instead. Nevertheless, the quality of the watermark synchronized using VPKs is compromised due to the presence of duplicate values in the set of VPKs and the fragility of the VPK schemes against the elimination of attributes. In this paper, we introduce the metrics to allow precise measuring of the quality of the VPKs generated by any scheme without requiring to perform the watermark embedding. This way, time waste can be avoided in case of low-quality detection. We also analyze the main aspects to design the ideal VPK scheme, seeking the generation of high-quality VPK sets adding robustness to the process. Finally, a new scheme is presented along with the experiments carried out to validate and compare the results with the rest of the schemes proposed in the literature

Abstracts of Papers, 79th Annual Meeting of the Virginia Academy of Science, May 22-25, 2001, James Madison University, Harrisonburg, Virginia

Abstracts of papers that were presented at the 79th Annual Meeting of the Virginia Academy of Science, May 22-25, 2001, James Madison University, Harrisonburg, Virginia