A Graded Reversible Watermarking Scheme for Relational Data

Hou, Ruitao; Xian, Hequn

doi:10.1007/s11036-019-01491-5

Cited by 9 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Subset Modification Attack Experiment. The subset modification attack refers to the modification of a certain percentage of tuples in the relational data containing the watermark, which leads to an error in the watermark detection and achieves the purpose of destroying the watermark [35].…”

Section: Watermark Robustness Ability Comparison Experimentsmentioning

confidence: 99%

See 1 more Smart Citation

A Robust and Adaptive Watermarking Technique for Relational Database

Zhang

Wang

et al. 2022

Communications in Computer and Information Science

View full text Add to dashboard Cite

A watermarking technology is a kind of marker covertly embedded to identify ownership of the copyright. The existing database watermarking techniques cannot automatically adapt to different types of data and have poor robustness. In this paper, we present a new robust database watermarking scheme. The scheme can automatically adapt the watermarking algorithm and parameters according to the data characteristics for numerical and text-based data. We have theoretically established and verified experimentally the performance of our method in terms of robustness and less data distortion. This makes it suitable for copyright protection, owner identification, or traitor tracing purposes.

show abstract

Section: Watermark Robustness Ability Comparison Experimentsmentioning

confidence: 99%

“…Subset Addition Attack Experiment. The subset addition attack refers to adding a certain percentage of tuples to the relational data containing the watermark, which does not affect the original data but disrupts the watermark detection, leading to incorrect watermark detection [35].…”

Section: Watermark Robustness Ability Comparison Experimentsmentioning

confidence: 99%

A Robust and Adaptive Watermarking Technique for Relational Database

Zhang

Wang

et al. 2022

Communications in Computer and Information Science

View full text Add to dashboard Cite

show abstract

“…This algorithm is used to decrypt the re-encryption ciphertext C m , which is run by the grantee. Its input includes the re-encryption ciphertext C m and the grantee's private key sk j , the output is plaintext m. , ×) and (G 2 , ×) are two multiplicative cyclic groups of prime order, e : G 1 × G 1 → G 2 is a Bilinear Mapping if it has the following attributes[24],[25]:…”

mentioning

confidence: 99%

SecDedup: Secure Encrypted Data Deduplication With Dynamic Ownership Updating

2020

Self Cite

View full text Add to dashboard Cite

Deduplication eliminates duplicated data copies and reduces storage costs of cloud service providers. However, deduplication of encrypted data is difficult. Current solutions rely heavily on trusted third parties, and do not address the popularity of data, resulting in unsatisfying security and efficiency. A secure encrypted data deduplication scheme based on data popularity is proposed. Check tags are calculated via bilinear mapping to determine whether different encrypted data originate from the same plaintext. Ciphertext policy attribute-based encryption is applied to protect the tags. A secure key delivery scheme is designed to pass the data encryption key from an initial data uploader to subsequent uploaders via the cloud server in an offline manner. The cloud server can perform deduplication without the assistance of any online third party. Security analysis and simulation experiments are provided, proving the practicability and efficiency of the proposed scheme. INDEX TERMS Deduplication, proxy re-encryption, bilinear mapping, data ownership update.

show abstract