Log in

Relevant bibliographies by topics / DATABASE WATERMARKING / Journal articles

To see the other types of publications on this topic, follow the link: DATABASE WATERMARKING.

Journal articles on the topic 'DATABASE WATERMARKING'

Author: Grafiati

Published: 11 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'DATABASE WATERMARKING.'

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

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

2

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

3

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

4

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

5

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

6

Wang, Mei Ting. "Relational Database Watermarking Algorithm Based on Comparison Table." Applied Mechanics and Materials 433-435 (October 2013): 1800–1804. http://dx.doi.org/10.4028/www.scientific.net/amm.433-435.1800.

Full text

Abstract:

To reduce the algorithm complexity and improve performance, comparison table is created, and then encrypted by a randomized ten-bit serial number. Serial number forms the first key named key1, and the encrypted comparison table forms the second key named key2. Watermarking image is transformed into a binary bit stream. By using tuples primary key, key1 and key2, each tuples unique Id is computed. According to the watermarking length, all tuples are divided into different groups. Using tuple Id, by searching the encrypted comparison table, each tuple group can embed one bit information of watermarking. Robustness and security of this algorithm are tested by experiment.

APA, Harvard, Vancouver, ISO, and other styles

7

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

8

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

9

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

10

Alqassab, Asmaa, and Mafaz Alanezi. "Relational Database Watermarking Techniques: A Survey." Journal of Physics: Conference Series 1818, no. 1 (March 1, 2021): 012185. http://dx.doi.org/10.1088/1742-6596/1818/1/012185.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Siledar, Seema, and Dr Sharvari Tamane. "REVERSIBLE DATABASE WATERMARKING WITH DISTORTION CONTROL." Indian Journal of Computer Science and Engineering 12, no. 5 (October 20, 2021): 1503–9. http://dx.doi.org/10.21817/indjcse/2021/v12i5/211205166.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

朱, 洪斌. "A New Practical Database Watermarking Method." Computer Science and Application 10, no. 07 (2020): 1400–1408. http://dx.doi.org/10.12677/csa.2020.107144.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Rao, Udai Pratap, Dhiren R. Patel, and Punitkumar M. Vikani. "Relational Database Watermarking for Ownership Protection." Procedia Technology 6 (2012): 988–95. http://dx.doi.org/10.1016/j.protcy.2012.10.120.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

15

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

16

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

17

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

18

HosseinMoradian Sardroudi, Subariah Ibrahim, and OmidZanganeh. "Robust Database Watermarking Technique over Numerical Data." Journal of Communications and Information Sciences 1, no. 1 (April 30, 2011): 30–40. http://dx.doi.org/10.4156/jcis.vol1.issue1.4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Zhu, Qing. "Digital watermarking technology based on relational database." Journal of Interdisciplinary Mathematics 21, no. 5 (July 4, 2018): 1211–15. http://dx.doi.org/10.1080/09720502.2018.1495226.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Xiang, Shijun, and Jiayong He. "Database authentication watermarking scheme in encrypted domain." IET Information Security 12, no. 1 (January 1, 2018): 42–51. http://dx.doi.org/10.1049/iet-ifs.2017.0092.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

22

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 text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

23

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

24

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

25

Kumar, Manoj, O. P., and Archana Saxena. "Elliptic Curve Cryptography (ECC) based Relational Database Watermarking." International Journal of Computer Applications 154, no. 6 (November 17, 2016): 20–28. http://dx.doi.org/10.5120/ijca2016912159.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

27

Gupta, Gaurav, and Josef Pieprzyk. "Reversible and Blind Database Watermarking Using Difference Expansion." International Journal of Digital Crime and Forensics 1, no. 2 (April 2009): 42–54. http://dx.doi.org/10.4018/jdcf.2009040104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Al-Haj, Ali, and Ashraf Odeh. "Robust and Blind Watermarking of Relational Database Systems." Journal of Computer Science 4, no. 12 (December 1, 2008): 1024–29. http://dx.doi.org/10.3844/jcssp.2008.1024.1029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Li, Yan, Junwei Wang, Shuangkui Ge, Xiangyang Luo, and Bo Wang. "A reversible database watermarking method with low distortion." Mathematical Biosciences and Engineering 16, no. 5 (2019): 4053–5068. http://dx.doi.org/10.3934/mbe.2019200.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Kumar, Sanjay, Binod Kumar Singh, and Mohit Yadav. "A Recent Survey on Multimedia and Database Watermarking." Multimedia Tools and Applications 79, no. 27-28 (April 15, 2020): 20149–97. http://dx.doi.org/10.1007/s11042-020-08881-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

32

Ali, Zulfiqar, Fazal-e-Amin, and Muhammad Hussain. "A Novel Fragile Zero-Watermarking Algorithm for Digital Medical Images." Electronics 11, no. 5 (February 25, 2022): 710. http://dx.doi.org/10.3390/electronics11050710.

Full text

Abstract:

The wireless transmission of patients’ particulars and medical data to a specialised centre after an initial screening at a remote health facility may cause potential threats to patients’ data privacy and integrity. Although watermarking can be used to rectify such risks, it should not degrade the medical data, because any change in the data characteristics may lead to a false diagnosis. Hence, zero watermarking can be helpful in these circumstances. At the same time, the transmitted data must create a warning in case of tampering or a malicious attack. Thus, watermarking should be fragile in nature. Consequently, a novel hybrid approach using fragile zero watermarking is proposed in this study. Visual cryptography and chaotic randomness are major components of the proposed algorithm to avoid any breach of information through an illegitimate attempt. The proposed algorithm is evaluated using two datasets: the Digital Database for Screening Mammography and the Mini Mammographic Image Analysis Society database. In addition, a breast cancer detection system using a convolutional neural network is implemented to analyse the diagnosis in case of a malicious attack and after watermark insertion. The experimental results indicate that the proposed algorithm is reliable for privacy protection and data authentication.

APA, Harvard, Vancouver, ISO, and other styles

33

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

34

Bedi, Rajneeshkaur, Anita Thengade, and Dr Vijay M.Wadhai. "A New Watermarking Approach for Non numeric Relational Database." International Journal of Computer Applications 13, no. 7 (January 12, 2011): 37–40. http://dx.doi.org/10.5120/1790-2473.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Tufail, Hina, Kashif Zafar, and Abdul Rauf Baig. "Relational database security using digital watermarking and evolutionary techniques." Computational Intelligence 35, no. 4 (April 29, 2019): 693–716. http://dx.doi.org/10.1111/coin.12209.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

37

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

38

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

39

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

40

Garcia-Hernandez, Jose Juan, Claudia Feregrino-Uribe, Alejandra Menendez-Ortiz, and Dan Williams Robledo-Cruz. "Evaluation of a Framework for Robust Image Reversible Watermarking." Applied Sciences 12, no. 14 (July 18, 2022): 7242. http://dx.doi.org/10.3390/app12147242.

Full text

Abstract:

In the literature, robust reversible watermarking schemes (RWSs) allow the extraction of watermarks after the images have suffered attacks; however, the modified images are compromised. On the other hand, self-recovery schemes will restore the compromised regions of the images, but no secret messages are inserted in these schemes. A framework for robust reversible watermarking with signal restoration capabilities was previously proposed in the literature. This study selects four fragile reversible watermarking techniques and two self-recovery schemes to design different framework configurations. These configurations are evaluated to test the framework’s performance and determine the structure that yields better results in terms of perceptual transparency using a well-known image database as the signal input. It was found that fragile reversible watermarking schemes hold low perceptual distortion, while self-recovery schemes produce high perceptual distortion levels. The inherent characteristics of each algorithm determine, a priori, the behavior of the framework, which is approximated by a proposed equation.

APA, Harvard, Vancouver, ISO, and other styles

41

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

42

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

43

K. Bedi, Rajneeshkaur, and Dr V. M. Wadhai. "Watermarking Relational Database Using Hindi Phonemes and Hill Cipher Technique." IOSR Journal of Computer Engineering 16, no. 3 (2014): 102–7. http://dx.doi.org/10.9790/0661-1633102107.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Rani, Sapana, and Raju Halder. "Comparative Analysis of Relational Database Watermarking Techniques: An Empirical Study." IEEE Access 10 (2022): 27970–89. http://dx.doi.org/10.1109/access.2022.3157866.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Agila, G., and N. R. Ananthanarayanan. "Watermarking Technique using UID for Relational Data Saving in Database." International Journal of Computer Applications 132, no. 2 (December 17, 2015): 37–45. http://dx.doi.org/10.5120/ijca2015907305.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

MA, Rui-min, and Ji-hong CHEN. "Database watermarking algorithm based on parity modulation in two-dimension space." Journal of Computer Applications 32, no. 8 (May 7, 2013): 2268–70. http://dx.doi.org/10.3724/sp.j.1087.2012.02268.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

S. Alghamdi, Ahmed, Surayya Naz, Ammar Saeed, Eesa Al Solami, Muhammad Kamran, and Mohammed Saeed Alkatheiri. "A Novel Database Watermarking Technique Using Blockchain as Trusted Third Party." Computers, Materials & Continua 70, no. 1 (2022): 1585–601. http://dx.doi.org/10.32604/cmc.2022.019936.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

A. El Drandaly, Khalid, Walid Khedr, Islam S. Mohamed, and Ayman Mohamed Mostafa. "Digital Watermarking Scheme for Securing Textual Database Using Histogram Shifting Model." Computers, Materials & Continua 71, no. 3 (2022): 5253–70. http://dx.doi.org/10.32604/cmc.2022.023684.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Gao, Lingyun, Dong Wang, and Ali Hamadou. "New Fragile Database Watermarking Scheme with Restoration Using Reed-Solomon Codes." Journal of Computational and Theoretical Nanoscience 10, no. 1 (January 1, 2013): 147–53. http://dx.doi.org/10.1166/jctn.2013.2671.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Lian, Junyao. "A New Reversible Database Watermarking Approach with Ant Colony Optimization Algorithm." Journal of Physics: Conference Series 1616 (August 2020): 012040. http://dx.doi.org/10.1088/1742-6596/1616/1/012040.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!