Relational database water mark embed and extraction method based on (t,n) threshold
A watermark embedding and database technology, which is applied in the field of database watermarking, can solve the problems of poor watermark image stability, low watermark image calculation efficiency, and poor practicability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0057] A relational database watermark embedding method based on (t, n) threshold. The watermark embedding means that the database owner mixes the watermark image with the data in the database through the watermark embedding algorithm to protect the copyright of the database. The specific calculation steps are as follows:
[0058] 1) Set the database owner to determine some secret information: watermark image, large prime number p in Lagrange interpolation polynomial, user key user_ey in marking algorithm, t, n value in (t, n) threshold, data change range len (that is, from the tth digit after the decimal point, a total of len digits can be changed);
[0059] 2) Perform numerical processing on the watermark image, that is, convert the two-dimensional array corresponding to the image into a decimal number, expressed as bigint;
[0060] 3) Randomly select the coefficient a in the polynomial (1) i (1≤i≤t-1), take k=bigint to construct a Lagrange interpolation polynomial ...
Embodiment 2
[0066] A relational database watermark extraction method based on (t, n) threshold, if the owner of database DB A suspects that the database A_DB used by B is an illegal copy of DB, then A can extract the watermark hidden in A_DB through the watermark extraction algorithm watermark to prove that A_DB is illegally embezzled by B. Watermark extraction is the reverse process of watermark embedding. The extraction method includes the following steps:
[0067] 1) Several secret information known by A: watermark image, t, n value selected by (t, n) threshold, large prime number p in Lagrange interpolation polynomial, polynomial coefficient a i (1≤i≤t-1), the user key user_key in the marking algorithm, and the range of data changes (that is, the len bits can be changed from the tth digit after the decimal point);
[0068] 2) Find out each attribute column that can embed watermark in A_DB;
[0069] 3) According to user_key, calculate the id value of the current data item: id=hash(u...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com