loading...
The Watermarking Model for Relational Database Based on Watermarking Sharing
Pasadena, California, USA December 18-December 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IIH-MSP.2006.1652006 International Conference on Inte ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Cong Jin, Central China Normal University, China
Yu Fu, Central China Normal University, China
Feng Tao, Central China Normal University, China
In this paper we propose a conceptual framework for relational database based on secret sharing technology. We offer a technique to break the main secret into multiple parts and hide them individually in a relational database. The Lagrange Interpolating Polynomial method is used to recover the shared secret. The (k, n) threshold scheme is used to decide the minimum number of parts required to recover the secret data completely. Through deep data analysis, experimental results show how the proposed scheme can offer robust mechanism to protect data loss especially for the tuples deleting.
Citation:
Cong Jin, Yu Fu, Feng Tao, "The Watermarking Model for Relational Database Based on Watermarking Sharing," iih-msp, pp.677-680, 2006 International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.