A Block Oriented Fingerprinting Scheme in Relational Database
Conference Proceeding Article
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.
Information Security and Cryptology - ICISC 2004: 7th International Conference, Seoul, Korea, December 2-3: Revised Selected Papers
City or Country
LIU, Siyuan; WANG, Shuhong; DENG, Robert H.; and SHAO, Weizhong.
A Block Oriented Fingerprinting Scheme in Relational Database. (2005). Information Security and Cryptology - ICISC 2004: 7th International Conference, Seoul, Korea, December 2-3: Revised Selected Papers. 3506, 455-466. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/563