WO2024066271A1 - Procédé et appareil d'incorporation de filigrane de base de données, procédé et appareil de traçage de filigrane de base de données, et dispositif électronique - Google Patents

Procédé et appareil d'incorporation de filigrane de base de données, procédé et appareil de traçage de filigrane de base de données, et dispositif électronique Download PDF

Info

Publication number
WO2024066271A1
WO2024066271A1 PCT/CN2023/085945 CN2023085945W WO2024066271A1 WO 2024066271 A1 WO2024066271 A1 WO 2024066271A1 CN 2023085945 W CN2023085945 W CN 2023085945W WO 2024066271 A1 WO2024066271 A1 WO 2024066271A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
preset
zero
binary
embedding
Prior art date
Application number
PCT/CN2023/085945
Other languages
English (en)
Chinese (zh)
Inventor
刘睿民
丁若冰
张锦
Original Assignee
北京柏睿数据技术股份有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 北京柏睿数据技术股份有限公司 filed Critical 北京柏睿数据技术股份有限公司
Publication of WO2024066271A1 publication Critical patent/WO2024066271A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/21—Design, administration or maintenance of databases
    • G06F16/211—Schema design and management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2255—Hash tables
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2282—Tablespace storage structures; Management thereof

Definitions

  • the present application relates to the field of database technology, and more specifically, to a database watermark embedding method, a source tracing method, a device and an electronic device.
  • Database watermarking technology uses covert means to embed watermark information such as copyright descriptions and user identities into table data and file data without affecting the use of the original data, thereby solving the technical problem of data leakage that cannot be traced during data sharing, distribution, and use, and ensuring data security during data sharing, distribution, and use, thereby enhancing the value of data sharing.
  • the algorithm for implementing database watermarking is usually based on the different types of data. Different transformation algorithms are used to make imperceptible transformations on the data, thereby hiding the watermark data in the specific data and completing the embedding of the database watermark.
  • the backtracking algorithm corresponding to the algorithm type is used to restore the watermark information, thereby realizing data tracing in cases of data leakage.
  • this method of implementing database watermarks based on different transformation algorithms and backtracking algorithms solves the technical problem that data leakage data cannot be traced, this method requires the use of different transformation algorithms to transform different types of data, and has poor generality.
  • the watermark data is also inserted into the data and becomes a component of the data, causing the data value to change after the transformation. Users cannot directly read the value of the data and must use the backtracking method to read it, and the calculation process is relatively complicated.
  • the calculation of different algorithms requires the use of part of the computing resources of the database system, which reduces the database performance and seriously affects the data display.
  • the embodiments of the present application provide a database watermark embedding method, a traceability method, a device and an electronic device, which are used to achieve efficient database watermark embedding without affecting data display.
  • a method for embedding a database watermark comprising:
  • mapping the binary data into zero-width character string data according to a preset mapping relationship table
  • the preset length is not less than the length of the original binary number corresponding to the character, and the preset mapping relationship table is determined according to the mapping relationship between different binary numbers with preset bit numbers and different zero-width character strings.
  • the method before embedding the final encoded data as a database watermark into an embedding position corresponding to the data to be processed, the method further includes:
  • the label mark is determined in advance according to the type, length, position and attribute of the data to be processed.
  • the binary data is mapped to zero-width character string data according to a preset mapping relationship table, specifically:
  • Each group of the sub-data is mapped into a zero-width character string according to the preset mapping relationship table to obtain the zero-width character string data.
  • each character in the preliminary encoded data is converted into a binary number of a preset length to obtain binary data, specifically:
  • the binary data is obtained according to a binary number of a preset length corresponding to each of the characters.
  • the preset encoding rule includes an encoding rule corresponding to hexadecimal Unicode encoding, or decimal Unicode encoding, or hexadecimal GBK encoding, or decimal GBK encoding.
  • a method for tracing the database watermark as described in the first aspect includes:
  • Each of the characters is converted into the data to be processed according to the preset encoding rule, and the data to be processed is used as the traceability result data.
  • the embedding position is determined by a tag mark, and the tag mark is determined in advance according to the type, length, position and attribute of the data to be processed.
  • a database watermark embedding device comprising:
  • a first conversion module used to convert the data to be processed into preliminary coded data according to a preset coding rule
  • a second conversion module used for converting each character in the preliminary coded data into a binary number of a preset length and obtaining binary data
  • a first mapping module used for mapping the binary data into zero-width character string data according to a preset mapping relationship table
  • An adding module used for adding a preset zero-width character string before and after the zero-width character string data respectively to obtain final encoded data
  • An embedding module used for embedding the final encoded data as a database watermark into an embedding position corresponding to the data to be processed
  • the preset length is not less than the length of the original binary number corresponding to the character, and the preset mapping relationship table is determined according to the mapping relationship between different binary numbers with preset bit numbers and different zero-width character strings.
  • a device for tracing the source of a database watermark as described in the third aspect comprising:
  • a determination module used for determining the final encoded data according to the embedding position
  • a removal module used for removing the preset zero-width character string before and after the final encoded data and obtaining the zero-width character string data
  • a second mapping module used for mapping the zero-width character string data into the binary data according to the preset mapping relationship table
  • a third conversion module used for dividing the binary data into a plurality of groups of binary numbers according to the preset length, and converting each group of binary numbers into each character of the preliminary coded data;
  • the fourth conversion module is used to convert each of the characters into the data to be processed according to the preset encoding rule, and use the data to be processed as the tracing result data.
  • an electronic device including:
  • a memory configured to store executable instructions of the processor
  • the processor is configured to execute the embedding method described in any one of the first aspects or the tracing method described in any one of the second aspects by executing the executable instructions.
  • the data to be processed is converted into preliminary coded data according to the preset coding rules; each character in the preliminary coded data is converted into a binary number of preset length and binary data is obtained; the binary data is mapped into zero-width character string data according to the preset mapping relationship table; the preset zero-width character string is added before and after the zero-width character string data respectively to obtain the final coded data; the final coded data is embedded as a database watermark in the embedding position corresponding to the data to be processed; wherein the preset length is not less than the length of the original binary number corresponding to the character, and the preset mapping relationship table is determined according to the mapping relationship between different binary numbers of preset bits and different zero-width character strings.
  • the data to be processed is uniformly converted into preliminary coded data first, it is avoided to use different algorithms to process different types of data, thereby improving the versatility and ensuring the high performance of the database.
  • the final coded data uses a zero-width character string, which will not affect the data display after embedding the database watermark, thereby realizing efficient database watermark embedding without affecting the data display.
  • FIG1 is a schematic diagram showing a flow chart of a method for embedding a database watermark according to an embodiment of the present invention
  • FIG. 2 shows a schematic diagram of a process of tracing the source of a database watermark according to an embodiment of the present invention. picture
  • FIG3 shows a schematic diagram of the structure of a database watermark embedding device proposed in an embodiment of the present invention
  • FIG. 4 shows a schematic structural diagram of a database watermark source tracing device according to an embodiment of the present invention.
  • FIG5 shows a block diagram of an electronic device according to an embodiment of the present invention.
  • the present application embodiment provides a method for embedding a database watermark, as shown in FIG1 , the method comprising the following steps:
  • Step S101 converting the data to be processed into preliminary coded data according to a preset coding rule.
  • the data to be processed may be sensitive data specified by the user.
  • the user may determine the sensitive data by defining keywords or metadata information and then matching the keywords or metadata information; or may define regular expressions according to the structural composition rules of sensitive data by studying the characteristics of sensitive data, and then determine the sensitive data by matching the regular expressions.
  • the data to be processed may include a variety of characters, such as text, numbers, letters, punctuation marks, graphic symbols, etc.
  • the preset encoding rule is a general encoding rule that can uniformly encode different types of characters in the data to be processed.
  • the data to be processed can be converted into preliminary encoded data according to the preset encoding rule.
  • the preset encoding rules include encoding rules corresponding to hexadecimal Unicode encoding, or decimal Unicode encoding, or hexadecimal GBK encoding, or decimal GBK encoding.
  • Unicode is a unified code, which is a character encoding scheme developed by an international organization that can accommodate all the characters and symbols in the world.
  • GBK Choinese Internal Code Specification
  • English uses single-byte encoding, which is fully compatible with ASCII character encoding
  • the Chinese part uses double-byte encoding.
  • the preset encoding rule can use the encoding rule corresponding to the decimal or hexadecimal Unicode encoding, or the encoding rule corresponding to the decimal or hexadecimal GBK encoding.
  • Step S102 converting each character in the preliminary encoded data into a binary number of a preset length to obtain binary data.
  • each character in the preliminary coded data needs to be converted into a binary number of a preset length to achieve normalization of the preliminary coded data.
  • the preset length is not less than the length of the original binary number corresponding to the character.
  • each character in the preliminary encoded data is converted into a binary number of a preset length to obtain binary data, specifically:
  • the binary data is obtained according to a binary number of a preset length corresponding to each of the characters.
  • each character is first converted into a binary number in sequence to obtain an original binary number corresponding to each character.
  • the length of the original binary number may not reach the preset length. If the length of the original binary number is less than the preset length, zeros are added before the highest bit of the original binary number to make the length of the original binary number reach the preset length.
  • binary data is formed according to the binary numbers of each preset length. For example, if the preset length is 8 bits and the original binary number is 6 bits, two zeros are added before the highest bit of the original binary number.
  • the preset length may be 8 bits or 16 bits.
  • Step S103 Map the binary data into zero-width character string data according to a preset mapping relationship table.
  • the preset mapping relationship table is determined according to the mapping relationship between different binary numbers and different zero-width character strings according to the preset number of bits.
  • the zero-width character string consists of zero-width characters, which are non-printable Unicode characters with a byte width of 0. They are invisible but real characters that represent a certain control function in browsers and general text editors.
  • Binary data can be mapped to zero-width character string data according to the preset mapping relationship table.
  • the preset mapping relationship table can be as follows: As shown in Table 1.
  • the binary data is mapped to zero-width character string data according to a preset mapping relationship table, specifically:
  • Each group of the sub-data is mapped into a zero-width character string according to the preset mapping relationship table to obtain the zero-width character string data.
  • the binary data is first grouped according to a preset number of bits to obtain multiple groups of sub-data, and then a preset mapping relationship table is queried according to each group of sub-data, and each zero-width character string is determined according to the query result, so as to map each group of sub-data to zero-width character string data.
  • the preset number of bits is 2, and those skilled in the art may also adopt other preset number of bits according to actual needs.
  • Step S104 adding a preset zero-width character string before and after the zero-width character string data to obtain final encoded data.
  • Step S105 embed the final encoded data as a database watermark into an embedding position corresponding to the data to be processed.
  • the data to be processed corresponds to an embedding position, which can be a position specified by the user.
  • the final encoded data can be fixed or it can be the data to be processed itself, and the final encoded data can be embedded in the embedding position as a database watermark.
  • the method before embedding the final encoded data as the database watermark into the embedding position corresponding to the data to be processed, the method further includes:
  • the label mark is determined in advance according to the type, length, position and attribute of the data to be processed.
  • the label mark is determined in advance according to the type, length, position and attribute of the data to be processed, and the embedding position of the database watermark can be determined according to the label mark.
  • a hash algorithm can be used to process the type, length, position and attribute of the data to be processed, and a label mark is obtained according to the processing result.
  • the data to be processed is converted into preliminary coded data according to the preset coding rules; each character in the preliminary coded data is converted into a binary number of preset length and binary data is obtained; the binary data is mapped into zero-width character string data according to the preset mapping relationship table; the preset zero-width character string is added before and after the zero-width character string data respectively to obtain the final coded data; the final coded data is embedded as a database watermark in the embedding position corresponding to the data to be processed; wherein the preset length is not less than the length of the original binary number corresponding to the character, and the preset mapping relationship table is determined according to the mapping relationship between different binary numbers of preset bits and different zero-width character strings.
  • the data to be processed is uniformly converted into preliminary coded data first, it is avoided to use different algorithms to process different types of data, thereby improving the versatility and ensuring the high performance of the database.
  • the final coded data uses a zero-width character string, which will not affect the data display after embedding the database watermark, thereby realizing efficient database watermark embedding without affecting the data display.
  • the present application also proposes a database watermark tracing method, as shown in FIG2 , the method comprising the following steps:
  • Step S201 determining the final encoded data according to the embedding position.
  • the embedded position can be obtained according to the tracing instruction input by the user.
  • Step S202 removing the preset zero-width character strings before and after the final encoded data and obtaining the zero-width character string data.
  • Step S203 Map the zero-width character string data to the binary data according to the preset mapping relationship table.
  • Step S204 dividing the binary data into multiple groups of binary numbers according to the preset length, and converting each group of binary numbers into each character of the preliminary coded data.
  • Step S205 convert each of the characters into the data to be processed according to the preset encoding rule, and use the data to be processed as the tracing result data.
  • the embedding position is determined by a tag mark, and the tag mark is pre-determined according to the type, length, position and attribute of the data to be processed.
  • the traceability instruction input by the user may include the tag mark.
  • the final encoded data is determined according to the embedding position; the preset zero-width character strings before and after the final encoded data are removed to obtain zero-width character string data; the zero-width character string data is mapped to binary data according to a preset mapping relationship table; the binary data is divided into multiple groups of binary numbers according to a preset length, and each group of binary numbers is converted into each character of the preliminary encoded data; each character is converted into data to be processed according to a preset encoding rule, and the data to be processed is used as the traceability result data, so that the traceability of the database watermark can be achieved with only a simple mapping, and the high performance of the database is guaranteed.
  • the present application provides a method for embedding a database watermark, comprising the following steps:
  • Step S301 receiving the data to be processed R0, and encoding it according to the encoding rules corresponding to the hexadecimal Unicode encoding to obtain preliminary encoded data R1.
  • each character in the data to be processed is converted into hexadecimal Unicode encoding, and the encoding rule can be shown in Table 2.
  • Step S302 character normalization.
  • Step S303 using zero-width string encoding.
  • the data in R2 is converted into a zero-width string for every two digits, where 00 is converted into ⁇ u200b, 01 is converted into ⁇ u200c, 10 is converted into ⁇ u200d, and 11 is converted into ⁇ u200e, to obtain zero-width string data R3.
  • Step S304 adding prefixes and suffixes.
  • Step S305 embed R4 as a database watermark into an embedding position corresponding to the data to be processed.
  • the present application provides a method for tracing the source of a database watermark, comprising the following steps:
  • Step S401 determining final encoded data according to the embedding position.
  • Step S402 remove the prefix and suffix.
  • Step S403 decoding the zero-width character string data.
  • R3 is converted into binary data R2.
  • Step S404 restoring to preliminary coded data.
  • Step S405 convert R1 into the data to be processed R0, and use the data to be processed R0 as the traceability result data.
  • the hexadecimal R1 is converted according to the Unicode comparison table to obtain R0.
  • the final encoded data is ⁇ uFEFF[S3 result] ⁇ uFEFF.
  • the database watermark embedded in the data is:
  • Step S601 extracting the final encoded data.
  • Step S602 remove the prefix and suffix.
  • Step S603 Decode zero-width string
  • Step S604 restore to hexadecimal Unicode encoding.
  • Step S605 restore S1 to original information.
  • the embodiment of the present application also proposes a database watermark embedding device, as shown in FIG3 , the device includes:
  • the first conversion module 301 is used to convert the data to be processed into preliminary coded data according to a preset coding rule
  • a second conversion module 302 used to convert each character in the preliminary encoded data into a binary number of a preset length and obtain binary data
  • a first mapping module 303 configured to map the binary data into zero-width character string data according to a preset mapping relationship table
  • An adding module 304 is used to add a preset zero-width character string before and after the zero-width character string data to obtain final encoded data;
  • An embedding module 305 used for embedding the final encoded data as a database watermark into an embedding position corresponding to the data to be processed;
  • the preset length is not less than the length of the original binary number corresponding to the character, and the preset mapping relationship table is determined according to the mapping relationship between different binary numbers with preset bit numbers and different zero-width character strings.
  • the embodiment of the present application further proposes a database watermark tracing device, as shown in FIG4 , the device includes:
  • a determination module 401 configured to determine the final encoded data according to the embedding position
  • a removal module 402 used for removing the preset zero-width character string before and after the final encoded data and obtaining the zero-width character string data
  • a second mapping module 403, configured to map the zero-width character string data into the binary data according to the preset mapping relationship table
  • a third conversion module 404 configured to divide the binary data into a plurality of groups of binary numbers according to the preset length, and convert each group of binary numbers into each character of the preliminary coded data;
  • the fourth conversion module 405 is used to convert each of the characters into the data to be processed according to the preset encoding rule, and use the data to be processed as the tracing result data.
  • the embodiment of the present invention further provides an electronic device, as shown in FIG5 , including a processor 501, a communication interface 502, a memory 503 and a communication bus 504, wherein the processor 501, the communication interface 502, and the memory 503 communicate with each other via the communication bus 504.
  • the processor 501 is configured to execute, by executing the executable instructions:
  • mapping the binary data into zero-width character string data according to a preset mapping relationship table
  • the preset length is not less than the length of the original binary number corresponding to the character, and the preset mapping relationship table is determined according to the mapping relationship between different binary numbers with preset bit numbers and different zero-width character strings.
  • Each of the characters is converted into the data to be processed according to the preset encoding rule, and the data to be processed is used as the traceability result data.
  • the communication bus can be a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus.
  • the communication bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one thick line is used in the figure, but it does not mean that there is only one bus or one type of bus.
  • the communication interface is used for communication between the above electronic device and other devices.
  • the memory may include RAM (Random Access Memory), or may include a non-volatile memory, such as at least one disk storage.
  • the memory may also be at least one storage device located away from the aforementioned processor.
  • processors can be general-purpose processors, including CPU (Central Processing Unit), NP (Network Processor), etc.; they can also be DSP (Digital Signal Processing), ASIC (Application Specific Integrated Circuit), FPGA (Field-Programmable Gate Array) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.
  • CPU Central Processing Unit
  • NP Network Processor
  • DSP Digital Signal Processing
  • ASIC Application Specific Integrated Circuit
  • FPGA Field-Programmable Gate Array
  • Other programmable logic devices discrete gate or transistor logic devices, discrete hardware components.
  • a computer-readable storage medium in which a computer program is stored.
  • the computer program is executed by a processor, the database watermark embedding method or database watermark tracing method as described above is implemented.
  • a computer program product including instructions is provided.
  • the computer program product When the computer program product is run on a computer, the computer executes the database watermark embedding method or database watermark tracing method as described above.
  • all or part of the embodiments may be implemented by software, hardware, firmware, or any combination thereof.
  • all or part of the embodiments may be implemented in the form of a computer program product.
  • the computer program product includes one or more computer instructions.
  • the computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device.
  • the computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium.
  • the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line) or wireless (e.g., infrared, wireless, microwave, etc.) means.
  • the computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integrated therein.
  • the available medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state hard disk), etc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Editing Of Facsimile Originals (AREA)

Abstract

La présente invention divulgue un procédé et un appareil d'incorporation de filigrane de base de données, un procédé et un appareil de traçage de filigrane de base de données, et un dispositif électronique. Le procédé d'incorporation consiste à : convertir des données à traiter en données préalablement codées selon une règle de codage prédéfinie ; convertir chaque caractère contenu dans les données préalablement codées en un nombre binaire de longueur prédéfinie et obtenir des données binaires ; mapper les données binaires sur des données de chaîne de caractères de largeur nulle selon une table de relation de mappage prédéfinie ; ajouter séparément une chaîne de caractères de largeur nulle prédéfinie avant et après les données de chaîne de caractères de largeur nulle pour obtenir des données codées finales ; et incorporer les données codées finales de filigrane sous la forme d'une base de données à une position d'incorporation correspondant aux données à traiter. La longueur prédéfinie n'est pas inférieure à la longueur d'un nombre binaire d'origine correspondant au caractère, et la table de relation de mappage prédéfinie est déterminée selon les relations de mappage entre différents nombres binaires d'un bit prédéfini et différentes chaînes de caractères de largeur nulle. Par conséquent, une incorporation de filigrane de base de données efficace est obtenue tandis que la présentation des données n'est pas affectée.
PCT/CN2023/085945 2022-09-27 2023-04-03 Procédé et appareil d'incorporation de filigrane de base de données, procédé et appareil de traçage de filigrane de base de données, et dispositif électronique WO2024066271A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211179867.9A CN115495439B (zh) 2022-09-27 2022-09-27 数据库水印的嵌入方法、溯源方法、装置和电子设备
CN202211179867.9 2022-09-27

Publications (1)

Publication Number Publication Date
WO2024066271A1 true WO2024066271A1 (fr) 2024-04-04

Family

ID=84473099

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/085945 WO2024066271A1 (fr) 2022-09-27 2023-04-03 Procédé et appareil d'incorporation de filigrane de base de données, procédé et appareil de traçage de filigrane de base de données, et dispositif électronique

Country Status (2)

Country Link
CN (1) CN115495439B (fr)
WO (1) WO2024066271A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115495439B (zh) * 2022-09-27 2023-04-07 北京柏睿数据技术股份有限公司 数据库水印的嵌入方法、溯源方法、装置和电子设备
CN118643518A (zh) * 2024-08-09 2024-09-13 水发(北京)建设有限公司 工业园区污水近零排放的水资源优化配置系统及方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105205355A (zh) * 2015-11-05 2015-12-30 南通大学 一种基于语义角色位置映射的文本水印嵌入及提取方法
CN106570356A (zh) * 2016-11-01 2017-04-19 南京理工大学 基于Unicode编码的文本水印嵌入及提取方法
CN110414194A (zh) * 2019-07-02 2019-11-05 南京理工大学 一种文本水印的嵌入及提取方法
CN111986065A (zh) * 2019-05-23 2020-11-24 北京奇虎科技有限公司 一种数字水印嵌入方法及装置
CN115495439A (zh) * 2022-09-27 2022-12-20 北京柏睿数据技术股份有限公司 数据库水印的嵌入方法、溯源方法、装置和电子设备

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9087459B2 (en) * 2012-11-30 2015-07-21 The Nielsen Company (Us), Llc Methods, apparatus, and articles of manufacture to encode auxilary data into text data and methods, apparatus, and articles of manufacture to obtain encoded data from text data

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105205355A (zh) * 2015-11-05 2015-12-30 南通大学 一种基于语义角色位置映射的文本水印嵌入及提取方法
CN106570356A (zh) * 2016-11-01 2017-04-19 南京理工大学 基于Unicode编码的文本水印嵌入及提取方法
CN111986065A (zh) * 2019-05-23 2020-11-24 北京奇虎科技有限公司 一种数字水印嵌入方法及装置
CN110414194A (zh) * 2019-07-02 2019-11-05 南京理工大学 一种文本水印的嵌入及提取方法
CN115495439A (zh) * 2022-09-27 2022-12-20 北京柏睿数据技术股份有限公司 数据库水印的嵌入方法、溯源方法、装置和电子设备

Also Published As

Publication number Publication date
CN115495439A (zh) 2022-12-20
CN115495439B (zh) 2023-04-07

Similar Documents

Publication Publication Date Title
WO2024066271A1 (fr) Procédé et appareil d'incorporation de filigrane de base de données, procédé et appareil de traçage de filigrane de base de données, et dispositif électronique
CN107330306B (zh) 文本水印嵌入及提取方法、装置、电子设备及存储介质
US7665015B2 (en) Hardware unit for parsing an XML document
US7716577B2 (en) Method and apparatus for hardware XML acceleration
US7596745B2 (en) Programmable hardware finite state machine for facilitating tokenization of an XML document
US7665016B2 (en) Method and apparatus for virtualized XML parsing
CN110597814B (zh) 结构化数据的序列化、反序列化方法以及装置
WO2022142011A1 (fr) Procédé et dispositif de reconnaissance d'adresse, et support de stockage
CN110245469B (zh) 网页的水印生成方法、水印解析方法、装置及存储介质
Wang et al. A coverless plain text steganography based on character features
CN110414194B (zh) 一种文本水印的嵌入及提取方法
WO2020140636A1 (fr) Procédés et appareils d'incorporation et d'extraction de filigrane, dispositif terminal et support
TWI604318B (zh) 資料排序方法
CN112948776A (zh) 一种数字水印添加方法、装置、电子设备及存储介质
CN107526742B (zh) 用于处理多语言文本的方法和设备
Taleby Ahvanooey et al. An innovative technique for web text watermarking (AITW)
JP2012085274A (ja) テキストをマトリクスコードシンボルに符号化するコンピュータ実行方法、マトリクスコードシンボルを復号化するコンピュータ実行方法、テキストをマトリクスコードシンボルに符号化するためのエンコーダ、およびマトリクスコードシンボルを復号化するためのデコーダ
Govada et al. Text steganography with multi level shielding
CN103530574A (zh) 一种基于英文pdf文档的隐藏信息嵌入和提取方法
CN111355709A (zh) 数据验证方法、装置、电子设备及计算机可读存储介质
WO2020139563A1 (fr) Procédé de traitement d'informations, procédé d'analyse et d'incorporation d'informations masquées, appareil et dispositif
CN115982675A (zh) 文档处理方法、装置、电子设备以及存储介质
CN114880523A (zh) 字符串处理方法、装置、电子设备及存储介质
Wu et al. Coverless steganography based on english texts using binary tags protocol
Zhao et al. Research and implementation of text watermarking technology based on PDF document structure

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23869527

Country of ref document: EP

Kind code of ref document: A1