Railway sensitive data watermark tracing method based on invisible characters

Abstract

The invention discloses a railway sensitive data watermark tracing method based on invisible characters, and the method comprises the following steps: S1, watermark information preprocessing: calculating watermark information needing to be written into abstract information with a fixed length, then generating an invisible character string according to a coding rule, and then carrying out the fragmentation of the invisible character string; s2, watermark information writing: traversing result set metadata to determine a written column and a position thereof, and correspondingly writing invisible character string fragments; and S3, watermark traceability: reading the provided data set file according to rows, extracting invisible character strings, comparing the invisible character strings with pre-stored watermark information, calculating a matching degree, and outputting a traceability result. According to the method, watermark embedding and traceability of the railway sensitive data are achieved, effective protection is provided for railway data safety, an original data structure is not changed, the influence on an existing system is small, meanwhile, high universality and expandability are achieved, and the method is suitable for protection requirements of various railway sensitive data.

Description

Technical Field

[0001] The invention relates to the technical field of data security, and in particular to a railway sensitive data watermark tracing method based on invisible characters. Background Art

[0002] With the rapid development of railway informatization, China's railway system has undergone a profound digital transformation, gradually moving from traditional manual operation to intelligent and automated operation. This process has greatly improved the efficiency, safety and service quality of railway operations, but it has also brought unprecedented data security challenges. Sensitive data in the railway system covers a wide range, including but not limited to: passenger personal information, train operation and scheduling data, infrastructure maintenance records, security monitoring system data, financial transaction information, etc. Once these data are leaked or maliciously used, they may cause serious economic losses, safety hazards, and even endanger national security. Therefore, data protection has become a key factor in ensuring the safe, stable and efficient operation of the railway system.

[0003] Among many data protection technologies, data watermarking technology has received increasing attention in recent years and has shown great potential in the field of railway sensitive data protection. Data watermarking is a technology that embeds identification information into data in order to add ownership identification or tracking information to the data. Currently, the commonly used data watermarking technologies include pseudo-row watermarking, pseudo-column watermarking, data deformation watermarking, fingerprint watermarking, etc. However, these technologies have obvious limitations when applied to railway business systems. Some of them change the structure of the data set, and some require the data set to be immutable.

[0004] For example, pseudo-row watermarking technology inserts simulated data rows into the original data set, but this may lead to inconsistent data entries returned by database paging queries in business applications such as railway passenger and freight transportation, affecting the integrity and accuracy of the data. Pseudo-column watermarking technology requires adjusting the data structure to add a column, which may affect the stability and performance of the existing system. Data deformation watermarking is not applicable in scenarios without data desensitization, and may affect the accuracy and availability of railway operation data. Fingerprint watermarking requires that the data set is immutable, which conflicts with the characteristic that railway business data often needs to be updated.

[0005] The limitations of these existing technologies are particularly prominent in the railway industry. According to a work meeting held by the China Railway Corporation, by the end of 2020, China's railway operating mileage will reach about 146,300 kilometers, and the high-speed railway operating mileage will reach more than 37,900 kilometers. Such a huge railway network generates a huge amount of sensitive data, which puts higher requirements on data protection technology. At the same time, the implementation of the "Cybersecurity Law of the People's Republic of China" and the "Data Security Law of the People's Republic of China" also provides a legal basis and regulatory requirements for data protection in the railway industry.

[0006] Based on the above background, in response to the special needs of railway sensitive data protection, the present invention proposes a railway sensitive data watermark tracing method based on invisible characters. Summary of the invention

[0007] The technical problem to be solved by the present invention is to overcome the existing defects and provide a railway sensitive data watermark tracing method based on invisible characters, which realizes the watermark embedding and tracing of railway sensitive data, provides effective protection for railway data security, does not change the original data structure, has little impact on the existing system, and has strong versatility and scalability. It is suitable for the protection needs of various types of railway sensitive data and can effectively solve the problems in the background technology.

[0008] To achieve the above object, the present invention provides the following technical solution: a railway sensitive data watermark tracing method based on invisible characters, comprising the following steps: S1. Watermark information preprocessing: Calculate the watermark information to be written into summary information of fixed length, then generate invisible strings according to predefined encoding rules, store the two correspondingly, and segment the invisible strings according to the configured grouping settings; S2. Writing watermark information: traverse the result set metadata to determine the columns and positions to be written, and write the invisible string shards accordingly; S3, watermark tracing: read the provided data set file line by line, extract the invisible string, compare the extracted invisible string with the pre-stored watermark information, calculate the matching degree, and output the tracing result.

[0009] Preferably, in step S1, the watermark information is calculated using the SM3 algorithm to obtain summary information, and the summary information is a hexadecimal string of fixed length.

[0010] Preferably, in step S1, the hexadecimal string is converted into an invisible string according to a coding rule, and the coding rule is as follows: 0-\u202d, 1-\u206e, 2-\u2060, 3-\u200d, 4-\u206b, 5-\u200e, 6-\u206c, 7-\u206a, 8-\u202c, 9-\u202a, A-\u200b, B-\u202b, C-\u202e, D-\u200c, E-\u206f, F-\u206d.

[0011] Preferably, in step S1, the invisible character string grouping step is as follows: No grouping: that is, there is only one group, and the information to be written is: F + the invisible string generated in step S1; Divide into two groups: the information to be written in group 1 is 0 + 1 / 2 of the invisible string generated in step S1; the information to be written in group 2 is 1 + the remaining invisible string; Divide into three groups: the information to be written in group 1 is 0 + 1 / 3 of the invisible string generated in step S1; the information to be written in group 2 is 1 + the remaining 1 / 2 of the invisible string; the information to be written in group 3 is 2 + the remaining invisible string; The other groups are divided in the same way, and finally the invisible string in step S1 is divided into many fragments; The number of groups shall not be less than 15 (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F).

[0012] Preferably, step S2 comprises the following steps: 1) The system traverses the metadata of the railway dataset and identifies all character type columns; 2) Eliminate columns that are not suitable for writing watermarks; 3) Generate an index list of writable columns to prepare for subsequent writing; 4) The system processes the railway dataset row by row.

[0013] Preferably, the system processes the railway data set row by row as follows: 1) Randomly select a writable column, take out a character fragment from the character fragment to be written, insert the character fragment into the value of the selected column, and update the value of the column; 2) If a row of data fails to be written into all fragments, the system continues to write the remaining fragments in the next row; 3) After writing an invisible string completely, the system skips the specified number of lines according to the configured writing density; 4) Repeat steps 1-3 above until the entire data set is processed.

[0014] Preferably, in step S3, the steps of extracting the invisible character string are as follows: 1) The system reads the railway data set file that needs to be traced; 2) Put the read data rows into a queue with limited capacity; 3) Start multiple analysis threads and take out data rows from the queue for processing; 4) Each thread analyzes the data row and extracts possible watermark fragment information; 5) According to the fragment format, assemble the extracted fragments and try to reconstruct the complete invisible string; 6) If a complete invisible string is obtained, stop the extraction process; otherwise, continue processing until the end of the file.

[0015] Preferably, in step S3, a complete invisible character string is extracted, and the system directly confirms the corresponding watermark information; and outputs the tracing result, including the matched watermark information and the matching degree.

[0016] Compared with the prior art, the beneficial effects of the present invention are as follows: by adopting invisible characters to realize watermark embedding, while protecting the integrity of the data, the modification of the original data is minimized, and the accuracy and availability of the data are guaranteed; there is no need to adjust the data set structure, avoiding the large-scale transformation of the existing railway business system, and not affecting the normal operation of the existing system, thereby improving the system compatibility; overcoming the requirements of the existing watermark method for data immutability, fully adapting to the characteristics of frequent updates of railway business data, and solving the problem of inconsistent data numbers that may be caused in data paging queries; there is no need to develop specific watermark technology for different types of data, and it has wide versatility. By improving the concealment and security of the watermark, it provides technical means for effective traceability after data leakage, and even in the case of partial loss or modification of the data, it can still track and identify the source of the data, significantly enhancing the traceability of the data. In general, the present invention can effectively protect the security of sensitive data and does not affect the normal operation of the existing business system. The watermark traceability method has important practical value and promotion and application prospects. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] Figure 1 It is a schematic diagram of the process of the present invention; Figure 2 A schematic diagram of the invisible character string generation process of the present invention; Figure 3 This is a schematic diagram of the invisible character string writing process of the present invention; Figure 4 It is a schematic diagram of the invisible character string extraction process of the present invention. DETAILED DESCRIPTION

[0018] The present invention can be explained in detail through the following embodiments. The purpose of disclosing the present invention is to protect all technical improvements within the scope of the present invention. In the description of the present invention, it should be understood that if there are terms such as "upper", "lower", "front", "back", "left", "right", etc. indicating directions or positional relationships, they only correspond to the drawings of the present application for the convenience of describing the present invention, and do not indicate or imply that the device or element referred to must have a specific direction.

[0019] See also Figure 1-3 The present invention provides a technical solution: a railway sensitive data watermark tracing method based on invisible characters, comprising the following steps: S1. Watermark information preprocessing: Calculate the watermark information to be written into summary information of fixed length, then generate invisible strings according to predefined encoding rules, and store the two correspondingly. Segment the invisible strings according to the configured grouping settings. The detailed steps are as follows: S1.1 Generate an invisible string (such as Figure 2 shown): Before embedding, the watermark information that may contain a lot of information is preprocessed to generate characters of fixed length. In step S1, the watermark information summary in hexadecimal form is calculated using the SM3 cryptographic hash algorithm, and an invisible string is generated according to the encoding rules. The two are stored correspondingly. The encoding rules are as follows: Hexadecimal Replace characters 0 \u202d 1 \u206e 2 \u2060 3 \u200d 4 \u206b 5 \u200e 6 \u206c 7 \u206a 8 \u202c 9 \u202a A \u200b B \u202b C \u202e D \u200c E \u206f F \u206d S1.2 Invisible string fragmentation: Group the invisible character string generated in step S1.1 according to the configured grouping settings, and the number of groups cannot be greater than 15; If there is no grouping, that is, there is only one group, the group header number is F(16), and the information to be written is: F + the invisible string generated in step 1.1; If divided into two groups, the information to be written in group 1 is: 0 + the invisible characters generated in step 1 (1 / 2), and the information to be written in group 2 is: 1 + the remaining invisible characters generated in step 1; The other groups are grouped in the same way, and finally the invisible string in step 1.1 is divided into many segments.

[0020] S2. Writing watermark information: traverse the result set metadata to determine the columns and positions to be written, and write the invisible string shards accordingly; The invisible character string representing the watermark information generated in step S1 is written into the data set to be output. The specific process is: S2.1 Determine the columns that can be written: a) The system traverses the metadata of the railway dataset (ResultSetMeta) and identifies all character type columns; b) According to the preset configuration, columns that are not suitable for writing watermarks (such as columns associated with other systems) are removed; c) Generate an index list of writable columns to prepare for subsequent writing; S2.2 Invisible string write (such as Figure 3 shown): When outputting the result set (ResultSet) line by line, inserting the fragments of the invisible string in step S1 into the character column thereof, the specific operation is: Traverse the result set (ResultSet) to be output and process each row of data before outputting it, obtain the column according to the column position (Index) obtained in the step S2.1, and then randomly select a fragment value in the step S1.2, insert it into the obtained column value and update this column, and continuously write the fragment information according to this process. If all the fragments of a column in a row are not written, the second row continues to write the remaining fragments until all the fragment information is written, that is, a complete invisible character has been inserted at this time. If the write density is configured, after writing a complete invisible character, it will skip the specified number of rows and continue to write the invisible character information according to the step S2.2 again.

[0021] S3, watermark tracing: read the provided data set file (CSV, EXCEL) and disassemble and analyze it to obtain the written watermark information. The specific process is: S3.1 Extract invisible strings (such as Figure 4 shown): The provided data set file (CSV, EXCEL) is read line by line, and the read content is placed in a queue with limited capacity. Multiple disassembly threads take out the line content from the queue and analyze it to obtain the watermark fragment information written in the step S2.2, and assemble it according to the fragment format defined in the step S1.2 until a complete invisible string is obtained. If complete information is obtained, this process is stopped, otherwise the entire content of the data set file is read.

[0022] S3.2 Analyze watermark information: According to the invisible character string obtained in step S3.1, the matching degree with the invisible character string in step S1.1 is calculated, and the actual watermark information corresponding to the value with the maximum matching degree is output. If the complete invisible character string is obtained in step S3.1, the confirmed watermark information can be output.

[0023] The present invention provides a universal watermark tracing method applicable to various types of railway sensitive data. It does not need to develop specific watermark technologies for different types of data, solves the problem that traditional watermark technologies change the structure of railway data sets, avoids large-scale transformation of existing railway business systems, overcomes the requirements of existing watermark methods for data immutability, adapts to the characteristics of frequent updates of railway business data, solves the problem of inconsistent data numbers that may be caused by existing watermark technologies in railway data paging queries, avoids major modifications to railway original data, and ensures data accuracy and availability.

[0024] The parts of the present invention that are not described in detail are prior art. It is obvious to those skilled in the art that the present invention is not limited to the details of the above-mentioned exemplary embodiments, and the present invention can be implemented in other specific forms without departing from the spirit or basic characteristics of the present invention; therefore, no matter from which point of view, the embodiments should be regarded as exemplary and non-restrictive, and it is intended that all changes that fall within the meaning and scope of equivalent elements are included in the content of the present invention.

Claims

1. A railway sensitive data watermark tracing method based on invisible characters, characterized in that: The following steps are involved: S1. Watermark information preprocessing: Calculate the watermark information to be written into summary information of fixed length, then generate invisible strings according to predefined encoding rules, store the two correspondingly, and segment the invisible strings according to the configured grouping settings; S2. Writing watermark information: traverse the result set metadata to determine the columns and positions to be written, and write the invisible string shards accordingly; S3, watermark tracing: read the provided data set file line by line, extract the invisible string, compare the extracted invisible string with the pre-stored watermark information, calculate the matching degree, and output the tracing result.

2. According to claim 1, a railway sensitive data watermark tracing method based on invisible characters is characterized by: In the step S1, the watermark information is calculated using the SM3 algorithm to obtain summary information, which is a hexadecimal string of fixed length.

3. The method for tracing the railway sensitive data watermark based on invisible characters according to claim 2 is characterized by: In step S1, the hexadecimal string is converted into an invisible string according to the encoding rules, and the encoding rules are as follows: 0-\u202d, 1-\u206e, 2-\u2060, 3-\u200d, 4-\u206b, 5-\u200e, 6-\u206c, 7-\u206a, 8-\u202c, 9-\u202a, A-\u200b, B-\u202b, C-\u202e, D-\u200c, E-\u206f, F-\u206d.

4. According to claim 2, a railway sensitive data watermark tracing method based on invisible characters is characterized by: In step S1, the invisible character string grouping steps are as follows: No grouping: that is, there is only one group, and the information to be written is: F + the invisible string generated in step S1; Divide into two groups: the information to be written in group 1 is 0 + 1 / 2 of the invisible string generated in step S1; the information to be written in group 2 is 1 + the remaining invisible string; Divide into three groups: the information to be written in group 1 is 0 + 1 / 3 of the invisible string generated in step S1; the information to be written in group 2 is 1 + the remaining 1 / 2 of the invisible string; the information to be written in group 3 is 2 + the remaining invisible string; The other groups are divided in the same way, and finally the invisible string in step S1 is divided into many fragments; The number of groups shall not be less than 15 (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F).

5. According to claim 1, a railway sensitive data watermark tracing method based on invisible characters is characterized by: The step S2 comprises the following steps: 1) The system traverses the metadata of the railway dataset and identifies all character type columns; 2) Eliminate columns that are not suitable for writing watermarks; 3) Generate an index list of writable columns to prepare for subsequent writing; 4) The system processes the railway dataset row by row.

6. The railway sensitive data watermark tracing method based on invisible characters according to claim 5 is characterized by: The system processes the railway dataset row by row as follows: 1) Randomly select a writable column, take out a character fragment from the character fragment to be written, insert the character fragment into the value of the selected column, and update the value of the column; 2) If a row of data fails to be written into all fragments, the system continues to write the remaining fragments in the next row; 3) After writing an invisible string completely, the system skips the specified number of lines according to the configured writing density; 4) Repeat steps 1-3 above until the entire data set is processed.

7. The railway sensitive data watermark tracing method based on invisible characters according to claim 1 is characterized by: In step S3, the steps of extracting the invisible character string are as follows: 1) The system reads the railway data set file that needs to be traced; 2) Put the read data rows into a queue with limited capacity; 3) Start multiple analysis threads and take out data rows from the queue for processing; 4) Each thread analyzes the data row and extracts possible watermark fragment information; 5) According to the fragment format, assemble the extracted fragments and try to reconstruct the complete invisible string; 6) If a complete invisible string is obtained, stop the extraction process; otherwise, continue processing until the end of the file.

8. The railway sensitive data watermark tracing method based on invisible characters according to claim 1 is characterized by: In step S3, a complete invisible character string is extracted, and the system directly confirms the corresponding watermark information; and outputs the tracing result, including the matched watermark information and the matching degree.

Images