A Highly-Reliable Virtual Primary Key Scheme for Relational Database Watermarking Techniques

Gort, Maikel Lázaro Pérez; Diaz, Ernesto Aparicio; Uribe, Claudia Feregrino

doi:10.1109/csci.2017.10

Cited by 9 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Despite our proposal contributes to increment the quality of the synchronized WM using the VPK sets generated by any scheme, we validated our approach using the S and M schemes, since those are the options that generate one VPK TABLE 2. WM embedded using each VPK scheme [10], [24].…”

Section: Resultsmentioning

confidence: 99%

“…The Ext-Scheme was proposed in 2017 by Pérez Gort et al [24] with the goal of varying the elements involved in the VPK generation. Same as the S-Scheme and the M-Scheme, the Ext-Scheme generates one VPK for each tuple, but the attributes involved can vary depending on their values.…”

Section: ) the Ext-schemementioning

confidence: 99%

“…Considering that choosing a process featuring a high entropy in the generation of the seeds is an important factor for our approach to succeed, we proposed a version of the Ext-Scheme [24] to perform this task despite having been initially conceived for VPK generation. Compared to the other solutions, this scheme is more robust against the deletion problem and generates less duplicate values.…”

Section: Algorithm 1 Selection Of the Mark Given The Vpkmentioning

confidence: 99%

See 2 more Smart Citations

A Double Fragmentation Approach for Improving Virtual Primary Key-Based Watermark Synchronization

et al. 2020

View full text Add to dashboard Cite

Relational data watermarking techniques using virtual primary key schemes try to avoid compromising watermark detection due to the deletion or replacement of the relation's primary key. Nevertheless, these techniques face the limitations that bring high redundancy of the generated set of virtual primary keys, which often compromises the quality of the embedded watermark. As a solution to this problem, this paper proposes double fragmentation of the watermark by using the existing redundancy in the set of virtual primary keys. This way, we guarantee the right identification of the watermark despite the deletion of any of the attributes of the relation. The experiments carried out to validate our proposal show an increment between 81.04% and 99.05% of detected marks with respect to previous solutions found in the literature. Furthermore, we found out that our approach takes advantage of the redundancy present in the set of virtual primary keys. Concerning the computational complexity of the solution, we performed a set of scalability tests that show the linear behavior of our approach with respect to the processes runtime and the number of tuples involved, making it feasible to use no matter the amount of data to be protected.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: ) the Ext-schemementioning

confidence: 99%

Section: Algorithm 1 Selection Of the Mark Given The Vpkmentioning

confidence: 99%

See 1 more Smart Citation

A Double Fragmentation Approach for Improving Virtual Primary Key-Based Watermark Synchronization

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The VPK is generated based on two numeric attributes in [24]. Different attributes are selected each time in [25]. The HQR-Scheme [26] generates one VPK per tuple based on the cyclic model of the attribute.…”

Section: B: Virtual Primary Key Basedmentioning

confidence: 99%

Comparative Analysis of Relational Database Watermarking Techniques: An Empirical Study

Rani

Halder

2022

IEEE Access

View full text Add to dashboard Cite

Digital watermarking is considered one of the most promising techniques to verify the authenticity and integrity of digital data. It is used for a wide range of applications, e.g., copyright protection, tamper detection, traitor tracing, maintaining the integrity of data, etc. In the past two decades, a wide range of algorithms for relational database watermarking has been proposed. Even though a number of surveys exist in the literature, they are unable to provide insightful guidance to choose the right watermarking technique for a given application. In this paper, we provide an exhaustive empirical study and thorough comparative analysis of various relational database watermarking techniques in the literature. Our work is different from the existing survey papers as we consider both distortion-based and distortion-free techniques along with a rigorous experimental analysis demonstrating a detailed comparison on robustness, data usability, and computational cost with considerable empirical evidence. INDEX TERMSDigital watermarking, relational database, empirical study, robustness, data usability. RAJU HALDER (Member, IEEE) received the Ph.D. degree from Università Ca´Foscari, Italy, in 2012. He is currently an Associate Professor with the Department of Computer Science and Engineering, IIT Patna. Before joining IIT Patna, he worked as a Postdoctoral Researcher with Macquarie University, Australia. He worked with the Robotics Team at HASLab (University of Minho), Portugal, in 2016. Prior to his Ph.D. degree, he had also worked as an Associate System Engineer at IBM India Private Ltd., from 2007 to 2008. His research interests include formal methods, blockchain technology, program analysis and verification, and data privacy and security.

show abstract

“…We used the relation's PK to perform the watermark synchronization. To avoid the use of the PK we recommend the generation of virtual primary keys by using the Ext-Scheme (Gort et al, 2017) or the HQR-Scheme (Gort et al, 2019). These schemes were originally proposed for numerical attributes, but they can be applied by combining numerical and textual cover types as well.…”

Section: Ssimmentioning

confidence: 99%

Semantic-driven watermarking of relational textual databases

Gort

Olliaro

Cortesi

et al. 2021

Expert Systems with Applications

View full text Add to dashboard Cite

A Highly-Reliable Virtual Primary Key Scheme for Relational Database Watermarking Techniques

Cited by 9 publications

References 13 publications

A Double Fragmentation Approach for Improving Virtual Primary Key-Based Watermark Synchronization

A Double Fragmentation Approach for Improving Virtual Primary Key-Based Watermark Synchronization

Comparative Analysis of Relational Database Watermarking Techniques: An Empirical Study

Semantic-driven watermarking of relational textual databases

Contact Info

Product

Resources

About