A flexible authorization mechanism for relational data management systems
ACM Transactions on Information Systems (TOIS)
Watermarking maps: hiding information in structured data
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Information Hiding Techniques for Steganography and Digital Watermarking
Information Hiding Techniques for Steganography and Digital Watermarking
A Robust Block Oriented Watermarking Scheme in Spatial Domain
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Error- and Collusion-Secure Fingerprinting for Digital Data
IH '99 Proceedings of the Third International Workshop on Information Hiding
Query-preserving watermarking of relational databases and XML documents
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rights protection for relational data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Constructing a virtual primary key for fingerprinting relational data
Proceedings of the 3rd ACM workshop on Digital rights management
Watermarking relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
IWDW'02 Proceedings of the 1st international conference on Digital watermarking
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
Fingerprinting Relational Databases: Schemes and Specialties
IEEE Transactions on Dependable and Secure Computing
| Hi-index | 0.00 |
The need for protecting rights over relational data is of ever increasing concern. There have recently been some pioneering works in this area. In this paper, we propose an effective fingerprinting scheme based on the idea of block method in the area of multimedia fingerprinting. The scheme ensures that certain bit positions of the data contain specific values. The bit positions are determined by the keys known only to the owner of the data and different buyers of the database have different bit positions and different specific values for those bit positions. The detection of the fingerprint can be completed even with a small subset of a marked relation in case that the sample contains the fingerprint. Our extensive analysis shows that the proposed scheme is robust against various forms of attacks, including adding, deleting, shuffling or modifying tuples or attributes and colluding with other recipients of a relation, and ensures the integrity of relation at the same time.