CN117909943A - Watermark tracing processing method and system based on multiple nodes - Google Patents
Watermark tracing processing method and system based on multiple nodes Download PDFInfo
- Publication number
- CN117909943A CN117909943A CN202410309913.5A CN202410309913A CN117909943A CN 117909943 A CN117909943 A CN 117909943A CN 202410309913 A CN202410309913 A CN 202410309913A CN 117909943 A CN117909943 A CN 117909943A
- Authority
- CN
- China
- Prior art keywords
- watermark
- data
- node
- tracing
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 10
- 238000012545 processing Methods 0.000 claims abstract description 55
- 238000000034 method Methods 0.000 claims abstract description 46
- 238000004088 simulation Methods 0.000 claims description 20
- 239000000758 substrate Substances 0.000 claims 1
- 230000008569 process Effects 0.000 abstract description 17
- 238000004422 calculation algorithm Methods 0.000 description 10
- 238000000605 extraction Methods 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 3
- 238000004590 computer program Methods 0.000 description 3
- 238000003780 insertion Methods 0.000 description 2
- 230000037431 insertion Effects 0.000 description 2
- 241001522296 Erithacus rubecula Species 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 239000000969 carrier Substances 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000007418 data mining Methods 0.000 description 1
- 238000000586 desensitisation Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000452 restraining effect Effects 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Landscapes
- Editing Of Facsimile Originals (AREA)
- Image Processing (AREA)
Abstract
The application discloses a watermark tracing processing method and system based on multiple nodes, wherein the method comprises the following steps: when each node adds a watermark to data, recording watermark information corresponding to the watermark added by the node; collecting watermark information corresponding to data recorded by each node in a plurality of nodes for watermark processing, and summarizing to obtain watermark information corresponding to all data for watermark processing; and sending watermark information corresponding to all data to each node in the plurality of nodes, wherein each node uses the watermark information corresponding to all the received data to trace the watermark in the watermark tracing task after receiving the watermark tracing task. The application solves the problem that the tracing failure is caused when a plurality of nodes process the watermark in the prior art, thereby successfully tracing the watermark when the plurality of nodes process the watermark.
Description
Technical Field
The application relates to the field of data processing, in particular to a watermark tracing processing method and system based on multiple nodes.
Background
With the rapid development of the internet and digitizing technology, a large amount of digital data is widely used in various fields such as audio, video, pictures, documents, etc. However, the replicability and the tamperability of digital data bring about a plurality of security risks, so that a data watermark tracing technology is generated to solve the problem.
The data watermark tracing system is a technology for tracing the source of data and detecting the tampering of the data by embedding hidden marking information (namely watermark) in the process of data generation, transmission, storage and use. Such watermark information is generally not visible or readily noticeable, but can be extracted and verified by specific algorithms and techniques.
The data watermark tracing system integrates watermark information with high simulation and high transparency into original data, optimizes the external distribution flow of the data, and has the functions of discovering the prior sensitive data by issuing the data, adding data marks, automatically generating watermarks, auditing the issuing, precisely tracing the data leakage source and the like.
It can be understood from the description of the data watermark tracing technology that various processes need to be performed on the data when the data is subject to watermark tracing, and in this case, if there is a large amount of data to be subject to watermark tracing, one node processes the data, which is relatively inefficient. To solve this problem, a plurality of nodes are typically introduced to perform data watermark tracing.
After a plurality of nodes are introduced, watermark files cannot be handed over to the node with the original added watermark for processing during tracing, so that tracing failure is caused. For example, when a plurality of nodes are traced, since the trace of the file is from which node is uncertain, if the trace is from the watermark task of the node A, the output is the file, and when tracing, the file generated by the watermark task is issued to the node B, the result of the trace task executed by the node B is null, and thus tracing failure is caused.
Disclosure of Invention
The embodiment of the application provides a watermark tracing processing method and system based on multiple nodes, which at least solve the problem that tracing failure is caused when a plurality of nodes process watermark in the prior art.
According to one aspect of the present application, there is provided a watermark tracing processing method based on multiple nodes, including: when each node adds a watermark to data, recording watermark information corresponding to the watermark added by the node, wherein the watermark information is used for carrying out inverse operation on the watermark so as to carry out watermark tracing, and the watermark tracing is used for searching a distribution source and a distribution purpose of the data; the plurality of nodes are used for watermark processing; collecting watermark information corresponding to data recorded by each node in a plurality of nodes for watermark processing, and summarizing to obtain watermark information corresponding to all data for watermark processing; and sending watermark information corresponding to all data to each node in the plurality of nodes, wherein each node uses the watermark information corresponding to all the received data to trace the watermark in the watermark tracing task after receiving the watermark tracing task.
Further, before each node adds a watermark to the data, the method further comprises: acquiring the number of watermark processing tasks to be executed by each node in the plurality of nodes; selecting the node with the least number of watermark processing tasks to be executed; the data is sent to the node with the least task number to be selected to add the watermark for the data; and/or, receiving watermark tracing tasks, and obtaining the number of watermark processing tasks to be executed by each node in the plurality of nodes; and selecting the node with the minimum number of watermark processing tasks to be executed, and sending the watermark tracing task to the node with the minimum number of tasks to be selected for watermark tracing.
Further, adding a watermark to the data includes: generating simulation data according to the data type and the data format of each field in the data table when the data is the data table; and inserting the simulation data into the data table, wherein the simulation data is one or more rows of data, and/or one or more columns of data, the one or more rows of data are pseudo rows of data, and the one or more columns of data are pseudo columns of data.
Further, sending watermark information corresponding to all data to each of the plurality of nodes includes: transmitting a predetermined field in a watermark task table corresponding to the data to each node in the plurality of nodes, wherein the predetermined field comprises: identification information for uniquely identifying each piece of data under the predetermined field, identification information of a distribution source, and identification information of a distribution destination.
According to another aspect of the present application, there is also provided a watermark tracing processing system based on multiple nodes, including: the system comprises a recording module, a data distribution module and a data distribution module, wherein the recording module is used for recording watermark information corresponding to the watermark added by each node when the watermark is added to the data by the node, wherein the watermark information is used for carrying out inverse operation on the watermark so as to carry out watermark tracing, and the watermark tracing is used for searching a distribution source and a distribution purpose of the data; the plurality of nodes are used for watermark processing; the summarizing module is used for collecting watermark information corresponding to data recorded by each node in the plurality of nodes for watermark processing and summarizing the watermark information to obtain watermark information corresponding to all the data for watermark processing; and the sending module is used for sending the watermark information corresponding to all the data to each node in the plurality of nodes, wherein after each node receives the watermark tracing task, the watermark in the watermark tracing task is traced by using the watermark information corresponding to all the received data.
Further, the sending module is further configured to: acquiring the number of watermark processing tasks to be executed by each node in the plurality of nodes; selecting the node with the least number of watermark processing tasks to be executed; the data is sent to the node with the least task number to be selected to add the watermark for the data; and/or, receiving watermark tracing tasks, and obtaining the number of watermark processing tasks to be executed by each node in the plurality of nodes; and selecting the node with the minimum number of watermark processing tasks to be executed, and sending the watermark tracing task to the node with the minimum number of tasks to be selected for watermark tracing.
Further, the recording module is used for: generating simulation data according to the data type and the data format of each field in the data table when the data is the data table; and inserting the simulation data into the data table, wherein the simulation data is one or more rows of data, and/or one or more columns of data, the one or more rows of data are pseudo rows of data, and the one or more columns of data are pseudo columns of data.
Further, the sending module is configured to: transmitting a predetermined field in a watermark task table corresponding to the data to each node in the plurality of nodes, wherein the predetermined field comprises: identification information for uniquely identifying each piece of data under the predetermined field, identification information of a distribution source, and identification information of a distribution destination.
According to another aspect of the present application, there is also provided an electronic device including a memory and a processor; wherein the memory is configured to store one or more computer instructions, wherein the one or more computer instructions are executed by the processor to perform the method steps described above.
According to another aspect of the present application there is also provided a readable storage medium having stored thereon computer instructions which when executed by a processor perform the above-mentioned method steps.
In the embodiment of the application, when each node adds a watermark for data, the watermark information corresponding to the watermark added by the node is recorded, wherein the watermark information is used for carrying out inverse operation on the watermark so as to carry out watermark tracing, and the watermark tracing is used for searching a distribution source and a distribution purpose of the data; the plurality of nodes are used for watermark processing; collecting watermark information corresponding to data recorded by each node in a plurality of nodes for watermark processing, and summarizing to obtain watermark information corresponding to all data for watermark processing; and sending watermark information corresponding to all data to each node in the plurality of nodes, wherein each node uses the watermark information corresponding to all the received data to trace the watermark in the watermark tracing task after receiving the watermark tracing task. The application solves the problem that the tracing failure is caused when a plurality of nodes process the watermark in the prior art, thereby successfully tracing the watermark when the plurality of nodes process the watermark.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description serve to explain the application. In the drawings:
fig. 1 is a flowchart of a multi-node-based watermark tracing processing method according to an embodiment of the application.
Detailed Description
It should be noted that, without conflict, the embodiments of the present application and features of the embodiments may be combined with each other. The application will be described in detail below with reference to the drawings in connection with embodiments.
It should be noted that the steps illustrated in the flowcharts of the figures may be performed in a computer system such as a set of computer executable instructions, and that although a logical order is illustrated in the flowcharts, in some cases the steps illustrated or described may be performed in an order other than that illustrated herein.
The data watermark is information which is embedded into data by a data copyright attribution party and used for carrying out copyright tracing. Generally, the information has a certain privacy and is not displayed externally. When data is leaked or copyright is maliciously infringed, the data attribution can complete extraction of watermark information in the data according to a series of extraction algorithms corresponding to the watermark embedding mode, so that ownership of the data is declared.
When the data is attacked, the watermark information can be basically not destroyed, namely, complete information extraction can be still realized through a correct extraction algorithm, and certain robustness is realized. A data watermark is typically a data which does not affect the body of the original data, but which occupies a relatively small amount of data, is implicitly embedded in a certain way in a large batch of original data carriers (e.g. in a database). Depending on the location of watermark embedding, two general categories are known: one is embedded in the header of the file and one is embedded in the relational table of the structured data.
The process mainly comprises watermark generation, watermark embedding, copyright data release, attack, watermark extraction and the like. The watermark generation is to generate the watermark to be embedded by utilizing the key information of the data attribution party and combining the original data attribute information through certain algorithms; watermark embedding is to determine the watermark data embedding position by some algorithms according to the primary key information and the key information of the original data; the issue of copyright data means that after watermark is embedded, the data has copyright information, and the processed data can be issued conveniently due to the attribution of the data; attacks refer to copyrighted data being exposed or having undergone some unauthorized operation; after the data attribution party receives the leaked or infringed data, the watermark of the data can be tried to be extracted through an extraction algorithm corresponding to a watermark embedding algorithm, and if effective information can be extracted, the data is indicated to be owned by the copyright party.
In the following embodiments, a watermark tracing processing method based on multiple nodes is provided, fig. 1 is a flowchart of the watermark tracing processing method based on multiple nodes according to an embodiment of the present application, as shown in fig. 1, and steps involved in the method in fig. 1 are described below.
Step S102, when each node adds a watermark for data, recording watermark information corresponding to the added watermark of the node, wherein the watermark information is used for carrying out inverse operation on the watermark so as to carry out watermark tracing, and the watermark tracing is used for searching a distribution source and a distribution purpose of the data; the number of nodes for watermarking is plural.
Step S104, collecting watermark information corresponding to the data recorded by each of the plurality of nodes for watermark processing, and summarizing to obtain watermark information corresponding to all the data for watermark processing.
And step S106, the watermark information corresponding to all the data is sent to each node in the plurality of nodes, wherein after each node receives the watermark tracing task, the watermark in the watermark tracing task is traced by using the watermark information corresponding to all the received data.
As an optional implementation manner, in order to ensure the transmission security of watermark information, a key corresponding to each node is generated according to the identification information of the node, when the watermark information is transmitted to the node, the watermark information is encrypted by using the key, and the encrypted watermark information is transmitted to the node, wherein the node after receiving the watermark information calculates a key for decryption according to the identification information of the node, and decrypts the watermark information by using the key for decryption.
Through the steps, the watermark tracing can be accurately performed no matter which node receives the watermark tracing task, so that the problem that the tracing failure is caused when a plurality of nodes process the watermark in the prior art is solved, and the watermark tracing process can be successfully performed when the plurality of nodes process the watermark in the data.
In the above steps, a plurality of nodes are involved, and when watermarking is performed (the watermarking may include adding watermarking and watermarking), the watermarking task may be sequentially sent to each node according to the identification information of the node, or may also be performed in a load balancing manner.
For example, before each node adds a watermark to the data, the method further comprises: acquiring the number of watermark processing tasks to be executed by each node in the plurality of nodes; selecting the node with the least number of watermark processing tasks to be executed; and transmitting the data to the node with the least number of selected tasks to add the watermark to the data.
For another example, watermark tracing tasks are received, and the number of watermark processing tasks to be executed by each node in the plurality of nodes is obtained; and selecting the node with the minimum number of watermark processing tasks to be executed, and sending the watermark tracing task to the node with the minimum number of tasks to be selected for watermark tracing.
By the load balancing mode, the processing speed of the data watermarking task can be increased.
There are a number of ways to add watermarks to data, and several examples are described below.
Data watermarking techniques implemented by desensitization.
In this technique, a character at a specific position is modified for data content (a combination of numbers or letters having a length greater than a certain value) satisfying a condition. Firstly, selecting a certain position as an embedding position of watermark information, and discarding original characters on the positions; then, the characters on the rest positions are used, and characters with the same length as the length to be embedded are obtained as watermark information after certain mapping and operation; finally, embedding the generated watermark information into the designated position to finish the embedding of the watermark information, wherein the position selection method and the calculation mode of the watermark characters can be designed into operations related to the secret key.
In the watermark extraction section, watermark embedding positions can be determined based on the key, and watermark information can be calculated based on the characters at the remaining positions and the calculation mode specified by the key. If the calculated watermark character is the same as the character at the same position in the copyright data, the watermark information is the information corresponding to the key, otherwise, the round robin key is calculated and compared.
Example 2 data watermarking techniques implemented by minimally modifying data.
In this technique, 0/1 conversion is performed on a bit-level per position with respect to data contents satisfying a condition. One common approach is a data watermarking algorithm based on statistical theory. The method is a watermark embedding method aiming at numerical type attributes. The method constrains a reasonable range of modification of the values of the numerical attributes, with the aim that modification within a controllable error range does not impair the validity of the data and cause distortion of the data.
The basic steps of this method can be summarized as follows: first, the tuple location of the watermark embedding is selected. The selection is typically done using a one-way hash function in cryptography. Specifically, a hash function is used to select a tuple to be watermarked through given watermark proportion, key, watermark strength, tuple primary key value and other parameters. The properties and bits of the embedded watermark are then determined based on the number of properties and bits that can be modified. This process may also be accomplished by modulo arithmetic using a hash function. And then, setting the value of a bit in the attribute to be embedded of the selected tuple to be 0 or 1 according to a certain watermark embedding algorithm, thus finishing the embedding of watermark information. Currently, the least significant Bit (LEAST SIGNIFICANT Bit, abbreviated as LSB) is generally used for replacement. When watermark information is extracted, the judgment of whether and what watermark exists in the data is made through most elections and according to the hypothesis test theory.
Example 3 data watermarking techniques implemented by adding dummy rows and dummy columns.
In this technique, the contents of the respective tuples and attributes of the original data are not modified, and only dummy rows (tuples) and dummy columns (attributes) are newly added on the basis of the original data.
Adding a pseudo-row watermark: and generating simulated data by restraining the data type and format of each attribute of the data with the business meaning (if any) as a value range, and then performing insertion operation on the simulated tuple according to the insertion position determined by the key. The number of pseudo rows is generally determined according to the proportion of the total number of the data tuples, and the pseudo rows are uniformly inserted; the modifiable attribute inserted into the tuple is then watermarked in a key-specified watermark calculation. When the watermark is traced, traversing the data, and if the number of the tuples conforming to the watermark is calculated to exceed a certain preset number or proportion, considering that the corresponding watermark information exists in the data.
Adding a pseudo-column watermark: the new attribute column is forged, and the generated pseudo column is required to be related to other attributes in the original data as much as possible, so that the pseudo column is not easily perceived by an attacker. The selection of pseudo-column attributes may use associative analysis in data mining or some recommendation algorithm. And then generating reasonable simulation data according to the selected attribute, and embedding watermark information into the forged new column according to the key information in a similar manner to the pseudo rows.
In example 3, since the trace source of the pseudo-row pseudo-listed file is uncertain from which node, if the trace source is the watermark task performed from the node a, the output is the file, and the trace source will issue the file generated by the watermark task to the node B, which will result in the node B performing the trace source task to be empty. In order to ensure the accuracy and the integrity of the tracing result of the watermark multi-node pseudo-line file after the access platform, when the watermark tracing task is added as the file, the nodes are not distinguished, and a node with a small number of executing tasks is searched for issuing by calculation. When running watermark task tracing, the platform can issue some fields in watermark task tables stored by all nodes to each node, wherein the issuing fields comprise: the node performs inverse operation according to the pseudo row and pseudo column added in the tracing file, matches the tracing file and then performs the watermark task to output the obtained tracing file as the generated unique tag, thereby finding the distribution source and the distribution destination, and tracing successfully.
Corresponding to the steps in fig. 1 and the scheme in example 3, adding a watermark to the data comprises: generating simulation data according to the data type and the data format of each field in the data table when the data is the data table; and inserting the simulation data into the table, wherein the simulation data is one or more rows of data, and/or one or more columns of data, the one or more rows of data are pseudo rows of data, and the one or more columns of data are pseudo columns of data.
The sending watermark information corresponding to all data to each node in the plurality of nodes comprises: transmitting a predetermined field in a watermark task table corresponding to the data to each node in the plurality of nodes, wherein the predetermined field comprises: identification information for uniquely identifying each piece of data under the predetermined field, identification information of a distribution source, and identification information of a distribution destination.
As an optional implementation manner, for the node receiving the watermark tracing task, performing inverse operation according to the added pseudo-row data and/or pseudo-column data, and matching watermark information corresponding to the watermark tracing task; and searching a distribution source and a distribution destination through the identification information of each piece of data in the watermark information.
In this embodiment, there is provided an electronic device including a memory in which a computer program is stored, and a processor configured to run the computer program to perform the method in the above embodiment.
The above-described programs may be run on a processor or may also be stored in memory (or referred to as computer-readable media), including both permanent and non-permanent, removable and non-removable media, and information storage may be implemented by any method or technique. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device.
These computer programs may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks and/or block diagram block or blocks, and corresponding steps may be implemented in different modules.
Such an apparatus or system is provided in this embodiment. The system is called a multi-node-based watermark tracing processing system, and comprises: the system comprises a recording module, a data distribution module and a data distribution module, wherein the recording module is used for recording watermark information corresponding to the watermark added by each node when the watermark is added to the data by the node, wherein the watermark information is used for carrying out inverse operation on the watermark so as to carry out watermark tracing, and the watermark tracing is used for searching a distribution source and a distribution purpose of the data; the plurality of nodes are used for watermark processing; the summarizing module is used for collecting watermark information corresponding to data recorded by each node in the plurality of nodes for watermark processing and summarizing the watermark information to obtain watermark information corresponding to all the data for watermark processing; and the sending module is used for sending the watermark information corresponding to all the data to each node in the plurality of nodes, wherein after each node receives the watermark tracing task, the watermark in the watermark tracing task is traced by using the watermark information corresponding to all the received data.
The system or the device is used for realizing the functions of the method in the above embodiment, and each module in the system or the device corresponds to each step in the method, which has been described in the method, and will not be described herein.
Optionally, the sending module is further configured to: acquiring the number of watermark processing tasks to be executed by each node in the plurality of nodes; selecting the node with the least number of watermark processing tasks to be executed; the data is sent to the node with the least task number to be selected to add the watermark for the data; and/or, receiving watermark tracing tasks, and obtaining the number of watermark processing tasks to be executed by each node in the plurality of nodes; and selecting the node with the minimum number of watermark processing tasks to be executed, and sending the watermark tracing task to the node with the minimum number of tasks to be selected for watermark tracing.
Optionally, the recording module is configured to: generating simulation data according to the data type and the data format of each field in the data table when the data is the data table; and inserting the simulation data into the data table, wherein the simulation data is one or more rows of data, and/or one or more columns of data, the one or more rows of data are pseudo rows of data, and the one or more columns of data are pseudo columns of data.
Optionally, the sending module is configured to: transmitting a predetermined field in a watermark task table corresponding to the data to each node in the plurality of nodes, wherein the predetermined field comprises: identification information for uniquely identifying each piece of data under the predetermined field, identification information of a distribution source, and identification information of a distribution destination.
The above embodiment has a plurality of application scenarios. The application scene comprises a scene for determining the reliability and quality of data, verifying the source of the data, maintaining the copyright of the data and searching the leakage position, and is used for data sharing.
For example, determine the data quality: the quality of data generally depends on the source of the data and its circulation process. As the volume of data transactions increases today, data is often transmitted and processed by multiple parties, which makes tracing the data more difficult. The data tracing technology can track and verify the data quality and locate the link of valuable information loss of the data.
For another example, trace back the data source: the trace back data source can identify each link of data processing, find out when and where specific data is generated, know when and where data is maliciously leaked or who steals the leaked data, and determine corresponding protection measures and solutions. The data source can be traced back, so that the occurrence of a data leakage event can be avoided, and responsibility can be rapidly determined after the occurrence.
By the embodiment, the problem that the tracing failure is caused when the plurality of nodes process the watermark in the prior art is solved, so that the tracing processing of the watermark can be successfully performed when the plurality of nodes process the watermark in the data.
The foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and variations of the present application will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. which come within the spirit and principles of the application are to be included in the scope of the claims of the present application.
Claims (10)
1. A watermark tracing processing method based on multiple nodes is characterized by comprising the following steps:
When each node adds a watermark to data, recording watermark information corresponding to the watermark added by the node, wherein the watermark information is used for carrying out inverse operation on the watermark so as to carry out watermark tracing, and the watermark tracing is used for searching a distribution source and a distribution purpose of the data; the plurality of nodes are used for watermark processing;
Collecting watermark information corresponding to data recorded by each node in a plurality of nodes for watermark processing, and summarizing to obtain watermark information corresponding to all data for watermark processing;
and sending watermark information corresponding to all data to each node in the plurality of nodes, wherein each node uses the watermark information corresponding to all the received data to trace the watermark in the watermark tracing task after receiving the watermark tracing task.
2. The method of claim 1, wherein the step of determining the position of the substrate comprises,
Before each node adds a watermark to the data, the method further comprises: acquiring the number of watermark processing tasks to be executed by each node in the plurality of nodes; selecting the node with the least number of watermark processing tasks to be executed; the data is sent to the node with the least task number to be selected to add the watermark for the data;
and/or the number of the groups of groups,
Receiving watermark tracing tasks, and acquiring the number of watermark processing tasks to be executed by each node in the plurality of nodes; and selecting the node with the minimum number of watermark processing tasks to be executed, and sending the watermark tracing task to the node with the minimum number of tasks to be selected for watermark tracing.
3. The method of claim 1, wherein adding a watermark to the data comprises:
Generating simulation data according to the data type and the data format of each field in the data table when the data is the data table;
and inserting the simulation data into the data table, wherein the simulation data is one or more rows of data, and/or one or more columns of data, the one or more rows of data are pseudo rows of data, and the one or more columns of data are pseudo columns of data.
4. A method according to claim 3, wherein transmitting watermark information corresponding to all data to each of the plurality of nodes comprises:
transmitting a predetermined field in a watermark task table corresponding to the data to each node in the plurality of nodes, wherein the predetermined field comprises: identification information for uniquely identifying each piece of data under the predetermined field, identification information of a distribution source, and identification information of a distribution destination.
5. A multi-node-based watermark tracing processing system, comprising:
The system comprises a recording module, a data distribution module and a data distribution module, wherein the recording module is used for recording watermark information corresponding to the watermark added by each node when the watermark is added to the data by the node, wherein the watermark information is used for carrying out inverse operation on the watermark so as to carry out watermark tracing, and the watermark tracing is used for searching a distribution source and a distribution purpose of the data; the plurality of nodes are used for watermark processing;
the summarizing module is used for collecting watermark information corresponding to data recorded by each node in the plurality of nodes for watermark processing and summarizing the watermark information to obtain watermark information corresponding to all the data for watermark processing;
And the sending module is used for sending the watermark information corresponding to all the data to each node in the plurality of nodes, wherein after each node receives the watermark tracing task, the watermark in the watermark tracing task is traced by using the watermark information corresponding to all the received data.
6. The system of claim 5, wherein the transmitting module is further configured to:
Acquiring the number of watermark processing tasks to be executed by each node in the plurality of nodes; selecting the node with the least number of watermark processing tasks to be executed; the data is sent to the node with the least task number to be selected to add the watermark for the data;
and/or the number of the groups of groups,
Receiving watermark tracing tasks, and acquiring the number of watermark processing tasks to be executed by each node in the plurality of nodes; and selecting the node with the minimum number of watermark processing tasks to be executed, and sending the watermark tracing task to the node with the minimum number of tasks to be selected for watermark tracing.
7. The system of claim 5, wherein the recording module is configured to:
Generating simulation data according to the data type and the data format of each field in the data table when the data is the data table;
and inserting the simulation data into the data table, wherein the simulation data is one or more rows of data, and/or one or more columns of data, the one or more rows of data are pseudo rows of data, and the one or more columns of data are pseudo columns of data.
8. The system of claim 7, wherein the transmitting module is configured to:
transmitting a predetermined field in a watermark task table corresponding to the data to each node in the plurality of nodes, wherein the predetermined field comprises: identification information for uniquely identifying each piece of data under the predetermined field, identification information of a distribution source, and identification information of a distribution destination.
9. An electronic device includes a memory and a processor; wherein the memory is for storing one or more computer instructions, wherein the one or more computer instructions are executed by the processor to implement the method steps of any of claims 1 to 4.
10. A readable storage medium having stored thereon computer instructions which, when executed by a processor, implement the method steps of any of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410309913.5A CN117909943B (en) | 2024-03-19 | 2024-03-19 | Watermark tracing processing method and system based on multiple nodes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410309913.5A CN117909943B (en) | 2024-03-19 | 2024-03-19 | Watermark tracing processing method and system based on multiple nodes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117909943A true CN117909943A (en) | 2024-04-19 |
| CN117909943B CN117909943B (en) | 2024-05-28 |
Family
ID=90685468
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410309913.5A Active CN117909943B (en) | 2024-03-19 | 2024-03-19 | Watermark tracing processing method and system based on multiple nodes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117909943B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107992727A (en) * | 2017-12-11 | 2018-05-04 | 北京安华金和科技有限公司 | A kind of watermark processing realized based on legacy data deformation and data source tracing method |
| US20200250338A1 (en) * | 2015-12-01 | 2020-08-06 | Privitar Limited | Digital watermarking without significant information loss in anonymized datasets |
| CN111711597A (en) * | 2020-04-16 | 2020-09-25 | 武汉大学 | Tor dark network user tracing method and system based on time slot stream watermark |
| CN114637970A (en) * | 2022-03-21 | 2022-06-17 | 中国银行股份有限公司 | Digital watermark identification method and device based on block chain |
| CN116861378A (en) * | 2023-06-16 | 2023-10-10 | 南京邮电大学 | Program watermark embedding and extracting method and system for code tracing |
| CN116915519A (en) * | 2023-09-14 | 2023-10-20 | 北京华云安信息技术有限公司 | Method, device, equipment and storage medium for tracing data stream |
| CN117290824A (en) * | 2023-03-24 | 2023-12-26 | 杭州熙羚信息技术有限公司 | Anti-interference type hidden watermark and tracing method and system |
-
2024
- 2024-03-19 CN CN202410309913.5A patent/CN117909943B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200250338A1 (en) * | 2015-12-01 | 2020-08-06 | Privitar Limited | Digital watermarking without significant information loss in anonymized datasets |
| CN107992727A (en) * | 2017-12-11 | 2018-05-04 | 北京安华金和科技有限公司 | A kind of watermark processing realized based on legacy data deformation and data source tracing method |
| CN111711597A (en) * | 2020-04-16 | 2020-09-25 | 武汉大学 | Tor dark network user tracing method and system based on time slot stream watermark |
| CN114637970A (en) * | 2022-03-21 | 2022-06-17 | 中国银行股份有限公司 | Digital watermark identification method and device based on block chain |
| CN117290824A (en) * | 2023-03-24 | 2023-12-26 | 杭州熙羚信息技术有限公司 | Anti-interference type hidden watermark and tracing method and system |
| CN116861378A (en) * | 2023-06-16 | 2023-10-10 | 南京邮电大学 | Program watermark embedding and extracting method and system for code tracing |
| CN116915519A (en) * | 2023-09-14 | 2023-10-20 | 北京华云安信息技术有限公司 | Method, device, equipment and storage medium for tracing data stream |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117909943B (en) | 2024-05-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP2020511059A (en) | Information authentication method and system | |
| CN110688675B (en) | Data leakage tracing device and method based on privacy protection and readable storage medium | |
| US20050021966A1 (en) | Method and system for sustainable digital watermarking | |
| Camara et al. | Distortion‐Free Watermarking Approach for Relational Database Integrity Checking | |
| US11003747B2 (en) | Salting text in database tables, text files, and data feeds | |
| US11321431B2 (en) | Data processing, watermark embedding and watermark extraction | |
| CN109840401A (en) | For the watermark embedding method of data text | |
| US11983789B1 (en) | Generation method, detection method, generation device, and detection device of zero watermarking for trajectory data, and storage medium | |
| Sonnleitner | A robust watermarking approach for large databases | |
| CN117909943B (en) | Watermark tracing processing method and system based on multiple nodes | |
| CN116702103A (en) | Database watermark processing method, database watermark tracing method and device | |
| CN109064379B (en) | Digital watermark marking method and digital watermark verifying device | |
| Shah et al. | Query preserving relational database watermarking | |
| US11699209B2 (en) | Method and apparatus for embedding and extracting digital watermarking for numerical data | |
| CN110866858B (en) | Watermark embedding method, watermark embedding device, query data providing device, and data processing method | |
| CN114298882A (en) | Watermark embedding method and tracing method for CAD data and electronic equipment | |
| CN114491427A (en) | Method for embedding single data watermark into multiple database tables | |
| Yuan et al. | Verify a valid message in single tuple: A watermarking technique for relational database | |
| Alghamdi et al. | A novel database watermarking technique using blockchain as trusted third party | |
| CN117272333B (en) | Relational database watermark embedding and tracing method | |
| US20190354711A1 (en) | Method for inserting data on-the-fly into a watermarked database and associated device | |
| CN115296821B (en) | Data processing system for digital collection management | |
| CN114564704B (en) | Minimum distortion relational database watermarking method based on bit hiding | |
| Murugan et al. | A robust watermarking technique for copyright protection for relational databases | |
| KR102578606B1 (en) | Fingerprinting apparatus and method for storing and sharing data in the cloud |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |