To see the other types of publications on this topic, follow the link: WATERMARKED DATABASE.
Journal articles on the topic 'WATERMARKED DATABASE'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'WATERMARKED DATABASE.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Lin, Chia-Chen, Thai-Son Nguyen, and Chin-Chen Chang. "LRW-CRDB: Lossless Robust Watermarking Scheme for Categorical Relational Databases." Symmetry 13, no. 11 (November 17, 2021): 2191. http://dx.doi.org/10.3390/sym13112191.
Full textAbstract:
In 2002, Agrawal and Kiernan defined six basic requirements, including preventing illegal watermark embedding and authentication, reversibility, robustness, and others, which must be satisfied when a reversible watermark is designed for relational databases. To meet these requirements, in this paper, a lossless watermarking scheme for a categorical relational database called LRW-CRDB (lossless robust watermarking for categorical relational databases) is proposed. In our LRW-CRDB scheme, the database owner needs to generate two secret embedding keys, K1 and K2, in advance. Then, two reference sets are generated based on two different secret embedding keys and a symmetry-based data hiding strategy, and then these are used for the watermark embedding phases. Experimental results confirmed that our LRW-CRDB scheme successfully detects 100% of hidden watermarks, even when more than 95% of the watermarked relational database has been deleted. In other words, the robustness of our proposed LRW-CRDB scheme outperforms other existing schemes under a variety of possible attacks, such as alteration, sorting, deletion, and mix-match attacks.
2
Hsieh, Shang-Lin, Chun-Che Chen, and Wen-Shan Shen. "Combining Digital Watermarking and Fingerprinting Techniques to Identify Copyrights for Color Images." Scientific World Journal 2014 (2014): 1–14. http://dx.doi.org/10.1155/2014/454867.
Full textAbstract:
This paper presents a copyright identification scheme for color images that takes advantage of the complementary nature of watermarking and fingerprinting. It utilizes an authentication logo and the extracted features of the host image to generate a fingerprint, which is then stored in a database and also embedded in the host image to produce a watermarked image. When a dispute over the copyright of a suspect image occurs, the image is first processed by watermarking. If the watermark can be retrieved from the suspect image, the copyright can then be confirmed; otherwise, the watermark then serves as the fingerprint and is processed by fingerprinting. If a match in the fingerprint database is found, then the suspect image will be considered a duplicated one. Because the proposed scheme utilizes both watermarking and fingerprinting, it is more robust than those that only adopt watermarking, and it can also obtain the preliminary result more quickly than those that only utilize fingerprinting. The experimental results show that when the watermarked image suffers slight attacks, watermarking alone is enough to identify the copyright. The results also show that when the watermarked image suffers heavy attacks that render watermarking incompetent, fingerprinting can successfully identify the copyright, hence demonstrating the effectiveness of the proposed scheme.
3
Chang, Chin-Chen, Thai-Son Nguyen, and Chia-Chen Lin. "A Blind Reversible Robust Watermarking Scheme for Relational Databases." Scientific World Journal 2013 (2013): 1–12. http://dx.doi.org/10.1155/2013/717165.
Full textAbstract:
Protecting the ownership and controlling the copies of digital data have become very important issues in Internet-based applications. Reversible watermark technology allows the distortion-free recovery of relational databases after the embedded watermark data are detected or verified. In this paper, we propose a new, blind, reversible, robust watermarking scheme that can be used to provide proof of ownership for the owner of a relational database. In the proposed scheme, a reversible data-embedding algorithm, which is referred to as “histogram shifting of adjacent pixel difference” (APD), is used to obtain reversibility. The proposed scheme can detect successfully 100% of the embedded watermark data, even if as much as 80% of the watermarked relational database is altered. Our extensive analysis and experimental results show that the proposed scheme is robust against a variety of data attacks, for example, alteration attacks, deletion attacks, mix-match attacks, and sorting attacks.
4
Thanki, Rohit, Surekha Borra, and Ashish Kothari. "Fragile Watermarking Framework for Tamper Detection of Color Biometric Images." International Journal of Digital Crime and Forensics 13, no. 2 (March 2021): 35–56. http://dx.doi.org/10.4018/ijdcf.2021030103.
Full textAbstract:
Application of fragile watermarking on biometric images stored at a server or cloud ensures proper authentication and tamper detection when access to the servers was shared. In this paper, a hybrid domain fragile watermarking technique for authenticity of color biometric images, using hybridization of various transforms such as discrete cosine transform (DCT), fast discrete curvelet transform (FDCuT), and singular value decomposition (SVD) is proposed. The hybrid transform coefficients are modified according to the scrambled color watermark to obtain watermarked color biometric image. The security of this technique is strengthened with the usage of Arnold scrambling, and by using multiple secret keys. The proposed technique is analyzed on FEI Brazilian face database. The experimental results show that this technique performs better than the existing fragile watermarking techniques.
5
RM, Deepa. "Database Security with Fingerprint Masking." International Journal for Research in Applied Science and Engineering Technology 10, no. 7 (July 31, 2022): 3191–96. http://dx.doi.org/10.22214/ijraset.2022.45769.
Full textAbstract:
Abstract: Information in numerous areas including medication, business, and science wasso crucial, in which directories are utilized efficiently for information sharing.Nevertheless, the directories confront the danger to be pirated, taken or even misused, which might lead to many of protection risks regarding ownership rights, informationtampering as well as secrecy safeguards. Watermarking is the technology which is used to secure the database from the various attacks.It is also used to hide the content from the un authorized users. The majority of state-of-the- art techniques alter the initial information to a big level, lead to information quality wreckage,and then can't attain balance that is good between robustness from malicious strikes as well as information restoration. we suggest a reversible and robust watermarking method with Genetic Algorithm and Histogram ShiftingWatermarking (GAHSW) to relation the numerical data. This algorithm used to get the unique key for the database as well as the watermarked place. Experimental evaluation show the usefulness and methods within theterminology of robustness from malicious strikes as well as upkeep of information quality.We have achieved the security level on comparing with existing system
6
Sankpal, Priya R., and P. A. Vijaya. "Performance Evaluation of Nested Watermarked Scheme using Objective Image Quality Metrics." Journal of University of Shanghai for Science and Technology 23, no. 06 (June 7, 2021): 306–14. http://dx.doi.org/10.51201/jusst/21/05273.
Full textAbstract:
In this digital era, extensive usage of the internet has resulted in images being subjected to various distortions during processing and transmitting over open networks. For watermarking applications, watermarked image quality is evaluated in comparison to the original image. In the last decade literature, many performance metrics have been used, comprising of both subjective and objective quality metrics. The subjective image quality metrics are generally time-consuming and expensive in contrast to objective image quality metrics. This paper attempted an investigation for measuring the performance of nested watermarking schemes and objective image quality metrics which included Peak Signal to Noise Ratio (PNSR), Mean Square Error (MSE), Correlation Coefficient (CC), Normalized Correlation Coefficient (NCC), and Structural Similarity Index (SSIM). For the proposed nested watermarking method, these objective image quality metrics were evaluated using a combination of Discrete Wavelet Transforms (DWT) and Singular values (SVD) in the four frequency bands. Performance of objective metrics can be judged based on their sensitiveness to watermarking artifacts. It is clear from the results obtained, for most watermarking applications SSIM provides better insight into the performance of the algorithm used whereas PNSR fails for certain watermark artifacts. The findings drawn in this paper are based on the experimentation of a nested watermarking algorithm using a DICOM image database.
7
Lee, Yong-Joon, and Won-Shik Na. "E-Passport Advanced Security Technique Using Biometric Information Watermarking." Journal of Computational and Theoretical Nanoscience 18, no. 5 (May 1, 2021): 1540–49. http://dx.doi.org/10.1166/jctn.2021.9614.
Full textAbstract:
There has been significant research in security of e-passport. E-passport combine the security technologies such as smartcard, PKI, and biometric, so that these technologies can prevent unauthorized copies and counterfeits. We propose an e-passport security technology in which biometric watermarking is used to prevent the copy of biometric information in the e-passport. The biometric watermarking embeds the invisible date of acquisition into the original data so that the human visual system cannot perceive its invisibly watermarked information. Then the biometric sample, having its unauthorized copy, is retrieved at the moment of reading the e-passport from the issuing database. The previous e-passport security technology placed an emphasis on both access control readers and anti-cloning chip features, and it is expected that the proposed feature, copy protection of biometric information, will be demanded as the cases of biometric recognition to verify personal identity information has increased. This study proposed test results through issuing and deciphering of watermarks for e-passports, and it is expected that it can be used as standards for protecting biometric information.
8
Lee, Yong-Joon, and Won-Shik Na. "E-Passport Advanced Security Technique Using Biometric Information Watermarking." Journal of Computational and Theoretical Nanoscience 18, no. 5 (May 1, 2021): 1540–49. http://dx.doi.org/10.1166/jctn.2021.9614.
Full textAbstract:
There has been significant research in security of e-passport. E-passport combine the security technologies such as smartcard, PKI, and biometric, so that these technologies can prevent unauthorized copies and counterfeits. We propose an e-passport security technology in which biometric watermarking is used to prevent the copy of biometric information in the e-passport. The biometric watermarking embeds the invisible date of acquisition into the original data so that the human visual system cannot perceive its invisibly watermarked information. Then the biometric sample, having its unauthorized copy, is retrieved at the moment of reading the e-passport from the issuing database. The previous e-passport security technology placed an emphasis on both access control readers and anti-cloning chip features, and it is expected that the proposed feature, copy protection of biometric information, will be demanded as the cases of biometric recognition to verify personal identity information has increased. This study proposed test results through issuing and deciphering of watermarks for e-passports, and it is expected that it can be used as standards for protecting biometric information.
9
Zainal, Nasharuddin, Seri Mastura Mustaza, and Wan Noormaheran Wan Hussin. "Image Watermarking Technique for Digital Al-Quran based on Fibonacci Transform via DWT." Jurnal Kejuruteraan 34, no. 3 (May 30, 2022): 485–93. http://dx.doi.org/10.17576/jkukm-2022-34(3)-15.
Full textAbstract:
Advent growth in information and communication technologies has accelerated the needs to secure digital media. Demands for digital media when on the move urged Quran readers to install the Quran mobile apps on their device. However, there is no secure mechanism to legalize its content credential. On the other hand, mobile developer finds difficulty in getting access to readily authentic Quran database sources. Malaysia government has introduced Smart Quran mobile apps without any counterfeit protection. Correspondingly, the contents are vulnerable to hacking, falsification which consequently endangering Islamic institutional prestige. There is also a lack of credible authorization institutions to verify authenticity of the digital Quran that could possibly deviate the Muslim faith by reciting falsified content and meaning. To fill the void, this paper explores the utilization of an image watermarking to preserve the Quran digital image. The study presents new blind RGB image watermarking using Fibonacci Transform via Discrete Wavelet Transform (DWT) and manipulates the R component of the Al-Quran image. The second level of LL decomposition of the cover image will then be substituted by the Fibonacci-transformed watermarked version. DWT embedding is achieved through alpha blending technique. Final watermarked image is obtained once RGB conversion is performed. The efficiency of the method is assessed towards 10 samples. Verification is conducted via the extraction of the endorsed license image. The results demonstrate enhanced robustness and imperceptibility with average PSNR and SSIM of 92.13 dB and 0.99 respectively. Forgery cases of digital Quran applications are therefore tackled.
10
Li, Yan, Junwei Wang, and Xiangyang Luo. "A reversible database watermarking method non-redundancy shifting-based histogram gaps." International Journal of Distributed Sensor Networks 16, no. 5 (May 2020): 155014772092176. http://dx.doi.org/10.1177/1550147720921769.
Full textAbstract:
In relational databases, embedding watermarks in integer data using traditional histogram shifting method has the problem of large data distortion. To solve this problem, a reversible database watermarking method without redundant shifting distortion is proposed, taking advantage of a large number of gaps in the integer histogram. This method embeds the watermark bit by bit on the basis of grouping. First, an integer data histogram is constructed with the absolute value of the prediction error of the data as a variable. Second, the positional relationship between each column and the gap in the histogram is analyzed to find out all the columns adjacent to the gap. Third, the highest column is selected as the embedded point. Finally, a watermark bit is embedded on the group by the histogram non-redundant shifting method. Experimental results show that compared with existing reversible database watermarking methods, such as genetic algorithm and histogram shift watermarking and histogram gap–based watermarking, the proposed method has no data distortion caused by the shifting redundant histogram columns after embedding watermarks on forest cover type data set and effectively reduces the data distortion rate after embedding watermarks.
11
Li, Yuancheng, Longqiang Ma, and Xiang Li. "IDR Privacy Protection Based on Database Digital Watermarking." Recent Advances in Electrical & Electronic Engineering (Formerly Recent Patents on Electrical & Electronic Engineering) 13, no. 1 (February 20, 2020): 110–18. http://dx.doi.org/10.2174/2352096511666181119125538.
Full textAbstract:
Background: In smart grid, a flexible demand response management mechanism is used to achieve the purpose of stabilizing the power grid, optimizing the power market, and rationally allocating resources. There are two types of demand response management in the demand response management mechanism: Price-based Demand Response (PDR) and Incentive-based Demand Response (IDR). Methods: The paper studied the problem of privacy protection in IDR, and proposed a method based on database digital watermark to protect user privacy. Segment the time, and then embed watermarks in the user’s consumption data of each time segment. At the end of each billing period, extract the watermarks from the data of each segment time, and then send the total consumption data of the user of this billing period to the power supply company. The power supply company only knows the total consumption data of the user, the company does not have any information regarding the users consumption data which can prevent them from snooping the user privacy. The proposed digital watermarking algorithm is based on K-Means clustering and wavelet transform, the K-Means algorithm is used to cluster the database tuple data, and then wavelet transform is carried out on the available attribute values within the clusters, and the watermark is embedded in the transformed attribute values. Results: The experimental results show that the proposed method is more robust when the database is under subset deletion attacks, subset substitution attacks and subset addition attacks. Besides, the computational cost is very low. Conclusion: The proposed digital watermark algorithm can embed the watermarks more decently and overcome the burden of watermark embedding caused by statistical feature control. Besides, the proposed method can protect the user privacy better than the other two methods.
12
Li, Zhi Ping, Chuan Xian Jiang, and Zhi Li. "A New Watermarking Algorithm for Relational Database Copyright Protection." Applied Mechanics and Materials 385-386 (August 2013): 1713–17. http://dx.doi.org/10.4028/www.scientific.net/amm.385-386.1713.
Full textAbstract:
In order to enhance the robustness of database watermark, a watermarking algorithm for relational database copyright protection is proposed. Some types of data are selected from the relational database according to filtering rules, and two-dimension signal is formed. Then, the watermarking is embedded into the wavelet domain of two-dimension signal. We analyze that the wavelet high frequency coefficients of corresponding data follow the Gauss distribution and give the definition of the intensive factor. Employing the linear correlation detecting method, we can embed the watermark successfully in wavelet domain. The watermark can be distributed to different parts of the relational database. Experimental results show that the embedded digital watermarks with the proposed algorithm are invisible and some degree of robustness against the commonly used database processing techniques.
13
Varghese, Justin, Omer Bin Hussain, Saudia Subash, and Abdul Razak T. "An effective digital image watermarking scheme incorporating DCT, DFT and SVD transformations." PeerJ Computer Science 9 (July 10, 2023): e1427. http://dx.doi.org/10.7717/peerj-cs.1427.
Full textAbstract:
Image watermarking prevents copyright infringements by attaching visible/invisible watermark images as authentication identities in the owner’s documents. The article made analysis on the advantages of different transformations for choosing better combinations to make the watermark embedding process and observed that watermarking techniques incorporating discrete cosine transform (DCT) provide better resistance towards JPEG based potential attacks, discrete Fourier transform (DFT) has strong energy compaction with geometrical invariance properties to resist geometric attacks while singular value decomposition (SVD) provides stability, proportion invariance and rotation invariance properties and it provides strong resistance against noise based attacks. Considering these advantages of different transformations, the article presents a new non-blind watermarking algorithm by utilizing advantages of DFT, DCT and SVD transforms while attaching secret contents in cover images. The algorithm starts by applying DFT followed by onion peel decomposition (OPD) for decomposing Fourier domain carrier image to four frequency sub images. The scheme then applies DCT on the frequency bands and orders them in zigzag fashion to form four individual frequency arrays. In the final step of embedding process, it embeds four copies of watermark singular value contents in DFT domain with the carrier image singular value contents to produce the watermarked image. The experimental results based on subjective and objective metrics on various test images from standard image databases with different test conditions demarcate the stability of new algorithm in producing high quality watermarked images with fewer distortions even when the watermarked images are extremely distorted by potential attacks.
14
Camara, Lancine, Junyi Li, Renfa Li, and Wenyong Xie. "Distortion-Free Watermarking Approach for Relational Database Integrity Checking." Mathematical Problems in Engineering 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/697165.
Full textAbstract:
Nowadays, internet is becoming a suitable way of accessing the databases. Such data are exposed to various types of attack with the aim to confuse the ownership proofing or the content protection. In this paper, we propose a new approach based on fragile zero watermarking for the authentication of numeric relational data. Contrary to some previous databases watermarking techniques which cause some distortions in the original database and may not preserve the data usability constraints, our approach simply seeks to generate the watermark from the original database. First, the adopted method partitions the database relation into independent square matrix groups. Then, group-based watermarks are securely generated and registered in a trusted third party. The integrity verification is performed by computing the determinant and the diagonal’s minor for each group. As a result, tampering can be localized up to attribute group level. Theoretical and experimental results demonstrate that the proposed technique is resilient against tuples insertion, tuples deletion, and attributes values modification attacks. Furthermore, comparison with recent related effort shows that our scheme performs better in detecting multifaceted attacks.
15
Boostani, R., and M. Sabeti. "MULTI-CHANNEL ECG-BASED STEGANOGRAPHY." Biomedical Engineering: Applications, Basis and Communications 30, no. 06 (November 29, 2018): 1850046. http://dx.doi.org/10.4015/s1016237218500461.
Full textAbstract:
There is a growing tendency for the concealment of secure information into electrocardiogram (ECG) signals in a way that the embedded ECGs still remain diagnosable. The average length of ECG recording for a primary diagnosis takes no longer than 1[Formula: see text]min yielding to limit its concealment capacity. To overcome this drawback, we enhanced both concealment capacity and embedding quality by: (I) using 12-lead ECGs to span more embedding space, (II) shuffling input message bits via nonlinear feedback shift register (NLFSR) method, (III) inserting the selected bits of each channel into the high-frequency wavelet coefficients of non-QRS parts. Inserting the message bits into high frequency coefficients of less important ECG parts leads to preserve the quality watermarked ECGs. To assess the proposed method, a text containing different letters (changes with size of both non-QRS segments and high-frequency sub-band) was hidden through 12-lead ECG signals of 56 randomly selected subjects of PTB database, where each signal length is 10[Formula: see text]s. The performance was compared to state-of-the-art ECG-based steganography schemes in terms of the following criteria: percentage residual difference (PRD), peak signal to noise ratio (PSNR), structural similarity index measure (SSIM) and bit error rate (BER). Our results showed that the proposed scheme has benefits of fast computing along with secure embedding, providing high capacity of data hiding.
16
Kumar, Manoj, and O. P. Verma. "Content characteristics based robust watermarking for relational database: a new approach to database security." International Journal of Engineering & Technology 7, no. 1.9 (March 1, 2018): 234. http://dx.doi.org/10.14419/ijet.v7i1.9.10003.
Full textAbstract:
Digital data such as text, relational database, audio, video and software are intellectual property of creators/ writers/owners. The database services have become easily available and economical since the booming of internet. However, their outsourcing through the internet accompanies multiple threats like copying, modifying as well as unauthorized distribution. Relational Database has a wide-spread use in many real-life applications, hence, it is essential to maintain integrity and provide copyright protection. To counter the threats, watermarking techniques have been playing a vital role since the last decade. As a security measure, Relational Database Watermarking is becoming more popular and strengthened day-by-day. This is also one of the upcoming areas of interest among researchers of the Database Security. A technique earlier used for Image Watermarking is applied to watermark Relational Databases. In Image Watermarking technique, a pixel or a pair of pixels must satisfy certain characteristics. Usually, database watermarking techniques concentrate on hiding a watermark in database. Extraction and matching of hidden watermark with original watermark confirms ownership of database. This paper demonstrates the use of image watermarking technique for relational databases. Here we align some properties of attributes of database by changing some bit(s) in attribute value. Using secret key, we have ensured that values of two attributes of a tuples satisfy some bit-similarity property and to do so, we slightly alter values of attributes. Detection of such characteristic in a database using secret key can be done easily to verify the presence of a watermark.
17
Kumar, Manoj, and O. P. Verma. "Content Characteristics Based Robust Watermarking for Relational Database: A New Approach to Database Security." International Journal of Engineering & Technology 7, no. 1.9 (March 1, 2018): 302. http://dx.doi.org/10.14419/ijet.v7i1.9.12694.
Full textAbstract:
Digital data such as text, relational database, audio, video and software are intellectual property of creators/ writers/owners. The database services have become easily available and economical since the booming of internet. However, their outsourcing through the internet accompanies multiple threats like copying, modifying as well as unauthorized distribution. Relational Database has a wide-spread use in many real-life applications, hence, it is essential to maintain integrity and provide copyright protection. To counter the threats, watermarking techniques have been playing a vital role since the last decade. As a security measure, Relational Database Watermarking is becoming more popular and strengthened day-by-day. This is also one of the upcoming areas of interest among researchers of the Database Security. A technique earlier used for Image Watermarking is applied to watermark Relational Databases. In Image Watermarking technique, a pixel or a pair of pixels must satisfy certain characteristics. Usually, database watermarking techniques concentrate on hiding a watermark in database. Extraction and matching of hidden watermark with original watermark confirms ownership of database. This paper demonstrates the use of image watermarking technique for relational databases. Here we align some properties of attributes of database by changing some bit(s) in attribute value. Using secret key, we have ensured that values of two attributes of a tuples satisfy some bit-similarity property and to do so, we slightly alter values of attributes. Detection of such characteristic in a database using secret key can be done easily to verify the presence of a watermark.
18
Mazhar, Mohammed, and Rajesh Dhakad. "Survey on Relational Database Watermarking Employing Evolutionary Methods." Journal of Information Technology and Sciences 9, no. 1 (January 16, 2023): 13–29. http://dx.doi.org/10.46610/joits.2023.v09i01.003.
Full textAbstract:
Ownership control, integrity, and tamper-proofing of relational data are essential concerns that must be addressed as the communication (network) system grows. Over the past several years, a plethora of potential solutions has been proposed to address these issues (including cryptography, steganography, digital signatures, watermarks, and many others). Digital watermarking (comparatively new) is a technology that aids in the resolution of issues such as data theft, authenticity, and copyright claims. This paper’s primary contributions are as follows: 1) Examine evolutionary algorithm-based watermarking in relational databases that provide optimize data encoding space in search space which provides high robustness and imperceptibility. 2) Examine contemporary database watermarking strategies based on evolutionary algorithms for high embedding capacity and watermark bit insertion. 3) Malicious agent tracing through cluster-based (mainly fuzzy c-mean clustering algorithm or based on a hash function) or multiple watermarking approaches over shared or collaborative networks. This article focuses on watermarking numeric relational databases for authentication and integrity. Also provide a brief overview of the development of relational database watermarking and emergence, its characteristics and application, and the popular research methods currently in use. In addition, gist on various possible attacks. At last, this paper suggests directions for further research in these areas. Researchers can use the findings of this study to build secure watermarking methods for databases.
19
Joyce, S., and S. Veni. "Iris Biometric Watermarking for Authentication Using Multiband Discrete Wavelet Transform and Singular-Value Decomposition." International journal of electrical and computer engineering systems 14, no. 3 (March 28, 2023): 259–66. http://dx.doi.org/10.32985/ijeces.14.3.3.
Full textAbstract:
The most advanced technology, watermarking enables intruders to access the database. Various techniques have been developed for information security. Watermarks and histories are linked to many biometric techniques such as fingerprints, palm positions, gait, iris and speech are recommended. Digital watermarking is the utmost successful approaches among the methods available. In this paper the multiband wavelet transforms and singular value decomposition are discussed to establish a watermarking strategy rather than biometric information. The use of biometrics instead of conservative watermarks can enhance information protection. The biometric technology being used is iris. The iris template can be viewed as a watermark, while an iris mode of communication may be used to help information security with the addition of a watermark to the image of the iris. The research involves verifying authentication against different attacks such as no attacks, Jpeg Compression, Gaussian, Median Filtering and Blurring. The Algorithm increases durability and resilience when exposed to geometric and frequency attacks. Finally, the proposed framework can be applied not only to the assessment of iris biometrics, but also to other areas where privacy is critical.
20
Yao, Xiao Ming, Hong Yu Chen, Hong Lei Li, and Xiao Yi Zhou. "Tamper Detection in RFID Tags Using Zero-Watermarks." Applied Mechanics and Materials 511-512 (February 2014): 169–72. http://dx.doi.org/10.4028/www.scientific.net/amm.511-512.169.
Full textAbstract:
Recently data integrity issues of applications based on radio frequency identification (RFID) have drawn great concerns worldwide and many watermarking-based schemes have been proposed. While those schemes can effectively verify if the protected tag data be modified, they also expose both the protected data and the watermark to any adversaries. In this paper, we present a zero-watermark scheme, which stores the watermark not in part of the data fields of RFID tags but in the back-end database system or that of a trusted third party without any modification of the original RFID data. The novelty of this zero-watermark scheme lies in the fact that we extend the zero-watermark technology to the RFID tags and the use of data tampering from the limited applications of copyright protection of digital works. We term this scheme ZMark-TamDetect because it is a tamper detection solution using zero-watermarks, which is so designed that it can be easily plugged into existing RFID middleware applications. This proposal is one of the first works that integrates zero-watermark and RFID technologies together and it provides a detailed theoretical foundation for the ZMark-TamDetect.
21
Li, Yan, Junwei Wang, and Hongyong Jia. "A Robust and Reversible Watermarking Algorithm for a Relational Database Based on Continuous Columns in Histogram." Mathematics 8, no. 11 (November 8, 2020): 1994. http://dx.doi.org/10.3390/math8111994.
Full textAbstract:
Due to the discreteness of integer data, there are a large number of gaps and continuous columns in the histogram based on integer data. Aiming at the characteristics, this paper presents a robust and reversible watermarking algorithm for a relational database based on continuous columns in histogram. Firstly, it groups the database tuples according to the watermark length and the grouping key. Secondly, it calculates the prediction errors and uses the absolute values of the prediction errors to construct the histogram. Thirdly, it traverses the histogram to find all the continuous columns and in turn, computes the sum of the height of each continuous column and selects the group of continuous columns that has the largest sum as the positions to embed the watermarks. FCTD (Forest cover type data set) is utilized for experimental verification. A large amount of experimental data shows that the method is effective and robust. Not only does the data distortion caused by shifting histogram columns not exist, but the robustness of the watermark is also greatly improved.
22
Ji, Guang Cui, Zhen Rong Lin, and Jian Min Li. "A Watermarking Algorithm for Relational Database Based on Image." Advanced Materials Research 301-303 (July 2011): 661–65. http://dx.doi.org/10.4028/www.scientific.net/amr.301-303.661.
Full textAbstract:
According to the particularity of relational databases, a new watermarking relational database based on image is proposed combined with the existing digital watermarking technique. Watermark image is scrambled using Arnold transform first, and then numeric attributes satisfying the requirement of the effective bits in relational database are partitioned using the K-Means algorithm, at last the binary 3-bit-set sequences of watermark image are embedded into the clusters. Experiment indicates that the algorithm possesses better robustness and invisibility and better practical value.
23
Imamoglu, Mustafa Bilgehan, Mustafa Ulutas, and Guzin Ulutas. "A New Reversible Database Watermarking Approach with Firefly Optimization Algorithm." Mathematical Problems in Engineering 2017 (2017): 1–14. http://dx.doi.org/10.1155/2017/1387375.
Full textAbstract:
Up-to-date information is crucial in many fields such as medicine, science, and stock market, where data should be distributed to clients from a centralized database. Shared databases are usually stored in data centers where they are distributed over insecure public access network, the Internet. Sharing may result in a number of problems such as unauthorized copies, alteration of data, and distribution to unauthorized people for reuse. Researchers proposed using watermarking to prevent problems and claim digital rights. Many methods are proposed recently to watermark databases to protect digital rights of owners. Particularly, optimization based watermarking techniques draw attention, which results in lower distortion and improved watermark capacity. Difference expansion watermarking (DEW) with Firefly Algorithm (FFA), a bioinspired optimization technique, is proposed to embed watermark into relational databases in this work. Best attribute values to yield lower distortion and increased watermark capacity are selected efficiently by the FFA. Experimental results indicate that FFA has reduced complexity and results in less distortion and improved watermark capacity compared to similar works reported in the literature.
24
Liu, Yi, and Juan Wang. "DWT Based Blind Watermark in Relational Database." Advanced Materials Research 760-762 (September 2013): 2123–28. http://dx.doi.org/10.4028/www.scientific.net/amr.760-762.2123.
Full textAbstract:
Aiming to balance the robustness and imperceptibility of database watermark, propose a wavelet transform (DWT) based blind watermarking algorithm. The algorithm screens candidate attributes that can be embedded watermark and conducts subset segmentation and rearrangement, and then performs DWT transformation to the data subsets and the scrambled watermark image respectively. Embed the compressed low-frequency part of the watermark into the High-frequency part of the data set to achieve data fusion. Theoretical analysis and experiments show that the algorithm enjoys strong robustness and good invisibility.
25
Xian, Hequn, Jing Li, and Xiuqing Lu. "Tracing Mobile Database with Complex Watermark." International Journal of Database Theory and Application 8, no. 1 (February 28, 2015): 23–28. http://dx.doi.org/10.14257/ijdta.2015.8.1.03.
Full text
26
Khatatneh, Khalaf, Ashraf Odeh, Ashraf Mashaleh, and Hind Hamadeen. "Secure Digital Databases using Watermarking based on English-Character Attributes." Recent Advances in Computer Science and Communications 13, no. 3 (August 12, 2020): 477–81. http://dx.doi.org/10.2174/2213275912666190103142858.
Full textAbstract:
Introduction: The single space and the double space (DS). In this procedure, an image is used to watermark a digital database, where the image bytes are divided into binary strings that block the text attributes of the selected database, we proposed an algorithm to defend against four common database attacks. Objective: Perform the watermark is Embedding and makes extraction of the watermark. We also describe the principal of the Embedding and extraction the watermark. Methods: The procedure to extract the watermark does not require knowledge of the original database that does not carry the same watermark. This feature is extremely important because it allows the discovery of a watermark in a copy of the original database, regardless of the subsequent updates to the asset. The extraction procedure is a direct reflection of the procedure used to embed the watermark is six steps. Results: Using new algorithm ability to develop a database watermark that would make it difficult for an attacker to remove or change the watermark without discovering the value of the object. To be judged effective, the database algorithm had to be able to create a strong enough watermark that could sustain the security of the database in the face of the following four types of attack: deletion of a sub-dataset, addition of a sub-dataset. Conclusion: The performance of the proposed algorithm was assessed in respect of its ability to defend the database against four common attacks for all tuples selection.
27
Han, Yin Dan, and Jiang Feng Xu. "A New Relational Database Watermarking Algorithm Based on Chaos." Advanced Materials Research 971-973 (June 2014): 1485–90. http://dx.doi.org/10.4028/www.scientific.net/amr.971-973.1485.
Full textAbstract:
This paper proposed a new database watermarking algorithm based on a numerical attribute of database. Firstly, the copyright image was encrypted by a chaotic system to produce a binary sequence as the watermark signal. Then it used two hash functions to realize the watermark embedding. The first hash value was calculated by using the connection value of the key and the primary key. Then it filtered out the tuples whose corresponding hash value was even. The second double-hash value was calculated by using the connection of the key and the first hash value, which was used to label tuples and partition tuples. The first hash value was used as a control signal to adjust the parity of the candidate attribute bit when the watermark was embedded. Theoretical analysis and experimental results indicate that the algorithm reduces the amount of embedding watermark and improves the robustness and security of the watermark.
28
SagarV, Ramani. "Watermark based Copyright Protection for Relational Database." International Journal of Computer Applications 78, no. 2 (September 18, 2013): 22–28. http://dx.doi.org/10.5120/13462-0713.
Full text
29
Khanduja, Vidhi. "Dynamic Watermark Injection in NoSQL Databases." Journal of Computer Science Applications and Information Technology 2, no. 1 (January 2, 2017): 1–5. http://dx.doi.org/10.15226/2474-9257/2/1/00108.
Full text
30
Kamel, Ibrahim, Maha AlaaEddin, Waheeb Yaqub, and Kareem Kamel. "Distortion-free fragile watermark for relational databases." International Journal of Big Data Intelligence 3, no. 3 (2016): 190. http://dx.doi.org/10.1504/ijbdi.2016.078410.
Full text
31
Zhang, Ye Hong, Zhi Xian Gao, and Dong Xian Yu. "Speech Algorithm for Watermarking Relational Databases Based on Weighted." Advanced Materials Research 121-122 (June 2010): 399–404. http://dx.doi.org/10.4028/www.scientific.net/amr.121-122.399.
Full textAbstract:
We enunciate the need for watermarking database relations to deter data piracy, identify the characteristics of relational data that pose unique challenges for watermarking. This paper creatively proposes a novel method for watermarking relational database, which uses speech signal as watermark embed into database according to the weight of attributes. Experimental results show that the proposed scheme is robust against various forms of attacks. Our approach is more intuitive, and it support easy watermark identification.
32
ZHU, Qin. "Digital watermark-based authentication of queries in outsourced database." Journal of Computer Applications 28, no. 3 (March 20, 2008): 605–8. http://dx.doi.org/10.3724/sp.j.1087.2008.00605.
Full text
33
Liu, Yi, and Si Yu Lai. "Use of Watermark in Educational Administration System." Advanced Materials Research 760-762 (September 2013): 2129–34. http://dx.doi.org/10.4028/www.scientific.net/amr.760-762.2129.
Full textAbstract:
With the widespread use of watermark in video, audio and image, propose a relational database based watermark embedding and extraction method. The algorithm utilizes the singlemultiple mapping approach to plug in watermark, which scatter the distribution of watermark information and enhance the anti-attack ability of the algorithm. The experiments show that the method enjoys strong robustness to such attacks as tuples resorting, subset selection and so on.
34
Ahmed, Ismail Taha, Baraa Tareq Hammad, and Norziana Jamil. "Common Gabor Features for Image Watermarking Identification." Applied Sciences 11, no. 18 (September 8, 2021): 8308. http://dx.doi.org/10.3390/app11188308.
Full textAbstract:
Image watermarking is one of many methods for preventing unauthorized alterations to digital images. The major goal of the research is to find and identify photos that include a watermark, regardless of the method used to add the watermark or the shape of the watermark. As a result, this study advocated using the best Gabor features and classifiers to improve the accuracy of image watermarking identification. As classifiers, discriminant analysis (DA) and random forests are used. The DA and random forest use mean squared energy feature, mean amplitude feature, and combined feature vector as inputs for classification. The performance of the classifiers is evaluated using a variety of feature sets, and the best results are achieved. In order to assess the performance of the proposed method, we use a public database. VOC2008 is a public database that we use. The findings reveal that our proposed method’s DA classifier with integrated features had the greatest TPR of 93.71 and the lowest FNR of 6.29. This shows that the performance outcomes of the proposed approach are consistent. The proposed method has the advantages of being able to find images with the watermark in any database and not requiring a specific type or algorithm for embedding the watermark.
35
Khan, Aihab, and Syed Afaq Husain. "A Fragile Zero Watermarking Scheme to Detect and Characterize Malicious Modifications in Database Relations." Scientific World Journal 2013 (2013): 1–16. http://dx.doi.org/10.1155/2013/796726.
Full textAbstract:
We put forward a fragile zero watermarking scheme to detect and characterize malicious modifications made to a database relation. Most of the existing watermarking schemes for relational databases introduce intentional errors or permanent distortions as marks into the database original content. These distortions inevitably degrade the data quality and data usability as the integrity of a relational database is violated. Moreover, these fragile schemes can detect malicious data modifications but do not characterize the tempering attack, that is, the nature of tempering. The proposed fragile scheme is based on zero watermarking approach to detect malicious modifications made to a database relation. In zero watermarking, the watermark is generated (constructed) from the contents of the original data rather than introduction of permanent distortions as marks into the data. As a result, the proposed scheme is distortion-free; thus, it also resolves the inherent conflict between security and imperceptibility. The proposed scheme also characterizes the malicious data modifications to quantify the nature of tempering attacks. Experimental results show that even minor malicious modifications made to a database relation can be detected and characterized successfully.
36
Rábai, Krisztina. "Jagellonian Ledgers as Sources for Watermark Research and Paper History Studies: The First Papermills of East-Central Europe." Średniowiecze Polskie i Powszechne 12 (December 16, 2020): 324–40. http://dx.doi.org/10.31261/spip.2020.16.14.
Full textAbstract:
This study is based on the analysis of the paper and the text of royal and princely accounts in which scribes registered the everyday incomes and expenditures of four Jagiellonian courts, located in different parts of East-Central Europe around the turn of the 15th and 16th-century. The period covers the establishment and the very first years of paper mills in Silesia and the Polish Kingdom. Regarding the lack of archival sources preserving the foundation and running of these mills, the cradles of paper-making in East-Central Europe, one should use many different and quite laconic written sources to shed light upon these revolutionary years. Although accounts could preserve mentions of purchasing, trading and using paper, in most cases the textual information is not adequate to reconstruct a detailed and clear image of paper producing; researchers should examine the medium of writing - the paper - itself. Instead of the investigation of single sheets, folded papers, small notebooks and bound books such as accounts proved to be more useful. One can compare the sheets of the volumes and find those traces which lead to the paper mills, the places of their origin. Through the detailed examination of one especially complex and interesting ledger from the courts of Prince Sigismund, the author attempts to demonstrate the opportunities lay in watermark studies. Furthermore, the article purposes to reflect on the huge hiatus clearly perceptible on the field of watermark research and paper history in East-Central Europe and the necessity of developing a database of watermarks reflecting on the history of paper-making in this region.
37
Han, Ai Xia, and Yan Chen. "Research on Database Watermarking Algorithm Based on Genetic Algorithm." Applied Mechanics and Materials 687-691 (November 2014): 1297–99. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.1297.
Full textAbstract:
With the rapid development of network information technology, much attention has been paid to the database content security problems,such as how to prevent data theft, illegal copying, certification of copyright, etc. In order to protect the database copyright, digital watermarking technology is becoming a new research hotspot. In this paper, first of all, on the basis of summary current development of data and database watermarking technology, and then introduces genetic algorithm in data watermark technology, finally validates the effectiveness of the model with an example.
38
Gu, Wei, Ching-Chun Chang, Yu Bai, Yunyuan Fan, Liang Tao, and Li Li. "Anti-Screenshot Watermarking Algorithm for Archival Image Based on Deep Learning Model." Entropy 25, no. 2 (February 3, 2023): 288. http://dx.doi.org/10.3390/e25020288.
Full textAbstract:
Over recent years, there are an increasing number of incidents in which archival images have been ripped. Leak tracking is one of the key problems for anti-screenshot digital watermarking of archival images. Most of the existing algorithms suffer from low detection rate of watermark, because the archival images have a single texture. In this paper, we propose an anti-screenshot watermarking algorithm for archival images based on Deep Learning Model (DLM). At present, screenshot image watermarking algorithms based on DLM can resist screenshot attacks. However, if these algorithms are applied on archival images, the bit error rate (BER) of the image watermark will increase dramatically. Archival images are ubiquitous, so in order to improve the robustness of archival image anti-screenshot, we propose a screenshot DLM “ScreenNet”. It aims to enhance the background and enrich the texture with style transfer. Firstly, a preprocessing process based on style transfer is added before the insertion of an archival image into the encoder to reduce the influence of the screenshot process of the cover image. Secondly, the ripped images are usually moiréd, so we generate a database of ripped archival images with moiréd by means of moiréd networks. Finally, the watermark information is encoded/decoded through the improved ScreenNet model using the ripped archive database as the noise layer. The experiments prove that the proposed algorithm is able to resist anti-screenshot attacks and achieves the ability to detect watermark information to leak the trace of ripped images.
39
Hamadou, Ali, Lanciné Camara, Abdoul Aziz Issaka Hassane, and Harouna Naroua. "Reversible Fragile Watermarking Scheme for Relational Database Based on Prediction-Error Expansion." Mathematical Problems in Engineering 2020 (May 5, 2020): 1–9. http://dx.doi.org/10.1155/2020/1740205.
Full textAbstract:
The protection of database systems content using digital watermarking is nowadays an emerging research direction in information security. In the literature, many solutions have been proposed either for copyright protection and ownership proofing or integrity checking and tamper localization. Nevertheless, most of them are distortion embedding based as they introduce permanent errors into the cover data during the encoding process, which inevitably affect data quality and usability. Since such distortions are not tolerated in many applications, including banking, medical, and military data, reversible watermarking, primarily designed for multimedia content, has been extended to relational databases. In this article, we propose a novel prediction-error expansion based on reversible watermarking strategy, which not only detects and localizes malicious modifications but also recovers back the original data at watermark detection. The effectiveness of the proposed method is proved through rigorous theoretical analysis and detailed experiments.
40
Jean E. Brown, A., and Richard Mulholland. "USING MICROFOCUS X-RADIOGRAPHY AND OTHER TECHNIQUES TO CREATE A DIGITAL WATERMARK DATABASE." Studies in Conservation 47, sup3 (September 2002): 21–26. http://dx.doi.org/10.1179/sic.2002.47.s3.005.
Full text
41
Pechyonkina, Angelika, and Igor Karmanov. "APPLICATION OF DIGITAL WATERMARKS FOR INTELLECTUAL PROPERTY PROTECTION." Interexpo GEO-Siberia 6, no. 2 (2019): 159–68. http://dx.doi.org/10.33764/2618-981x-2019-6-2-159-168.
Full textAbstract:
At the moment, due to the development of global networks, protection of intellectual property from illegal copying is of great importance. A lot of research is devoted to use of steganography for copyright protection. Steganographic methods not only secretly transmit information, but also solve problems of authentication noise immunity, protecting data from unauthorized copying, tracking information movement in a network and for searching it in multimedia databases. Most areas of applied mathematics are used as a tool for steganography, and the term «stego» has long been used by Internet users as an important component of modern information security technologies.
42
Arif Shah, Saeed, Imran Ali Khan, Syed Zaki Hassan Kazmi, and Fariza Hanum Binti Md Nasaruddin. "SEMI-FRAGILE WATERMARKING SCHEME FOR RELATIONAL DATABASE TAMPER DETECTION." Malaysian Journal of Computer Science 34, no. 1 (January 31, 2021): 1–12. http://dx.doi.org/10.22452/mjcs.vol34no1.1.
Full textAbstract:
Most of data over the Internet today is hosted on outsourced third-party servers which are not trusted. Sometimes data is to be distributed to other organizations or individuals for pre-agreed use. In both of these scenarios data is susceptible to malicious tampering so there is a need for some mechanism to verify database integrity. Moreover, the authentication process should be able to differentiate between valid updates and malicious modifications. In this paper, we present a novel semi-fragile watermarking scheme for relational database integrity verification. Besides detection and localization of database tampering, the proposed scheme allows modifications to the data that need periodic updates, without requiring re-watermarking. Watermark embedding is distortion free, as it is done by adjusting the text case of selected data values resulting in retention of semantic meaning of data. Additionally, group-based embedding ensures the localization of tampering up to group level. We implemented a proof of concept application of our watermarking technique. Theoretical analysis and experiments show that even a single value modification can be detected with very high probability besides detection of attacks like tuple insertion and tuple deletion.
43
Min, Huang, Cao Jia-heng, Peng Zhi-yong, and Zeng Cheng. "A new mechanism based on similar clouds watermark for database's information security." Wuhan University Journal of Natural Sciences 9, no. 4 (July 2004): 415–19. http://dx.doi.org/10.1007/bf02830434.
Full text
44
Wang, Yue, Wei Li, and Yaojun Zhang. "Mathematical Model Design of the Traditional Dress Recognition Algorithm Based on Digital Watermarking Technology." Mathematical Problems in Engineering 2022 (September 30, 2022): 1–9. http://dx.doi.org/10.1155/2022/5230996.
Full textAbstract:
According to the characteristics of traditional clothing, clothing identification is studied, and clothing identification and clothing culture learning are effectively combined to find a new method for the inheritance of national culture and strive to make contributions to the inheritance of national culture. According to the requirement of the traditional garment identification watermark monitoring system, a self-synchronous digital watermarking algorithm is designed and implemented. Watermark is embedded in the time domain, and feature information is extracted from traditional clothing by means of mean filtering and replaced by watermark to achieve the purpose of embedding information. Blind detection is realized without the participation of the original image. The difference between the traditional costume embedded with watermark and the original traditional costume is almost imperceptible. It can effectively resist synchronous attacks including clipping and time shifting, showing good robustness. Imperceptibility and robustness can be adjusted freely by embedding strength. The HOG + SVM algorithm is applied to minority clothing classification and recognition. By comparing different classifiers, it is concluded that the classifier trained by the support vector machine algorithm has the best classification effect on ethnic clothing. In order to improve the classification effect, the classical algorithm of color, texture, and shape feature extraction was combined with SVM to conduct experiments on the clothing database collected and sorted out in Yunnan ethnic minority communities, and finally, we verified that the HOG feature combined with the SVM classification algorithm achieved good results in the classification of ethnic clothing.
45
Umasankari, N., and Dr B.Muthukumar. "Biometrics Images Using Watermarking in an ICA." International Journal of Engineering & Technology 7, no. 4.10 (October 2, 2018): 780. http://dx.doi.org/10.14419/ijet.v7i4.10.26115.
Full textAbstract:
In this paper we use Digital watermarking for individuals all in all water stamping, customers of the substance are affirmed to perceive the watermark. It is the way of concealing the mystery information behind any two pictures. This paper contains procedure of DCT is the one of pressure method for concealing the pictures behind cover pictures and mystery picture and to expand the nature of the pictures of retina and fingerprint images determination utilizing MATLAB. The steganographic watermarking is the procedure, where content clients are uninformed of the nearness of watermark. The legitimacy procedure and controlled by a client and coordinated into a database give another measurement of security against extortion, distortion, and duplication. The Verification and security have been main problems perfect from the most punctual beginning stage of the PC age. As a result of moral programmers nowadays a vast gap in system security.
46
Maas, Tycho. "Tracing Personal Accounts in Colonial Knowledge Networks: Towards a Watermark Database for the Cape Colony, 1652–1795." Papers of the Bibliographical Society of America 117, no. 2 (June 1, 2023): 215–35. http://dx.doi.org/10.1086/725534.
Full text
47
Razafindradina, Henri Bruno, and Paul Auguste Randriamitantsoa. "Multiple Image Watermarking based on SVD : Improving Capacity and Imperceptibility." International Journal on Cryptography and Information Security 12, no. 4 (December 30, 2022): 01–11. http://dx.doi.org/10.5121/ijcis.2022.12401.
Full textAbstract:
Digital watermarking consists of inserting a mark (text, image, sound or video) in a medium. The goal is to be able to identify the author or owner of a digital document by the inserted mark. Watermarking algorithms must find a compromise between capacity and imperceptibility. Capacity represents the amount of data inserted and the imperceptibility makes the mark invisible. Our research is related to images watermarking based on singular value decomposition. There are two main approaches to improving capacity and imperceptibility : dual technique and multiple technique. Most algorithms based on these two approaches have low capacity : the watermarks are generally smaller than the host image. Agarwal & al worked on inserting an image into another image of the same size, imperceptibly. Their method adds the mark in the V matrix of the image after its singular value decomposition. A λ parameter was chosen to specify the power of insertion. Our contribution is to add two images by simultaneously improving capacity and imperceptibility. This new method consists on adding the mark in the 2 matrices U and V after singular value decomposition. The insertion of the first mark is an addition as in Agarwal’s method while that of the second mark is a subtraction to make the watermark less imperceptible. The result shows that our method is robust against different attacks such as compression, noise addition, median filtering and rotation. It is also imperceptible because not only we obtain a PSNR of 27 dB, but the histogram obtained is closer to that of the original image than that of Agarwal. A test on a database of 180 images shows that the marks are still detected. However, despite these advantages, the first mark is less visible and of poor quality compared to the second after their extraction. One solution to this is to increase the value of the parameter λ for the insertion of the first mark.
48
Konda, Chaitanya, U. Sathish Kumar, and Arun Kodirekka. "Medical Image Watermarking for Tamper Detection in ROI Using LWT and Hashing." E3S Web of Conferences 391 (2023): 01139. http://dx.doi.org/10.1051/e3sconf/202339101139.
Full textAbstract:
Security is one of the important characteristics while transmitting the data particularly medical images and patient information over cyberspace without any loss of information. In the proposed method LWT, DCT and SHA-256 hashing techniques are used to provide security to the patient data and to detect tampers in ROI of the medical images. In this paper, medical image is segmented into three regions, region of interest (ROI), region of non interest (RONI) and BORDER regions. ROI is an area that has an important impact on diagnosis, whereas RONI has less or no significance in diagnosis. This paper proposed ROI based tamper detection that embeds hash value of ROI into RONI for authentication and also embed the patient information into RONI for providing security. The experimental results of the proposed method on various medical image databases proved to identify the tampers in medical images. Compared with the existing technique, the proposed method offered high Peak Signal to Noise Ratio (PSNR) approximately 59db for watermarked medical images.
49
Lafta, Ali, and Ayad Abdulsada. "Secure Content-Based Image Retrieval with Copyright Protection within Cloud Computing Environment." Iraqi Journal for Electrical and Electronic Engineering 18, no. 2 (August 3, 2022): 82–91. http://dx.doi.org/10.37917/ijeee.18.2.11.
Full textAbstract:
Every day, a tremendous amount of image data is generated as a result of recent advances in imaging and computing technology. Several content-based image retrieval (CBIR) approaches have been introduced for searching image collections. These methods, however, involve greater computing and storage resources. Cloud servers can address this issue by offering a large amount of computational power at a low cost. However, cloud servers are not completely trustworthy, and data owners are concerned about the privacy of their personal information. In this research, we propose and implement a secure CBIR (SCBIR) strategy for searching and retrieving cipher text image databases. In the proposed scheme, the extract aggregated feature vectors to represent the related image collection and use a safe Asymmetric Scalar-Product-Preserving Encryption (ASPE) approach to encrypt these vectors while still allowing for similarity computation. To improve search time, all encrypted features are recursively clustered using the k-means method to create a tree index. The results reveal that SCBIR is faster at indexing and retrieving than earlier systems, with superior retrieval precision and scalability. In addition, our paper introduces the watermark to discover any illegal distributions of the images that are received by unlawful data users. Particularly, the cloud server integrates a unique watermark directly into the encrypted images before sending them to the data users. As a result, if an unapproved image copy is revealed, the watermark can be extracted and the unauthorized data users who spread the image can be identified. The performance of the proposed scheme is proved, while its performance is demonstrated through experimental results.
50
Sy, Nguyen Chi, Ha Hoang Kha, and Nguyen Minh Hoang. "An Efficient Digital Watermarking Technique for Color Images Using Directional Transforms." Journal of Science and Technology: Issue on Information and Communications Technology 3, no. 2 (December 31, 2017): 1. http://dx.doi.org/10.31130/jst.2017.57.
Full textAbstract:
This paper is concerned with a digital watermarking technique for color images based on directional transforms. Different from the traditional watermarking schemes which embed the watermarks into the spatial domain or frequency domain of the Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT), this paper investigates the performance of the watermarking schemes using the Fast Discrete Curvelet Transforms (FDCT) and Contourlet Transform (CT). We evaluate the performance of the watermarking schemes using the directional transforms on a standard database of color images in terms of invisibility and robustness. The performance metrics are measured by Peak Signal-to-Noise Ratio (PSNR), Normalized Correlation (NC), Structural SIMilarity (SSIM) and required time for extracting and embedding process. The experimental results reveal that watermarking schemes in the directional transform domains outperform the other schemes in DWT domains.