A Multi-Party Joint Data Watermarking Structure and Method

Abstract

This invention provides a multi-party collaborative data watermarking structure and method, including a key management module comprising a task receiver and a key generator, wherein the task receiver manages the correspondence between keys and tasks; and a watermarking module comprising a root key identification module, a preceding key reading module, and a new watermarking module. The root key identification module identifies the root key of the watermark, i.e., the first key to add the watermark; the preceding key reading module reads the different keys added to this root key sequentially; and the new watermarking module generates a watermark from the key generated by the key management module and adds it to the data. This technical solution is used to mark the multi-party transmission process, forming a parallel, serial watermark chain.

Description

Technical Field

[0001] This invention relates to the field of information technology, and in particular to a multi-party collaborative data watermarking structure and method. Background Technology

[0002] Data has become a crucial driver of my country's economic development. Our company's marketing department possesses massive amounts of customer data, which circulates not only within internal departments but also with government departments such as industry and commerce bureaus and courts, as well as enterprises and institutions in the financial, energy, and internet sectors. Once data is shared externally, management and control of the data shifts, making it difficult to pinpoint responsibility in the event of a data breach. If responsibility cannot be clearly defined, it fails to deter data security responsibilities and severely limits the incentive for data managers to share data. Therefore, preventing data breaches as much as possible and strengthening the ability to determine accountability after a breach is essential.

[0003] Data watermarking, as a primary technology for traceability, has garnered widespread attention. Digital watermarking technology involves directly embedding identifying information (i.e., the digital watermark) into digital carriers (including multimedia, documents, software, etc.) or indirectly representing it (modifying the structure of specific areas), without affecting the original carrier's usability or making it difficult to detect or modify again. However, it can be identified and recognized by the producer. Based on the carrier, digital watermarking can be categorized into multimedia file-based watermarking, database-based watermarking, and electronic document-based watermarking. Multimedia file-based watermarking mainly includes spatial domain-based and frequency domain-based watermark embedding methods. Spatial domain-based methods are further divided into histogram translation and integer transformation methods. Database-based watermarking mainly includes traditional robust database watermarking and reversible database watermarking. Robust database watermarking is further divided into spatial domain-based and frequency domain-based methods. Electronic document-based watermarking primarily embeds hidden information by altering the attributes of the original text through specific transformations. Based on the levels involved in the transformations, we can classify the transformation methods into three types: transformations based on synonyms and phrase substitutions, syntactic transformations, and semantic transformations. Digital watermarking is an effective way to protect information security and achieve anti-counterfeiting and traceability. It is an important branch and research direction in the field of information hiding technology. Summary of the Invention

[0004] In view of this, the purpose of this invention is to provide a multi-party joint data watermarking structure and method for marking the sending and transmission process of multiple parties, forming a parallel and serial watermark chain.

[0005] To achieve the above objectives, the present invention adopts the following technical solution: a multi-party joint data watermarking structure, comprising:

[0006] Key management module: includes task receiver and key generator. The task receiver manages the correspondence between keys and tasks. The task is specific personnel information or specific data distribution or reception task. The key generator generates random or pseudo-random key strings.

[0007] The watermarking module includes a root key identification module, a preceding key reading module, and a new watermarking module. The root key identification module identifies the root key of the watermark, which is the first key to add the watermark. The preceding key reading module reads the different keys added to this root key in sequence. The new watermarking module generates a watermark from the key generated by the key management module and adds it to the data.

[0008] In a preferred embodiment, a watermark structure is further included; the watermark structure specifically comprises: a set of watermarks on a piece of data, consisting of multiple watermark chains; a watermark chain consists of a first flag, a root watermark, multiple chain watermarks, and an end flag; the first flag and the end flag are the first and last flags of this watermark chain, used to distinguish the watermark from other data; the root watermark is the first watermark; and the chain watermark is a subsequent watermark following a certain root watermark.

[0009] A single watermark consists of a key sequence, key segments, a checksum, and a watermark terminator. A key is decomposed into different key segments and placed in different watermarks. The key sequence refers to the position of the key segment in the key. The key segment is the key fragment decomposed into the watermark. The checksum is used to verify the validity of the watermark data. The watermark terminator distinguishes different watermarks.

[0010] This invention also provides a method for adding multi-party joint data watermarks, characterized by employing the aforementioned multi-party joint data watermarking structure; including the following steps:

[0011] Step 1: Different units {D1, D2, ...} generate different watermark root keys {G1, G2, ...} and distribute their own root keys to subordinate units;

[0012] Step 2: When distributing one or more data items, {D1, D2, ...} generate and add root watermarks {K1, K2, ...} based on their own root keys, forming a watermark chain {S1, S2, ...} which is then added to the data.

[0013] Step 3: When the subordinate units of {D1, D2, ...} obtain or distribute data, they generate their own keys {M1, M2, ...} based on the obtained root key, and add them to their respective watermark chains {S1, S2, ...} as chain watermarks.

[0014] Step 4: Repeat step 2 in sequence.

[0015] Compared with the prior art, the present invention has the following beneficial effects: the present invention uses a multi-party joint data watermarking method to distinguish the acquisition and distribution of data by different subjects, thereby realizing the monitoring of data flow. Attached Figure Description

[0016] Figure 1 This is a schematic diagram of the digital watermarking architecture of a preferred embodiment of the present invention;

[0017] Figure 2 This is a preferred embodiment of the watermark structure diagram (I) of the present invention;

[0018] Figure 3 This is a watermark structure diagram (II) of a preferred embodiment of the present invention. Detailed Implementation

[0019] The present invention will be further described below with reference to the accompanying drawings and embodiments.

[0020] It should be noted that the following detailed descriptions are illustrative and intended to provide further explanation of this application. Unless otherwise specified, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application pertains.

[0021] It should be noted that the terminology used herein is for the purpose of describing particular implementations only and is not intended to limit the exemplary implementations according to this application; as used herein, the singular form is intended to include the plural form as well, unless the context clearly indicates otherwise; furthermore, it should be understood that when the terms “comprising” and / or “including” are used in this specification, they indicate the presence of features, steps, operations, devices, components and / or combinations thereof.

[0022] This technical solution is implemented through a specific digital watermarking architecture. The architecture is as follows: Figure 1 As shown, it has the following structure:

[0023] Key management module: This module includes a task receiver and a key generator. The task receiver manages the mapping between keys and tasks. Tasks can be specific personnel information or specific data distribution or reception tasks. The key generator generates random or pseudo-random key strings.

[0024] The watermarking module comprises three sub-modules: root key identification, preceding key reading, and new watermark addition. The root key identification module identifies the root key of the watermark, i.e., the first key used to add the watermark. The preceding key reading module reads the different keys added to this root key sequentially. The new watermark addition module generates a watermark from the key generated by the key management module and adds it to the data.

[0025] This technical solution achieves its purpose through a specific digital watermark structure, such as... Figure 2 , Figure 3 As shown:

[0026] A watermark set on a piece of data consists of multiple watermark chains. A watermark chain comprises a first flag, a root watermark, multiple chain watermarks, and an end flag. The first and end flags are the starting and ending markers of this watermark chain, used to distinguish the watermark from other data. The root watermark is the first watermark. Chain watermarks are subsequent watermarks that follow a given root watermark.

[0027] The structure of a single watermark is shown below. Figure 3 A watermark consists of a key sequence, key segments, a checksum, and a watermark terminator. Typically, a key is broken down into different key segments and placed in different watermarks. The key sequence refers to the position of the key segment within the key, the key segment is the fragment of the key within the watermark, the checksum is used to verify the validity of the watermark data, and the watermark terminator distinguishes different watermarks.

[0028] Method and Flow

[0029] The basic process of this method is as follows:

[0030] Step 1: Different units {D1, D2, ...} generate different watermark root keys {G1, G2, ...} and distribute their own root keys to subordinate units.

[0031] Step 2: When distributing one or more data items, {D1, D2, ...} generate and add root watermarks {K1, K2, ...} based on their own root keys, forming a watermark chain {S1, S2, ...} which is then added to the data.

[0032] Step 3: When the subordinate units of {D1, D2, ...} obtain or distribute data, they generate their own keys {M1, M2, ...} according to the obtained root key, and add them to their respective watermark chains {S1, S2, ...} as chain watermarks.

[0033] Step 4: Repeat step 2 in sequence.

Claims

1. A method for adding a watermark structure based on a multi-party joint data watermark structure, characterized in that, The multi-party joint data watermarking structure includes a key management module, which comprises a task receiver and a key generator. The task receiver manages the correspondence between keys and tasks. The task is specific personnel information or a specific data distribution or receiving task. The key generator generates random or pseudo-random key strings. The watermarking module includes a root key identification module, a preceding key reading module, and a new watermarking module. The root key identification module identifies the root key of the watermark, which is the first key to add the watermark. The preceding key reading module reads the different keys added to this root key in sequence. The new watermarking module generates a watermark from the key generated by the key management module and adds it to the data. It also includes a watermark structure; the watermark structure is specifically: a set of watermarks on a piece of data, consisting of multiple watermark chains; a watermark chain consists of a first flag, a root watermark, multiple chain watermarks, and an end flag; the first flag and the end flag are the first and last flags of this watermark chain, used to distinguish the watermark from other data; the root watermark is the first watermark; chain watermarks are subsequent watermarks following a certain root watermark; A single watermark consists of a key sequence, key segments, a checksum, and a watermark terminator. A key is decomposed into different key segments and placed in different watermarks. The key sequence refers to the position of the key segment in the key. The key segment is the key fragment decomposed into the watermark. The checksum is used to verify the validity of the watermark data. The watermark terminator distinguishes different watermarks. The method for adding the watermark structure includes the following steps: Step 1: Different units {D1, D2, ...} generate different watermark root keys {G1, G2, ...} and distribute their own root keys to subordinate units; Step 2: When distributing one or more data items, {D1, D2, ...} generate and add root watermarks {K1, K2, ...} based on their own root keys, forming a watermark chain {S1, S2, ...} which is then added to the data. Step 3: When the subordinate units of {D1, D2, ...} obtain or distribute data, they generate their own keys {M1, M2, ...} based on the obtained root key, and add them to their respective watermark chains {S1, S2, ...} as chain watermarks. Step 4: Repeat step 2 in sequence.

Images